prm_ghw_dimension_reduction_zero
For any finite field K and parameters e, m, r, the generalized Hamming weight of PRM_K(e + 0*(|K|-1), m) of rank r equals that of PRM_K(e, m - 0).
Statement
theorem prm_ghw_dimension_reduction_zero (K : Type*) [Field K] [Fintype K] (e m r : ℕ) : prmGHW K (e + 0 * (Fintype.card K - 1)) m r = prmGHW K e (m - 0) r
- Source
- step towards prm_ghw_dimension_reduction_equality
- Verified
- 07 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- prmGHWGiven a finite field K with [Field K] [Fintype K] and natural numbers d, m, and r, prmGHW K d m r is the r-th generalized Hamming weight…
- finite_avoidance_of_three_binomial_momentsFor a natural-valued function d on a finite sample space J, if the sum of d plus the sum of binomial(d,3) is strictly less than the…
- Used by 1
- prm_ghw_dimension_reduction_leLet K be a finite field of order q, let e, m ≥ 1, 0 ≤ t ≤ m - 1, and h = m - t. For every 1 ≤ r ≤ k_e(h), the r-th generalized Hamming…
The proof, explained
This theorem establishes the trivial base case (t = 0) of dimension reduction for generalized Hamming weights of projective Reed-Muller codes. Because 0 * (|K| - 1) = 0 and m - 0 = m, the code parameters on both sides are identical, and the equality holds by basic arithmetic simplification.
prmGHW K (e + 0 * (|K| - 1)) m r = prmGHW K e (m - 0) r automation
The equality is an immediate arithmetic identity. Since 0 * (|K| - 1) = 0, we have e + 0 * (|K| - 1) = e, and m - 0 = m. Both sides of the equation therefore evaluate to the identical expression prmGHW K e m r. Lean's simplifier (`simp`/`simpa`) simplifies the elementary natural number arithmetic and closes the goal by reflexivity.
uses
finite_avoidance_of_three_binomial_momentsprmGHW K (e + 0 * (Fintype.card K - 1)) m r = prmGHW K e (m - 0) r := by first | exact finite_avoidance_of_three_binomial_moments | (apply finite_avoidance_of_three_binomial_moments <;> assumption) | (apply finite_avoidance_of_three_binomial_moments <;> simp_all) | simpa using finite_avoidance_of_three_binomial_moments | (simp only [prmGHW] at *; first | exact finite_avoidance_of_three_binomial_moments | (apply finite_avoidance_of_three_binomial_moments <;> assumption) | (apply finite_avoidance_of_three_binomial_moments <;> simp_all) | simpa using finite_avoidance_of_three_binomial_moments)
finite_avoidance_of_three_binomial_moments- If a function d from a finite set J to the natural numbers satisfies ∑ d(j) + ∑ (d(j) choose 3) < |J| + ∑ (d(j) choose 2), then d(j) = 0 for some j.
- The proof is written as an automated trial-and-error tactic script (`first | exact ... | apply ... | simpa using ...`). Although `finite_avoidance_of_three_binomial_moments` is passed to `simpa`, this lemma is completely irrelevant to the statement: Lean's simplifier closes the goal automatically on the arithmetic alone before using the lemma.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Base case t = 0 of dimension reduction for generalized Hamming weights of projective Reed-Muller codes. -/theorem prm_ghw_dimension_reduction_zero (K : Type*) [Field K] [Fintype K] (e m r : ℕ) : prmGHW K (e + 0 * (Fintype.card K - 1)) m r = prmGHW K e (m - 0) r := by first | exact finite_avoidance_of_three_binomial_moments | (apply finite_avoidance_of_three_binomial_moments <;> assumption) | (apply finite_avoidance_of_three_binomial_moments <;> simp_all) | simpa using finite_avoidance_of_three_binomial_moments | (simp only [prmGHW] at *; first | exact finite_avoidance_of_three_binomial_moments | (apply finite_avoidance_of_three_binomial_moments <;> assumption) | (apply finite_avoidance_of_three_binomial_moments <;> simp_all) | simpa using finite_avoidance_of_three_binomial_moments)