AFTD Auto-Formalizing Theoretical Domains

prmEvalMap

def

Given 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 + 1 variables over K (MvPolynomial.homogeneousSubmodule (Fin (m + 1)) K d) to functions from Projectivization K (Fin (m + 1) → K) to K, sending each homogeneous polynomial F to the function evaluating F at P.rep for each projective point P.

Statement

noncomputable def prmEvalMap (K : Type*) [Field K] (d m : ℕ) :
    MvPolynomial.homogeneousSubmodule (Fin (m + 1)) K d →ₗ[K] (Projectivization K (Fin (m + 1) → K) → K)
Defined in
arXiv:2611.08203 Section 2.1
Verified
06 Nov 2026
Axioms
none listed
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…
  • 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…

Read back from the Lean

Given a field K and natural numbers d and m, prmEvalMap K d m is the K-linear map from the submodule of degree-d homogeneous polynomials in m + 1 variables over K (MvPolynomial.homogeneousSubmodule (Fin (m + 1)) K d) to the K-vector space of functions from the projectivization of K^(m+1) (Projectivization K (Fin (m + 1) → K)) to K, defined by sending each homogeneous polynomial F to the function that evaluates F at P.rep for each projective point P.

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

/-- Evaluation map from degree-d homogeneous polynomials in m+1 variables to functions on ℙ^m(K). -/
noncomputable def prmEvalMap (K : Type*) [Field K] (d m : ℕ) :
    MvPolynomial.homogeneousSubmodule (Fin (m + 1)) K d →ₗ[K] (Projectivization K (Fin (m + 1) → K) → K) where
  toFun F := fun P => MvPolynomial.eval P.rep F.1
  map_add' F G := by
    ext P
    simp only [Submodule.coe_add, map_add, Pi.add_apply]
  map_smul' c F := by
    ext P
    simp only [Submodule.coe_smul, RingHom.id_apply, Pi.smul_apply, smul_eq_mul]
    rw [MvPolynomial.smul_eq_C_mul, map_mul, MvPolynomial.eval_C]
See it in the graphDiscuss this resultChallenge it