f2CubicEdgeCondition_witness_zero
Non-vacuity of the fourth-moment predicate: u = 0 and y = 0 always satisfy f2CubicEdgeCondition, so the predicate is not empty for any n.
Statement
theorem f2CubicEdgeCondition_witness_zero (n : ℕ) : f2CubicEdgeCondition (0 : Fin n → Fin 2) (fun _ => 0)
- Source
- step towards op_1254_cubic_hypergraph_fluctuation_mean_zero
- Verified
- 07 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- f2CubicEdgeConditionThe 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…
- 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…
- vector_seq_max_entry_constantFor positive integers n and k, the maximum entry of a constant sequence of vectors equal to c is c.
The proof, explained
We show that the all-zero vector u = 0 and tuple y = 0 satisfy the fourth-moment edge condition `f2CubicEdgeCondition`. Unfolding the definition yields a linear relation 0 = 0 + 0 + 0 and an evenness requirement on a sum of products of coordinate values over each 3-element hyperedge. Since all coordinates are zero, every product evaluates to zero, making the sum zero, which is trivially even; the simplifier closes the goal immediately.
The all-zero vector u = 0 and tuple y = 0 satisfy `f2CubicEdgeCondition`. automation
Unfolding the definition of `f2CubicEdgeCondition`, the condition requires that y 3 = y 0 + y 1 + y 2 and that for every 3-element subset e, the sum over i ∈ Fin 4 of the products of entries on e is even. When all vectors are zero, the equality reduces to 0 = 0 + 0 + 0, which holds reflexively. Furthermore, since the edge has cardinality 3, each product has a factor of 0 and is therefore 0; the sum over the four indices is 0, which is even. Lean's simplifier verifies both conjuncts automatically.
uses
vector_seq_max_entry_constanttheorem f2CubicEdgeCondition_witness_zero (n : ℕ) : f2CubicEdgeCondition (0 : Fin n → Fin 2) (fun _ => 0) := by first | exact vector_seq_max_entry_constant | (apply vector_seq_max_entry_constant <;> assumption) | (apply vector_seq_max_entry_constant <;> simp_all) | simpa using vector_seq_max_entry_constant | (simp only [f2CubicEdgeCondition] at *; first | exact vector_seq_max_entry_constant | (apply vector_seq_max_entry_constant <;> assumption) | (apply vector_seq_max_entry_constant <;> simp_all) | simpa using vector_seq_max_entry_constant)
vector_seq_max_entry_constant- The maximum entry of an n × k matrix where every entry is constant with value c (provided n > 0 and k > 0) is c.
- The proof is structured as an automated search (`first | ...`) generated by a script. The final successful branch unfolds `f2CubicEdgeCondition` and simplifies the goal. Although `vector_seq_max_entry_constant` is provided to `simpa`, it is mathematically irrelevant and unused; simplification alone solves the goal.
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Sanity witness: the zero tuple satisfies the fourth-moment evenness condition. -/theorem f2CubicEdgeCondition_witness_zero (n : ℕ) : f2CubicEdgeCondition (0 : Fin n → Fin 2) (fun _ => 0) := by first | exact vector_seq_max_entry_constant | (apply vector_seq_max_entry_constant <;> assumption) | (apply vector_seq_max_entry_constant <;> simp_all) | simpa using vector_seq_max_entry_constant | (simp only [f2CubicEdgeCondition] at *; first | exact vector_seq_max_entry_constant | (apply vector_seq_max_entry_constant <;> assumption) | (apply vector_seq_max_entry_constant <;> simp_all) | simpa using vector_seq_max_entry_constant)