cycle_power_sixteen_block_geometry_reflect
The full radius16h Geometry hypotheses, including all ordinary distances and exact12h/14h/15h ownership, are preserved by simultaneous root and offset reflection.
Statement
theorem cycle_power_sixteen_block_geometry_reflect
(h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x) :
CyclePowerSixteenBlock.Geometry h (cycle_power_rooted_reflect (16*h) x)- 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 5
- cycle_power_sixteen_block_no_vertical_overlapFor any positive h and Boolean rooted model of radius16h satisfying the explicit Geometry hypotheses (selected endpoints, three parent…
- 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…
- cycle_power_rooted_reflect_exactReflection of rooted profiles preserves exact pair ownership at every rank length L with0<L<=D; the physical starting point changes from v…
- cycle_power_rooted_reflect_coverReflection preserves coverage of every ordinary distance strictly between0 and the arc length.
- cycle_power_rooted_reflect_parentReflection preserves both parent implications at every even rank2q, interchanging the lower and upper branches.
- Used by 1
- 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…
The proof, explained
To prove that the block geometry structure on a block of length 16h is preserved under rooted reflection, the proof verifies each of the eleven required fields of CyclePowerSixteenBlock.Geometry. The parent and exact ownership hypotheses are first rewritten into a uniform parametric form. Endpoint conditions hold by symmetry, while the lower and upper monotonicity conditions swap roles under reflection; the remaining parent, exact ownership, and covering properties follow from general reflection preservation lemmas.
Positivity 0 < h holds, along with the offset arithmetic identities a + 16h - 8h = a + 8h, a + 16h - 4h = a + 12h, and a + 16h - 2h = a + 14h for all a ∈ ℕ.
Positivity of h is extracted from the hypothesis M.pos. The three index identities, which relate concrete block offsets to the full block length 16h, are proved by linear integer arithmetic (omega).
have hp := M.pos have i4 (a : ℕ) : a+16*h-8*h=a+8*h := by omega have i6 (a : ℕ) : a+16*h-4*h=a+12*h := by omega have i7 (a : ℕ) : a+16*h-2*h=a+14*h := by omega
The parent conditions at scales 4h, 2h, and h are rewritten into the parametric form a + 16h - 2q.
The geometry hypotheses M.parent4, M.parent6, and M.parent7 govern transitions at shift distances 8h, 12h, and 14h. Using the index arithmetic identities, these are recast into the uniform shift form a + 16h - 2q for q ∈ {4h, 2h, h}, producing hypotheses p4, p6, and p7 matching the input format of the reflection lemma.
have p4 : ∀ p a, a < 2*(4*h) → (a < 4*h → x p (a+16*h-2*(4*h)) = true → x p a = true) ∧ (4*h ≤ a → x p a = true → x p (a+16*h-2*(4*h)) = true) := by simpa only [i4,show 2*(4*h)=8*h by omega] using M.parent4 have p6 : ∀ p a, a < 2*(2*h) → (a < 2*h → x p (a+16*h-2*(2*h)) = true → x p a = true) ∧ (2*h ≤ a → x p a = true → x p (a+16*h-2*(2*h)) = true) := by simpa only [i6,show 2*(2*h)=4*h by omega] using M.parent6 have p7 : ∀ p a, a < 2*h → (a < h → x p (a+16*h-2*h) = true → x p a = true) ∧ (h ≤ a → x p a = true → x p (a+16*h-2*h) = true) := by simpa only [i7] using M.parent7
The exact ownership conditions at scales 4h, 2h, and h are rewritten into the parametric form a + 16h - L.
The hypotheses M.exact6, M.exact7, and M.exact15 state that for any vertex v, exactly one position in range L simultaneously satisfies the offset pair (a, a + 16h - L) for L ∈ {4h, 2h, h} (corresponding to distances 12h, 14h, and 15h). Rewriting with the index identities produces the reformulations e6, e7, and e15.
have e6 : ∀ v : ℤ, (Finset.range (4*h)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-4*h)).toNat) = 1 := by simpa only [show ∀ a : ℕ, a+16*h-4*h=a+12*h by omega] using M.exact6 have e7 : ∀ v : ℤ, (Finset.range (2*h)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-2*h)).toNat) = 1 := by simpa only [i7] using M.exact7 have e15 : ∀ v : ℤ, (Finset.range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-h)).toNat) = 1 := by simpa only [show ∀ a : ℕ, a+16*h-h=a+15*h by omega] using M.exact15
It suffices to establish the ten remaining fields of CyclePowerSixteenBlock.Geometry for the reflected configuration.
The geometry structure is instantiated with pos := hp, generating ten subgoals: ends, lowMono, highMono, the three parent conditions, the three exact ownership conditions, and the covering property.
refine { pos := hp ends := ?_ lowMono := ?_ highMono := ?_ parent4 := ?_ parent6 := ?_ parent7 := ?_ exact6 := ?_ exact7 := ?_ exact15 := ?_ cover := ?_ }The reflected configuration is true at both endpoints a = 0 and a = 16h - 1 for every root p.
By definition of cycle_power_rooted_reflect, the reflected values at offsets 0 and 16h - 1 are the original values at 16h - 1 and 0 evaluated at root -p - (16h - 1). Both are true by M.ends, and conjoining them in reverse order matches the goal.
uses
cycle_power_rooted_reflect,Nat.sub_zero,Nat.sub_self· intro p simpa only [cycle_power_rooted_reflect,Nat.sub_zero,Nat.sub_self] using (M.ends (-p-((16*h-1 : ℕ) : ℤ))).symm
Downward monotonicity holds on lower offsets: for a ≤ b < 2h, if offset b is true under reflection, then offset a is true.
Reflection maps the lower interval a ≤ b < 2h to the upper interval 14h ≤ 16h - 1 - b ≤ 16h - 1 - a < 16h. Downward monotonicity on lower offsets for the reflected function therefore follows from upward monotonicity on upper offsets (M.highMono) for the original configuration at root -p - (16h - 1).
· intro p a b hab hb hx have hh := M.highMono (-p-((16*h-1 : ℕ) : ℤ)) (16*h-1-b) (16*h-1-a) (by omega) (by omega) (by omega) hx exact hh
Upward monotonicity holds on upper offsets: for 14h ≤ a ≤ b < 16h, if offset a is true under reflection, then offset b is true.
Reflection maps the upper interval 14h ≤ a ≤ b < 16h to the lower interval 16h - 1 - b ≤ 16h - 1 - a < 2h. Upward monotonicity on upper offsets for the reflected function therefore reduces to downward monotonicity on lower offsets (M.lowMono) for the original configuration at root -p - (16h - 1).
· intro p a b ha hab hb hx have hh := M.lowMono (-p-((16*h-1 : ℕ) : ℤ)) (16*h-1-b) (16*h-1-a) (by omega) (by omega) hx exact hh
The scale 4h parent condition is preserved under reflection.
Applying cycle_power_rooted_reflect_parent with cycle length 16h and scale 4h transfers hypothesis p4 to the reflected configuration; the shift term is simplified back to a + 8h using identity i4.
uses
cycle_power_rooted_reflect_parent· simpa only [i4,show 2*(4*h)=8*h by omega] using cycle_power_rooted_reflect_parent (16*h) (4*h) (by omega) (by omega) x p4
The scale 2h parent condition is preserved under reflection.
Applying cycle_power_rooted_reflect_parent with cycle length 16h and scale 2h transfers hypothesis p6 to the reflected configuration, simplified with identity i6.
uses
cycle_power_rooted_reflect_parent· simpa only [i6,show 2*(2*h)=4*h by omega] using cycle_power_rooted_reflect_parent (16*h) (2*h) (by omega) (by omega) x p6
The scale h parent condition is preserved under reflection.
Applying cycle_power_rooted_reflect_parent with cycle length 16h and scale h transfers hypothesis p7 to the reflected configuration, simplified with identity i7.
uses
cycle_power_rooted_reflect_parent· simpa only [i7] using cycle_power_rooted_reflect_parent (16*h) h hp (by omega) x p7
The distance 12h exact ownership condition is preserved under reflection.
Applying cycle_power_rooted_reflect_exact with cycle length 16h and window length 4h transfers hypothesis e6 to the reflected configuration, with a + 16h - 4h simplified to a + 12h.
uses
cycle_power_rooted_reflect_exact· simpa only [show ∀ a : ℕ, a+16*h-4*h=a+12*h by omega] using cycle_power_rooted_reflect_exact (16*h) (4*h) (by omega) (by omega) x e6
The distance 14h exact ownership condition is preserved under reflection.
Applying cycle_power_rooted_reflect_exact with cycle length 16h and window length 2h transfers hypothesis e7 to the reflected configuration, simplified with identity i7.
uses
cycle_power_rooted_reflect_exact· simpa only [i7] using cycle_power_rooted_reflect_exact (16*h) (2*h) (by omega) (by omega) x e7
The distance 15h exact ownership condition is preserved under reflection.
Applying cycle_power_rooted_reflect_exact with cycle length 16h and window length h transfers hypothesis e15 to the reflected configuration, with a + 16h - h simplified to a + 15h.
uses
cycle_power_rooted_reflect_exact· simpa only [show ∀ a : ℕ, a+16*h-h=a+15*h by omega] using cycle_power_rooted_reflect_exact (16*h) h hp (by omega) x e15
The distance covering condition is preserved under reflection.
The generic lemma cycle_power_rooted_reflect_cover transfers the covering property M.cover for all distances 1 ≤ d < 16h to the reflected configuration.
uses
cycle_power_rooted_reflect_cover· exact cycle_power_rooted_reflect_cover (16*h) (by omega) x M.cover
cycle_power_rooted_reflect- The definition of rooted reflection of a configuration x on a cycle of length D: the root p is mapped to -p - (D - 1) and offset a is mapped to D - 1 - a.
Nat.sub_zero- Subtracting zero from any natural number leaves it unchanged: n - 0 = n.
Nat.sub_self- Subtracting any natural number from itself yields zero: n - n = 0.
cycle_power_rooted_reflect_parent- Rooted reflection preserves the two-part parent implication condition at any scale q satisfying 0 < q and 2q ≤ D.
cycle_power_rooted_reflect_exact- Rooted reflection preserves the exact ownership condition (the sum over a in Finset.range L of the indicator of offset a and a + D - L equals 1) for any window size L with 0 < L ≤ D.
cycle_power_rooted_reflect_cover- Rooted reflection preserves the distance covering condition for all distances 1 ≤ d < D.
- The reflection operation (p, a) ↦ (-p - (16h - 1), 16h - 1 - a) reverses offset order, which swaps the roles of downward monotonicity on low offsets (lowMono) and upward monotonicity on high offsets (highMono).
- The parent and exact ownership conditions in the Geometry structure are stated with specific concrete offsets (such as 8h, 12h, 14h, 15h), which are algebraically rewritten into parametric forms (such as a + 16h - 2q and a + 16h - L) before invoking the general reflection lemmas.
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_sixteen_block_geometry_reflect (h : ℕ) (x : ℤ → ℕ → Bool) (M : CyclePowerSixteenBlock.Geometry h x) : CyclePowerSixteenBlock.Geometry h (cycle_power_rooted_reflect (16*h) x) := by have hp := M.pos have i4 (a : ℕ) : a+16*h-8*h=a+8*h := by omega have i6 (a : ℕ) : a+16*h-4*h=a+12*h := by omega have i7 (a : ℕ) : a+16*h-2*h=a+14*h := by omega have p4 : ∀ p a, a < 2*(4*h) → (a < 4*h → x p (a+16*h-2*(4*h)) = true → x p a = true) ∧ (4*h ≤ a → x p a = true → x p (a+16*h-2*(4*h)) = true) := by simpa only [i4,show 2*(4*h)=8*h by omega] using M.parent4 have p6 : ∀ p a, a < 2*(2*h) → (a < 2*h → x p (a+16*h-2*(2*h)) = true → x p a = true) ∧ (2*h ≤ a → x p a = true → x p (a+16*h-2*(2*h)) = true) := by simpa only [i6,show 2*(2*h)=4*h by omega] using M.parent6 have p7 : ∀ p a, a < 2*h → (a < h → x p (a+16*h-2*h) = true → x p a = true) ∧ (h ≤ a → x p a = true → x p (a+16*h-2*h) = true) := by simpa only [i7] using M.parent7 have e6 : ∀ v : ℤ, (Finset.range (4*h)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-4*h)).toNat) = 1 := by simpa only [show ∀ a : ℕ, a+16*h-4*h=a+12*h by omega] using M.exact6 have e7 : ∀ v : ℤ, (Finset.range (2*h)).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-2*h)).toNat) = 1 := by simpa only [i7] using M.exact7 have e15 : ∀ v : ℤ, (Finset.range h).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+16*h-h)).toNat) = 1 := by simpa only [show ∀ a : ℕ, a+16*h-h=a+15*h by omega] using M.exact15 refine { pos := hp ends := ?_ lowMono := ?_ highMono := ?_ parent4 := ?_ parent6 := ?_ parent7 := ?_ exact6 := ?_ exact7 := ?_ exact15 := ?_ cover := ?_ } · intro p simpa only [cycle_power_rooted_reflect,Nat.sub_zero,Nat.sub_self] using (M.ends (-p-((16*h-1 : ℕ) : ℤ))).symm · intro p a b hab hb hx have hh := M.highMono (-p-((16*h-1 : ℕ) : ℤ)) (16*h-1-b) (16*h-1-a) (by omega) (by omega) (by omega) hx exact hh · intro p a b ha hab hb hx have hh := M.lowMono (-p-((16*h-1 : ℕ) : ℤ)) (16*h-1-b) (16*h-1-a) (by omega) (by omega) hx exact hh · simpa only [i4,show 2*(4*h)=8*h by omega] using cycle_power_rooted_reflect_parent (16*h) (4*h) (by omega) (by omega) x p4 · simpa only [i6,show 2*(2*h)=4*h by omega] using cycle_power_rooted_reflect_parent (16*h) (2*h) (by omega) (by omega) x p6 · simpa only [i7] using cycle_power_rooted_reflect_parent (16*h) h hp (by omega) x p7 · simpa only [show ∀ a : ℕ, a+16*h-4*h=a+12*h by omega] using cycle_power_rooted_reflect_exact (16*h) (4*h) (by omega) (by omega) x e6 · simpa only [i7] using cycle_power_rooted_reflect_exact (16*h) (2*h) (by omega) (by omega) x e7 · simpa only [show ∀ a : ℕ, a+16*h-h=a+15*h by omega] using cycle_power_rooted_reflect_exact (16*h) h hp (by omega) x e15 · exact cycle_power_rooted_reflect_cover (16*h) (by omega) x M.cover