AFTD Auto-Formalizing Theoretical Domains

prmCode

def

Given 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 of functions from Projectivization K (Fin (m + 1) → K) to K given by the range LinearMap.range (prmEvalMap K d m).

Statement

noncomputable def prmCode (K : Type*) [Field K] (d m : ℕ) :
    Subspace K (Projectivization K (Fin (m + 1) → K) → K)
Defined in
arXiv:2611.08203 Section 2.1
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • prmEvalMapGiven a field K and natural numbers d and m, prmEvalMap K d m is the K-linear evaluation map from degree-d homogeneous polynomials in m +…
Used by 3
  • prmDimGiven a field K and natural numbers d and m, prmDim K d m is the dimension Module.finrank K of the projective Reed-Muller code prmCode K d…
  • 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…
  • 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…

Read back from the Lean

For a field K and natural numbers d and m, prmCode K d m is defined as the K-subspace of functions from the projectivization of Fin (m + 1) → K to K given by the range of the evaluation linear map prmEvalMap K d m.

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 projective Reed-Muller code PRM(d, m) over K. -/
noncomputable def prmCode (K : Type*) [Field K] (d m : ℕ) :
    Subspace K (Projectivization K (Fin (m + 1) → K) → K) := LinearMap.range (prmEvalMap K d m)
See it in the graphDiscuss this resultChallenge it