AFTD Auto-Formalizing Theoretical Domains

monomial

def

For a natural number s and a finite subset T of Fin s, the monomial associated with T is the function from (Fin s → ZMod 2) to ZMod 2 sending each vector x to the product over i in T of x i in ZMod 2.

Statement

def monomial {s : ℕ} (T : Finset (Fin s)) : (Fin s → ZMod 2) → ZMod 2
Defined in
arXiv:2610.09341, Section 3.1
Verified
25 Oct 2026
Axioms
none listed
Used by 13
  • 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…
  • condorcet_cubic_subset_potential_residue_barrierFor candidates indexed modulo19, orient a to b when b-a is one of the nine nonzero quadratic residues. Consider any finite family of…
  • hamming_norm_sum_two_degree_six_monomialsLet I and J be two 6-element subsets of Fin 12. Then the Hamming norm of the sum of the corresponding coordinate monomials monomial I +…
  • monomial_mulFor any natural number s and any two finite subsets I and J of Fin s, the pointwise product of the coordinate monomials monomial I and…
  • op75_tm2_inhabited_compPolynomial-time finite stack machines compose whenever their intermediate alphabet is inhabited; the input and output alphabets are…
  • op75_tm2_bool_compPolynomial-time finite stack machines compose when their intermediate alphabet is Boolean, for arbitrary input and output alphabets.
  • designated_partition_six_tuple_twelve_mod_threeFor every natural number n, 3 divides the number of designated partition 6-tuples of size 12n + 10, designated_partition_k_tuple 6 (12 * n…
  • possible_weights_sum_two_degree_six_monomialsThe set of Hamming norms of all sums monomial I + monomial J of two coordinate monomials corresponding to 6-element subsets I, J of Fin 12…
  • reed_muller_four_block_concat_degree_sevenLet g0 and g3 be Boolean functions on Fin 12 in the Reed-Muller code reed_muller_code 5 12, and let g1 and g2 be Boolean functions on Fin…
  • quantitative_combinatorial_nullstellensatzFor a multivariate polynomial f of total degree at most ∑ t_i over a field F, the coefficient of the monomial ∏ x_i^{t_i} equals the sum…
  • reed_muller_code_monoFor any natural numbers r1, r2, and s such that r1 ≤ r2, the Reed-Muller code reed_muller_code r1 s is a submodule of reed_muller_code r2 s.
  • hamming_norm_monomialFor any natural number s and any finite subset T of Fin s, the Hamming norm of the coordinate monomial monomial T as a function from (Fin…
  • reed_muller_codeFor natural numbers r and s, the binary Reed-Muller code RM(r, s) is the submodule of Boolean functions from (Fin s → ZMod 2) to ZMod 2…

Read back from the Lean

For a natural number s and a subset T : Finset (Fin s), monomial T is defined as the function from (Fin s → ZMod 2) to ZMod 2 that sends an input x to the product over i ∈ T of x i (with the empty product evaluating to 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 monomial associated with an index set T : Finset (Fin s) as a Boolean function. -/
def monomial {s : ℕ} (T : Finset (Fin s)) : (Fin s → ZMod 2) → ZMod 2 := fun x => ∏ i ∈ T, x i
See it in the graphDiscuss this resultChallenge it