cycle_power_rooted_reflect
def
Reflects the offsets of a rooted Boolean profile in its arc of length D and changes its integer root so that physical lattice points are negated.
Statement
def cycle_power_rooted_reflect (D : ℕ) (x : ℤ → ℕ → Bool) : ℤ → ℕ → Bool- 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
- 28 Oct 2026
- Axioms
- none listed
- Used by 9
- cycle_power_dyadic_defective_half_no_defectsIf zero-phase defective half models have no defects, the same holds in either zero or half-span phase.
- cycle_power_reflect_shifted_pair_defectReflection transports a defective pair-ownership equation and reverses the phase.
- cycle_power_reflect_count_defectReflection transports a pointwise active-count defect by negating its vertex.
- 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_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_rooted_reflect_coverReflection preserves coverage of every ordinary distance strictly between0 and the arc length.
- 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.
- cycle_power_rooted_reflect_parentReflection preserves both parent implications at every even rank2q, interchanging the lower and upper branches.
Lean source view module on GitHub
set_option maxHeartbeats 2000000 set_option maxRecDepth 10000 def cycle_power_rooted_reflect (D : ℕ) (x : ℤ → ℕ → Bool) : ℤ → ℕ → Bool := fun p a => x (-p-((D-1 : ℕ) : ℤ)) (D-1-a)