cycle_power_rooted_reflect_cover
Reflection preserves coverage of every ordinary distance strictly between0 and the arc length.
Statement
theorem cycle_power_rooted_reflect_cover
(D : ℕ) (hD : 0 < D) (x : ℤ → ℕ → Bool)
(hcover : ∀ d : ℕ, 1 ≤ d → d < D → ∀ v : ℤ,
∃ a : ℕ, a < D-d ∧ x (v-(a : ℤ)) a = true ∧
x (v-(a : ℤ)) (a+d) = true) :
∀ d : ℕ, 1 ≤ d → d < D → ∀ v : ℤ,
∃ a : ℕ, a < D-d ∧ cycle_power_rooted_reflect D x (v-(a : ℤ)) a = true ∧
cycle_power_rooted_reflect D x (v-(a : ℤ)) (a+d) = true- Source
- Uniform structural route for OP-205 / RT-1, following arXiv:2610.15635. These are helper reductions, not a proof of the open covering value and not a research advance. The upper-vertical core remains an explicit unproved hypothesis.
- Verified
- 29 Oct 2026
- Axioms
Quot.soundpropext- Built on 1
- cycle_power_rooted_reflectReflects the offsets of a rooted Boolean profile in its arc of length D and changes its integer root so that physical lattice points are…
- Used by 2
- cycle_power_sixteen_block_geometry_reflectThe full radius16h Geometry hypotheses, including all ordinary distances and exact12h/14h/15h ownership, are preserved by simultaneous…
- cycle_power_dyadic_reflect_defective_half_modelReflecting a defective half model reverses its defect function and changes its top-owner phase from shift to half-span minus shift.
The proof, explained
To show that the reflected configuration covers any distance d strictly between 0 and D at any vertex v, we invoke the original coverage hypothesis at distance d and reflected vertex -v - d, obtaining an index a. We then choose the reflected offset b = D - d - 1 - a, which satisfies b < D - d. Under reflection, the endpoints at b and b + d correspond respectively to a + d and a in the original configuration, so both evaluate to true.
For any distance d with 1 ≤ d < D and vertex v, there exists an index a < D - d witnessing coverage at vertex -v - d in the original configuration x.
We introduce the distance d, its bounds 1 ≤ d < D, and the vertex v. We then instantiate the coverage hypothesis hcover with distance d and base vertex -v - d to obtain an index a < D - d such that both x(-v - d - a, a) = true and x(-v - d - a, a + d) = true.
intro d hd hdD v obtain ⟨a,ha,hlo,hhi⟩ := hcover d hd hdD (-v-(d : ℤ))
The reflected index b = D - d - 1 - a satisfies b < D - d, correctly aligns the base position, and swaps the two endpoints to a + d and a.
We set b := D - d - 1 - a. Using linear arithmetic (`omega`), we verify four relations: first, b < D - d; second, D - 1 - b = a + d; third, D - 1 - (b + d) = a; and fourth, the reflected base position -(v - b) - (D - 1) simplifies to -v - d - a.
let b := D-d-1-a have hb : b < D-d := by dsimp [b]; omega have hi₁ : D-1-b=a+d := by dsimp [b]; omega have hi₂ : D-1-(b+d)=a := by dsimp [b]; omega have hp : -(v-(b : ℤ))-((D-1 : ℕ) : ℤ) = -v-(d : ℤ)-(a : ℤ) := by dsimp [b]; omega
The candidate b is a valid witness, reducing the goal to checking the two endpoint conditions for the reflected configuration.
We instantiate the existential quantifier with b and provide the bound hb : b < D - d, leaving two subgoals for the boolean values of the reflected configuration at offsets b and b + d.
refine ⟨b,hb,?_,?_⟩The reflected configuration at base vertex v - b and offset b evaluates to true.
By the definition of `cycle_power_rooted_reflect`, the value at (v - b, b) is x(-(v - b) - (D - 1), D - 1 - b). Rewriting via hp and hi₁ transforms this into x(-v - d - a, a + d), which is true by hypothesis hhi.
uses
cycle_power_rooted_reflect· simpa only [cycle_power_rooted_reflect,hi₁,hp] using hhiThe reflected configuration at base vertex v - b and offset b + d evaluates to true.
By the definition of `cycle_power_rooted_reflect`, the value at (v - b, b + d) is x(-(v - b) - (D - 1), D - 1 - (b + d)). Rewriting via hp and hi₂ transforms this into x(-v - d - a, a), which is true by hypothesis hlo.
uses
cycle_power_rooted_reflect· simpa only [cycle_power_rooted_reflect,hi₂,hp] using hlo
cycle_power_rooted_reflect- the reflection of a configuration x on a cycle of length D, mapping base position p and offset a to x(-p - (D - 1), D - 1 - a)
- Reflection reverses the order of the two endpoints: the lower offset b in the reflected configuration corresponds to the higher endpoint a + d in the original configuration, while the higher offset b + d corresponds to the lower endpoint a.
- The arithmetic inequalities and equalities involving natural subtraction and integer casting (lines 15–19) are verified by the linear arithmetic decision procedure `omega`.
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.
set_option maxHeartbeats 2000000set_option maxRecDepth 10000theorem cycle_power_rooted_reflect_cover (D : ℕ) (hD : 0 < D) (x : ℤ → ℕ → Bool) (hcover : ∀ d : ℕ, 1 ≤ d → d < D → ∀ v : ℤ, ∃ a : ℕ, a < D-d ∧ x (v-(a : ℤ)) a = true ∧ x (v-(a : ℤ)) (a+d) = true) : ∀ d : ℕ, 1 ≤ d → d < D → ∀ v : ℤ, ∃ a : ℕ, a < D-d ∧ cycle_power_rooted_reflect D x (v-(a : ℤ)) a = true ∧ cycle_power_rooted_reflect D x (v-(a : ℤ)) (a+d) = true := by intro d hd hdD v obtain ⟨a,ha,hlo,hhi⟩ := hcover d hd hdD (-v-(d : ℤ)) let b := D-d-1-a have hb : b < D-d := by dsimp [b]; omega have hi₁ : D-1-b=a+d := by dsimp [b]; omega have hi₂ : D-1-(b+d)=a := by dsimp [b]; omega have hp : -(v-(b : ℤ))-((D-1 : ℕ) : ℤ) = -v-(d : ℤ)-(a : ℤ) := by dsimp [b]; omega refine ⟨b,hb,?_,?_⟩ · simpa only [cycle_power_rooted_reflect,hi₁,hp] using hhi · simpa only [cycle_power_rooted_reflect,hi₂,hp] using hlo