AFTD Auto-Formalizing Theoretical Domains

prmGHW

def

Given 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 generalizedHammingWeight (prmCode K d m) r of the projective Reed-Muller code prmCode K d m on the finite projective space Projectivization K (Fin (m + 1) → K).

Statement

noncomputable def prmGHW (K : Type*) [Field K] [Fintype K] (d m r : ℕ) : ℕ
Defined in
arXiv:2611.08203 Section 2.1 & Remark 6.11
Verified
06 Nov 2026
Axioms
none listed
Built on 2
  • prmCodeGiven a field K and natural numbers d and m, prmCode K d m is the projective Reed-Muller code PRM(d, m) over K, defined as the K-subspace…
  • generalizedHammingWeightFor a field K and a finite index set I with [Fintype I], the r-th generalized Hamming weight generalizedHammingWeight C r of a linear code…
Used by 2
  • 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…
  • prm_ghw_dimension_reduction_zeroFor 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,…

Read back from the Lean

Given a finite field K and natural numbers d, m, and r, prmGHW K d m r is defined as the r-th generalized Hamming weight of the projective Reed–Muller code prmCode K d m on the projective space ℙ(K^{m+1}).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The r-th generalized Hamming weight of PRM(d, m). -/
noncomputable def prmGHW (K : Type*) [Field K] [Fintype K] (d m r : ℕ) : ℕ := letI : Fintype (Projectivization K (Fin (m + 1) → K)) := Fintype.ofFinite _
  generalizedHammingWeight (prmCode K d m) r
See it in the graphDiscuss this resultChallenge it