cycle_power_four_zero_phase_half_no_defects
Every exponent-two zero-phase defective half model has no defects.
Statement
theorem cycle_power_four_zero_phase_half_no_defects
(y : ℤ → ℕ → Bool) (e : ℤ → Bool)
(hm : cycle_power_dyadic_defective_half_model 2 y e 0) : ∀ v, e v = false- Source
- Defective half-model reduction for research thread RT-1.
- Verified
- 10 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 3
- cycle_power_dyadic_defective_half_modelA dyadic half model with a Boolean defect: lower ranks have unique owners, top-rank ownership and the active count each lose one at a…
- cycle_power_four_zero_defect_local_coreFor a span-four model, the endpoint-count and top-owner equations and distance-one coverage rule out a defect.
- cycle_power_dyadic_class_weightThe weighted number of pairs in a dyadic arc: the endpoint pair has weight two, and distances 2^m-2^j for 1≤j<m have weight one.
The proof, explained
The proof eliminates defects by reducing the exponent-two dyadic model to an existing local core lemma (`cycle_power_four_zero_defect_local_core`) applied to the interior coordinate tracks $a(p) = y(p, 1)$ and $b(p) = y(p, 2)$. First, the dyadic exactness condition at scale zero forces the boundary values $y(p, 0)$ and $y(p, 3)$ to be true on all fibers. Substituting these boundary values into the top-scale defect equation and the fiber count equation verifies the first two hypotheses of the local core theorem. Finally, specializing the distance coverage condition to distance $d = 1$ produces a consecutive true pair, which by case splitting on the offset $a \in \{0, 1, 2\}$ establishes the local core's third hypothesis.
Unpack the definition of the defective half-model.
The assumption `hm` that $(y, e)$ forms an exponent-two zero-phase dyadic defective half model is unpacked into its five components: the weight condition (`htight`), dyadic exactness (`hexact`), the top-scale defect equation (`htop`), the distance coverage condition (`hcover`), and the fiber count sum (`hcount`).
rcases hm with ⟨htight, hexact, htop, hcover, hcount⟩
For every fiber index $p \in \mathbb{Z}$, the boundary bits are true: $y(p, 0) = \text{true}$ and $y(p, 3) = \text{true}$.
Specializing the exact dyadic condition `hexact` to scale $j = 0$ (valid since $0 + 1 < 2$) and fiber $p$, the sum over $a \in \{0\}$ has a single term, $(y(p, 0) \land y(p, 3)).\text{toNat} = 1$. Expanding the sum via `Finset.sum_range_succ` and evaluating boolean conjunction shows that both $y(p, 0)$ and $y(p, 3)$ must be true.
uses
Finset.sum_range_succhave hend (p : ℤ) : y p 0 = true ∧ y p 3 = true := by have h := hexact 0 (by omega) p norm_num [Finset.sum_range_succ] at h cases h0 : y p 0 <;> cases h3 : y p 3 <;> simp_all
To show $e(v) = \text{false}$ everywhere, it suffices to verify the three local hypotheses of `cycle_power_four_zero_defect_local_core` for $a(p) = y(p, 1)$ and $b(p) = y(p, 2)$.
Applying `cycle_power_four_zero_defect_local_core` reduces the theorem to checking three local conditions on the interior tracks $y(\cdot, 1)$ and $y(\cdot, 2)$: the top-scale sum, the fiber count sum, and the adjacency coverage condition.
uses
cycle_power_four_zero_defect_local_coreapply cycle_power_four_zero_defect_local_core (fun p => y p 1) (fun p => y p 2) e
For every $v \in \mathbb{Z}$, the top-scale condition holds: $(y(v, 2)).\text{toNat} + (y(v-1, 1)).\text{toNat} + (e(v)).\text{toNat} = 1$.
The hypothesis `htop` gives a sum over $a \in \{0, 1\}$ plus $e(v)$. Expanding the summation with `Finset.sum_range_succ` and using the boundary values $y(v, 0) = \text{true}$ and $y(v-1, 3) = \text{true}$ reduces the sum of the two conjunctions to $(y(v, 2)).\text{toNat} + (y(v-1, 1)).\text{toNat}$, matching the required goal.
uses
Finset.sum_range_succ· intro v have h := htop v norm_num [Finset.sum_range_succ, hend] at h simpa using h
For every $v \in \mathbb{Z}$, the count condition holds: $(y(v-1, 1)).\text{toNat} + (y(v-2, 2)).\text{toNat} + (e(v)).\text{toNat} = 1$.
The hypothesis `hcount` states that the sum of $y(v-a, a).\text{toNat}$ over $a \in \{0, 1, 2, 3\}$ plus $(e(v)).\text{toNat}$ equals $2 + 1 = 3$. Expanding the range with `Finset.sum_range_succ` and substituting the boundary values $y(v, 0) = 1$ and $y(v-3, 3) = 1$ yields $1 + y(v-1, 1) + y(v-2, 2) + 1 + e(v) = 3$. Subtracting 2 via linear integer arithmetic (`omega`) gives the desired identity.
uses
Finset.sum_range_succ· intro v have h := hcount v norm_num [Finset.sum_range_succ, hend] at h omega
For every $v \in \mathbb{Z}$, the coverage condition holds: $y(v, 1) = \text{true} \lor (y(v-1, 1) = \text{true} \land y(v-1, 2) = \text{true}) \lor y(v-2, 2) = \text{true}$.
Instantiating `hcover` with distance $d = 1$ provides an index $a < 3$ such that both $y(v-a, a) = \text{true}$ and $y(v-a, a+1) = \text{true}$. Case analysis on $a \in \{0, 1, 2\}$ completes the proof: $a = 0$ yields $y(v, 1) = \text{true}$, $a = 1$ yields $y(v-1, 1) = \text{true} \land y(v-1, 2) = \text{true}$, and $a = 2$ yields $y(v-2, 2) = \text{true}$.
· intro v obtain ⟨a, ha, h1, h2⟩ := hcover 1 (by norm_num) (by norm_num) (by norm_num) v have ha' : a < 3 := by norm_num at ha ⊢; omega interval_cases a · left; simpa using h2 · right; left; exact ⟨by simpa using h1, by simpa using h2⟩ · right; right; simpa using h1
Finset.sum_range_succ- The sum of a sequence over `Finset.range (n + 1)` equals the sum over `Finset.range n` plus the value at index `n`.
cycle_power_four_zero_defect_local_core- For boolean sequences $a, b, e$ on $\mathbb{Z}$, if the top-scale condition $b(v) + a(v-1) + e(v) = 1$, the count condition $a(v-1) + b(v-2) + e(v) = 1$, and the coverage condition $a(v) \lor (a(v-1) \land b(v-1)) \lor b(v-2)$ hold for all $v \in \mathbb{Z}$, then $e(v) = \text{false}$ for all $v$.
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.
theorem cycle_power_four_zero_phase_half_no_defects (y : ℤ → ℕ → Bool) (e : ℤ → Bool) (hm : cycle_power_dyadic_defective_half_model 2 y e 0) : ∀ v, e v = false := by rcases hm with ⟨htight, hexact, htop, hcover, hcount⟩ have hend (p : ℤ) : y p 0 = true ∧ y p 3 = true := by have h := hexact 0 (by omega) p norm_num [Finset.sum_range_succ] at h cases h0 : y p 0 <;> cases h3 : y p 3 <;> simp_all apply cycle_power_four_zero_defect_local_core (fun p => y p 1) (fun p => y p 2) e · intro v have h := htop v norm_num [Finset.sum_range_succ, hend] at h simpa using h · intro v have h := hcount v norm_num [Finset.sum_range_succ, hend] at h omega · intro v obtain ⟨a, ha, h1, h2⟩ := hcover 1 (by norm_num) (by norm_num) (by norm_num) v have ha' : a < 3 := by norm_num at ha ⊢; omega interval_cases a · left; simpa using h2 · right; left; exact ⟨by simpa using h1, by simpa using h2⟩ · right; right; simpa using h1