cycle_power_exact_pair_unique
theoremverified
An exact Boolean long-edge count of one gives a unique owning rooted class.
Statement
theorem cycle_power_exact_pair_unique (D R : ℕ) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (range R).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+D-R)).toNat) = 1) (v : ℤ) (a b : ℕ) (ha : a < R) (hb : b < R) (ha0 : x (v-(a : ℤ)) a = true) (ha1 : x (v-(a : ℤ)) (a+D-R) = true) (hb0 : x (v-(b : ℤ)) b = true) (hb1 : x (v-(b : ℤ)) (b+D-R) = true) : a = b
- Source
- Conditional structural helpers for OP-205 / RT-1 following arXiv:2610.15635, Section 3. The no-island hypothesis remains explicit and unproved for the general periodic model. These helpers do not settle the covering-number conjecture, and no research advance is claimed.
- Verified
- 26 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Used by 18
- cycle_power_eight_block_active_root_separationUnder the explicit third parent, monotone outer eighths and exact distance15h ownership, distinct roots selecting an A/Z overlap are…
- cycle_power_dyadic_no_island_half_owner_orderIn a tight dyadic full-coverage class model with explicit no-island shapes, the root owning the next half-radius edge is at least the root…
- cycle_power_dyadic_outer_pair_forwardIn a fully covered exact dyadic Boolean class model with exponent at least three and matching boundary bits in every class, if a class…
- cycle_power_dyadic_full_prune_root_separationTwo roots whose pruned classes are full must be separated by at least one quarter of the original radius.
- cycle_power_two_full_roots_half_separatedWhen D is twice R and every distance-R pair has a unique root owner, distinct full classes rooted at zero and a positive g must have g at…
- cycle_power_dyadic_no_island_middle_cornerConditional uniform corner law for every cut strictly between one quarter and one half of the dyadic radius, under tight two-interval…
- cycle_power_dyadic_crossed_no_island_models_eqPairing conjecture for coupled no-island models. Let m ≥ 1 and let y, z : ℤ → ℕ → Bool be two integer Boolean class models at exponent m,…
- cycle_power_gap_exact_side_ownerExact distance D-R ownership in an integer model gives unique compressed gap-side owners for every forward distance-R pair on Fin g, when…
- cycle_power_dyadic_no_island_no_long_prefixConditional shape-model half-width theorem: a class with an initial selected interval extending strictly beyond half the radius cannot…
- cycle_power_dyadic_no_island_power_cornerConditional uniform dyadic corner law: in tight two-interval class profiles with exact dyadic edges and one ordinary-neighbour family, a…
- cycle_power_dyadic_outer_pair_reverseFor exponent m at least three, consider a Boolean integer-indexed dyadic class model with exact dyadic ownership at every rank, coverage…
- cycle_power_exact_rank_boundary_successorFor an exact dyadic-rank matching with both parent implications, if a root selects the last lower offset2q-1 and the edge one unit longer…
- cycle_power_exact_owner_order_cut_inequalityA nondecreasing sequence of unique exact-edge owner roots satisfies every cumulative cut inequality: the indicator of the next owner being…
- cycle_power_dyadic_half_owner_order_of_middle_full_pruneIf selected middle bits force full prunes and the retained outer quarters are monotone toward the endpoints, then coverage only at the…
- cycle_power_eight_block_boundary_owner_transferLet 0<L<q. Assume first eighths are prefixes, the6q parent implications hold, and6q/7q edges have exact owners. If root0 selects0 andq but…
- 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_eight_block_gap_owner_transferLet t<s<q. Under prefix first eighths, the6q parent implications and exact6q/7q ownership, suppose root0 selects t andq+t but misses s,…
- cycle_power_full_class_internal_exact_pair_impossibleIn an integer rooted-class system with exact distance D-R edge ownership, a selected distance D-R pair in one root cannot lie wholly in a…
Lean source view module on GitHub
open Finset theorem cycle_power_exact_pair_unique (D R : ℕ) (x : ℤ → ℕ → Bool) (hexact : ∀ v : ℤ, (range R).sum (fun a => (x (v-(a : ℤ)) a && x (v-(a : ℤ)) (a+D-R)).toNat) = 1) (v : ℤ) (a b : ℕ) (ha : a < R) (hb : b < R) (ha0 : x (v-(a : ℤ)) a = true) (ha1 : x (v-(a : ℤ)) (a+D-R) = true) (hb0 : x (v-(b : ℤ)) b = true) (hb1 : x (v-(b : ℤ)) (b+D-R) = true) : a = b := by classical by_contra hne let f : ℕ → ℕ := fun c => (x (v-(c : ℤ)) c && x (v-(c : ℤ)) (c+D-R)).toNat have hsub : ({a,b} : Finset ℕ) ⊆ range R := by intro c hc simp only [mem_insert, mem_singleton] at hc rcases hc with rfl | rfl · exact mem_range.mpr ha · exact mem_range.mpr hb have hle : ({a,b} : Finset ℕ).sum f ≤ (range R).sum f := sum_le_sum_of_subset_of_nonneg hsub (fun _ _ _ => Nat.zero_le _) have hsmall : ({a,b} : Finset ℕ).sum f = 2 := by simp [f, hne, ha0, ha1, hb0, hb1] rw [hsmall, show (range R).sum f = 1 from hexact v] at hle omega