cycle_power_rooted_reflect_exact
Reflection of rooted profiles preserves exact pair ownership at every rank length L with0<L<=D; the physical starting point changes from v to -v-(D-L).
Statement
theorem cycle_power_rooted_reflect_exact (D L : ℕ) (hL : 0 < L) (hLD : L ≤ D) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (Finset.range L).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+D-L)).toNat) = 1) : ∀ v : ℤ, (Finset.range L).sum (fun a => (cycle_power_rooted_reflect D x (v-(a : ℤ)) a && cycle_power_rooted_reflect D x (v-(a : ℤ)) (a+D-L)).toNat) = 1
- 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
Classical.choiceQuot.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 3
- cycle_power_sixteen_block_outer_quarters_of_upper_verticalConditional on upper-half vertical exclusion for every Geometry model at the same h with exact8h ownership, a given such model has BOTH…
- 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 reflection preserves exact pair ownership, we fix an arbitrary base position v and reverse the summation over the window of size L using the substitution a ↦ L - 1 - a. Under this substitution, reflection transforms the paired indices L - 1 - a and (L - 1 - a) + D - L into a + D - L and a, and maps the spatial coordinate to -v - (D - L) - a. Pointwise equality between the summands follows by linear arithmetic and commutativity of boolean conjunction, matching the exactness hypothesis evaluated at position -v - (D - L).
The summation over a ∈ {0, ..., L-1} is reindexed in reverse order.
Fix an arbitrary base position v. Rewriting with Finset.sum_range_reflect replaces the summation variable a with L - 1 - j for j running from 0 to L - 1, reversing the order of summation.
uses
Finset.sum_range_reflectintro v rw [← Finset.sum_range_reflect]
It suffices to show that each term in the reversed sum matches the corresponding term of the exactness condition evaluated at position -v - (D - L).
We instantiate the exactness hypothesis hexact at the reflected base position -v - (D - L), which asserts that the sum at that position equals 1. Applying Finset.sum_congr reduces the goal to proving that the summands match pointwise for every index a in {0, ..., L-1}.
uses
Finset.sum_congrhave hs := hexact (-v-((D-L : ℕ) : ℤ)) convert hs using 1 apply Finset.sum_congr rfl
For an index a < L, the summand is expanded using the definition of cycle_power_rooted_reflect.
Fix an index a in range(L), noting that a < L by Finset.mem_range.mp. Expanding the definition of cycle_power_rooted_reflect expresses the reflected values at position v - (L - 1 - a) and indices L - 1 - a and (L - 1 - a) + D - L in terms of the underlying profile x.
uses
Finset.mem_range.mpintro a ha have haL : a < L := Finset.mem_range.mp ha dsimp [cycle_power_rooted_reflect]
Linear arithmetic simplifies the reflected spatial position to -v - (D - L) - a and the reflected indices to a + D - L and a.
Using the constraints 0 < L, L ≤ D, and a < L, linear arithmetic over ℕ and ℤ (handled by omega) establishes the identities: D - 1 - (L - 1 - a) = a + D - L, D - 1 - ((L - 1 - a) + D - L) = a, and -(v - (L - 1 - a)) - (D - 1) = -v - (D - L) - a.
have hidx₁ : D-1-(L-1-a)=a+D-L := by omega have hidx₂ : D-1-((L-1-a)+D-L)=a := by omega have hp : -(v-((L-1-a : ℕ) : ℤ))-((D-1 : ℕ) : ℤ) = -v-((D-L : ℕ) : ℤ)-(a : ℤ) := by omega
Each term in the reflected sum equals the corresponding term in the exactness condition.
Rewriting with the three arithmetic identities substitutes the simplified coordinates and indices into the reflected expression. Commutativity of boolean conjunction (Bool.and_comm) swaps the two factors into the order required by the exactness hypothesis, completing the pointwise equality and closing the goal.
uses
Bool.and_commrw [hidx₁,hidx₂,hp,Bool.and_comm]
Finset.sum_range_reflect- Reversing the order of summation over the range {0, ..., n-1} preserves the sum: ∑_{j=0}^{n-1} f(n - 1 - j) = ∑_{j=0}^{n-1} f(j).
Finset.sum_congr- Two sums over equal finite sets are equal if their summands agree on every element of the set.
Finset.mem_range.mp- An element a belongs to range(n) if and only if a < n (forward implication: a ∈ range(n) → a < n).
Bool.and_comm- Boolean conjunction is commutative: x && y = y && x.
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_exact (D L : ℕ) (hL : 0 < L) (hLD : L ≤ D) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (Finset.range L).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+D-L)).toNat) = 1) : ∀ v : ℤ, (Finset.range L).sum (fun a => (cycle_power_rooted_reflect D x (v-(a : ℤ)) a && cycle_power_rooted_reflect D x (v-(a : ℤ)) (a+D-L)).toNat) = 1 := by intro v rw [← Finset.sum_range_reflect] have hs := hexact (-v-((D-L : ℕ) : ℤ)) convert hs using 1 apply Finset.sum_congr rfl intro a ha have haL : a < L := Finset.mem_range.mp ha dsimp [cycle_power_rooted_reflect] have hidx₁ : D-1-(L-1-a)=a+D-L := by omega have hidx₂ : D-1-((L-1-a)+D-L)=a := by omega have hp : -(v-((L-1-a : ℕ) : ℤ))-((D-1 : ℕ) : ℤ) = -v-((D-L : ℕ) : ℤ)-(a : ℤ) := by omega rw [hidx₁,hidx₂,hp,Bool.and_comm]