AFTD Auto-Formalizing Theoretical Domains

f2CubicEdgeCondition

def

The F₂ 'fourth-moment evenness' predicate: given u : (Fin 2)^n and y : Fin 4 → (Fin 2)^n, one has y 3 = y 0 + y 1 + y 2 and, for every 3-subset e of Fin n, the integer ∑_{i : Fin 4} (∏_{j ∈ e} (y i j) + ∏_{j ∈ e} (y i + u) j) is even.

Statement

noncomputable def f2CubicEdgeCondition {n : ℕ} (u : Fin n → Fin 2) (y : Fin 4 → Fin n → Fin 2) : Prop
Source
step towards op_1254_cubic_hypergraph_fluctuation_mean_zero
Verified
06 Nov 2026
Axioms
none listed
Built on 1
  • CubicEdgeFor a natural number n, CubicEdge n is the subtype of 3-element subsets of Fin n, representing a hyperedge in a 3-uniform hypergraph on n…
Used by 2
  • f2CubicConditionCountThe number of pairs (u, y) with u : (Fin 2)^n and y : Fin 4 → (Fin 2)^n satisfying the fourth-moment evenness condition…
  • f2CubicEdgeCondition_witness_zeroNon-vacuity of the fourth-moment predicate: u = 0 and y = 0 always satisfy f2CubicEdgeCondition, so the predicate is not empty for any n.

Lean source view module on GitHub

/-- Predicate whose fibre count equals the value of the Pauli fourth-moment integral up to (2^n)^{-3}. -/
noncomputable def f2CubicEdgeCondition {n : ℕ} (u : Fin n → Fin 2) (y : Fin 4 → Fin n → Fin 2) : Prop := y 3 = y 0 + y 1 + y 2 ∧ ∀ e : CubicEdge n, Even (∑ i : Fin 4, ((∏ j ∈ (e : Finset (Fin n)), (y i j).val) + (∏ j ∈ (e : Finset (Fin n)), ((y i + u) j).val)))
See it in the graphDiscuss this resultChallenge it