An all-odd triple cannot have all four sums in a cube-free set
ProvedZ2nFiveEighths.odd_triple_cube_couplingFor a natural number and a cube-free finite subset of : for any , if the three odd lifts , , all lie in , then at least one of the four derived sums fails to lie in — namely the three pairwise sums , , (even lifts) or the total sum (odd lift). This is the all-odd-generator analogue of the mixed triple coupling (42677967): the odd generators , , in would otherwise form a forbidden cube , , , . It is the load-bearing coupling lemma for the pair induction hypothesis in the Long-Wagner Conjecture 5.1 (c040c7bf) track: when a cube-free set in is split into even and odd halves at level , this lemma supplies the odd-odd-odd half of the pair hypothesis. Same proof shape as the mixed version — a routine cube-lift argument from cube-freeness.
import Mathlib import Definitions.Def_Z2nCubeFreeLayers
namespace Z2nFiveEighths
theorem odd_triple_cube_coupling (n : ℕ) (A : Finset (ZMod (2 ^ (n + 1)))) (hA : CubeFree A) :
∀ x y z : ZMod (2 ^ n),
((2 * x.val + 1 : ℕ) : ZMod (2 ^ (n + 1))) ∈ A →
((2 * y.val + 1 : ℕ) : ZMod (2 ^ (n + 1))) ∈ A →
((2 * z.val + 1 : ℕ) : ZMod (2 ^ (n + 1))) ∈ A →
((2 * (x + y + 1).val : ℕ) : ZMod (2 ^ (n + 1))) ∉ A ∨
((2 * (y + z + 1).val : ℕ) : ZMod (2 ^ (n + 1))) ∉ A ∨
((2 * (z + x + 1).val : ℕ) : ZMod (2 ^ (n + 1))) ∉ A ∨
((2 * (x + y + z + 1).val + 1 : ℕ) : ZMod (2 ^ (n + 1))) ∉ A := by sorry
end Z2nFiveEighths