AFTD Auto-Formalizing Theoretical Domains

unit_hamming_max_triangle_free

def

The maximum cardinality unit_hamming_max_triangle_free n q of a finite set A : Finset (Fin n → Fin q) satisfying unit_hamming_triangle_free A, defined as the supremum of cardinalities of such finite sets.

Statement

noncomputable def unit_hamming_max_triangle_free (n q : ℕ) : ℕ
Defined in
arXiv:2610.32789 Definition 1.1
Verified
26 Oct 2026
Axioms
none listed
Built on 1
  • unit_hamming_triangle_freeA finite set A : Finset (Fin n → Fin q) is unit_hamming_triangle_free if for all x, y, z : Fin n → Fin q, if x ∈ A, y ∈ A, z ∈ A, and x ≠…
Used by 1
  • unit_hamming_max_triangle_free_eqFor every fixed integer q ≥ 2 and every integer n ≥ 1, the maximum size unit_hamming_max_triangle_free n q of a triangle-free vertex…

Read back from the Lean

Given natural numbers n and q, unit_hamming_max_triangle_free n q is defined as the supremum (maximum) of the set of natural numbers k for which there exists a finite set A of functions from Fin n to Fin q such that A is unit_hamming_triangle_free and A has cardinality k. Here, A is unit_hamming_triangle_free if for all distinct elements x, y, z ∈ A, it is not the case that hammingDist x y = 1, hammingDist y z = 1, and hammingDist x z = 1 simultaneously.

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 maximum size T_q(n, 1) of a vertex subset of (Fin n → Fin q) inducing a triangle-free subgraph in the unit-distance Hamming graph. -/
noncomputable def unit_hamming_max_triangle_free (n q : ℕ) : ℕ := sSup {k : ℕ | ∃ A : Finset (Fin n → Fin q), unit_hamming_triangle_free A ∧ A.card = k}
See it in the graphDiscuss this resultChallenge it