AFTD Auto-Formalizing Theoretical Domains

cycle_power_gap_left_side

def

The lower-block vertices of a rooted profile, represented by their absolute positions in Fin g.

Statement

def cycle_power_gap_left_side (g r : ℕ) (b : ℕ → Bool) : Finset (Fin g)
Source
Uniform full-root-gap and current-scale fullness reduction for OP-205 / RT-1 following arXiv:2610.15635. The reusable finite ordered-cover classification formalizes the deficiency-one structure described in arXiv:1103.3693 Corollary 2.5.6. Explicit full-class or middle-fullness hypotheses remain structural assumptions where used; optimal original counts have not been shown to imply them. No graph covering value or research advance is claimed.
Verified
27 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Used by 8
  • cycle_power_dyadic_gap_side_treeBetween two full roots at distance g at most the radius, the compressed sides of every interior tight class satisfy the tree identity:…
  • cycle_power_dyadic_full_gap_sides_convexIn a tight exact full ordinary-coverage dyadic model, all compressed sides between full roots zero and g are intervals when g lies between…
  • cycle_power_dyadic_full_gap_class_no_islandIn a tight exact full ordinary-coverage dyadic model, every class rooted strictly between full roots zero and g has no selected island…
  • 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_gap_sides_disjointThe lower and upper sides of a rooted gap profile are disjoint because their compressed vertex coordinates lie on opposite sides of the…
  • cycle_power_gap_sides_cardIf r is below g, g is at most D, and every selected offset of a radius-D profile is localized below absolute vertex g or at least D, its…
  • cycle_power_gap_ordinary_side_coverOrdinary distance coverage in an integer radius-D model, restricted to g at most D, gives a cut-separated biclique cover of the complete…
  • cycle_power_gap_sides_pair_cardFor a profile rooted below g at most D, whose selected distance D-R pairs cross the two blocks, its pair count equals the number of…

Lean source view module on GitHub

open Finset
set_option maxHeartbeats 1000000
set_option maxRecDepth 4000

def cycle_power_gap_left_side (g r : ℕ) (b : ℕ → Bool) : Finset (Fin g) := by
  exact univ.filter (fun i => r ≤ i.val ∧ b (i.val-r) = true)
See it in the graphDiscuss this resultChallenge it