AFTD Auto-Formalizing Theoretical Domains

matrix_product_invariant

def

The product invariant X(F) is the smallest positive integer p such that F embeds as a configuration in every p-fold product with factors chosen from {I_m, I_m^c, T_m} for all sufficiently large m.

Statement

noncomputable def matrix_product_invariant {m_F n_F : Type*}
    (F : Matrix m_F n_F Bool) : ℕ
Defined in
arXiv:2610.13987, Definition 2
Verified
23 Oct 2026
Axioms
none listed
Built on 1
  • is_config_in_all_productsA binary matrix F is a configuration in every p-fold product of matrices from {I_m, I_m^c, T_m} for all sufficiently large m.

Read back from the Lean

matrix_product_invariant F is the infimum (sInf) in ℕ of the set of all natural numbers p ≥ 1 such that is_config_in_all_products F p holds. Here, is_config_in_all_products F p asserts that there exists m₀ : ℕ such that for all m ≥ m₀ and for every function τ : Fin p → Fin 3, there exist injective functions r : m_F → Fin p × Fin m and c : n_F → (Fin p → Fin m) such that for all i : m_F and j : n_F, the truth value of: - (r i).2 = (c j) (r i).1, if τ (r i).1 = 0; - (r i).2 ≠ (c j) (r i).1, if τ (r i).1 = 1; - ((r i).2 : ℕ) ≤ ((c j) (r i).1 : ℕ), otherwise (i.e., if τ (r i).1 = 2), equals F i j.

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 forbidden configuration product invariant X(F): the smallest positive integer p such that F is a configuration in every p-fold product of matrices from {I_m, I_m^c, T_m} for all sufficiently large m. -/
noncomputable def matrix_product_invariant {m_F n_F : Type*}
    (F : Matrix m_F n_F Bool) : ℕ :=
  sInf { p : ℕ | 1 ≤ p ∧ is_config_in_all_products F p }
See it in the graphDiscuss this resultChallenge it