AFTD Auto-Formalizing Theoretical Domains

cycle_power_gap_sides_disjoint

theoremverified

The lower and upper sides of a rooted gap profile are disjoint because their compressed vertex coordinates lie on opposite sides of the root.

Statement

theorem cycle_power_gap_sides_disjoint (D g r : ℕ) (b : ℕ → Bool) :
    Disjoint (cycle_power_gap_left_side g r b) (cycle_power_gap_right_side D g r b)
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
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
Used by 1
  • 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…

The proof, explained

To show that the left and right sides of the rooted gap profile are disjoint, we suppose for contradiction that some element belongs to both. By definition of the sets as filters on `Fin g`, any element in the left side must have coordinate at least $r$, while any element in the right side must have coordinate strictly less than $r$. The integer arithmetic contradiction $r \\le i < r$ finishes the proof.

  1. To show disjointness, suppose for contradiction that some index belongs to both sides.

    By `disjoint_left.mpr`, two finite sets are disjoint if no element belongs to both. We assume for contradiction that there is an element $i \\in \\mathrm{Fin}\\, g$ belonging to both `cycle_power_gap_left_side g r b` and `cycle_power_gap_right_side D g r b`.

    lines 7–8

    uses disjoint_left.mpr

      apply disjoint_left.mpr
      intro i hi hj
  2. The index $i$ satisfies both $r \\le i$ and $i < r$.

    By definition of `cycle_power_gap_left_side`, elements are filtered by the condition $r \\le i$, so applying `mem_filter.mp` yields $r \\le i$. Similarly, elements in `cycle_power_gap_right_side` satisfy $i < r$, so `mem_filter.mp` yields $i < r$.

    lines 9–10

    uses mem_filter.mp

      have hri := (mem_filter.mp hi).2.1
      have hir := (mem_filter.mp hj).2.1
  3. Contradiction.

    The two inequalities $r \\le i$ and $i < r$ cannot simultaneously hold for any natural number $i$; linear integer arithmetic (`omega`) closes the goal.

    line 11

      omega
disjoint_left.mpr
Two finite sets are disjoint if no element belongs to both.
mem_filter.mp
An element belonging to a filtered finset satisfies the filtering predicate.

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

open Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem cycle_power_gap_sides_disjoint (D g r : ℕ) (b : ℕ → Bool) :    Disjoint (cycle_power_gap_left_side g r b) (cycle_power_gap_right_side D g r b) := by  apply disjoint_left.mpr  intro i hi hj  have hri := (mem_filter.mp hi).2.1  have hir := (mem_filter.mp hj).2.1  omega
See it in the graphDiscuss this resultChallenge it