cycle_power_end_blocks_sub_terminal
The two end blocks are contained in the terminal three-quarter profile at the maximum width, in either global orientation.
Statement
theorem cycle_power_end_blocks_sub_terminal (R a p u : ℤ) (side : Bool)
(ha : 0 < a) (hA : a ≤ R) (h : cycle_power_end_blocks (4 * R) a p u) :
cycle_power_terminal_blocks R a p u side- Source
- Uniform conditional profile-rigidity helper for OP-205 / RT-1, following arXiv:2610.15635 Section 3. Arbitrary covers are not classified and no graph covering bound or research advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- cycle_power_end_blocksThe union of the first and last a integer positions of a class with origin p and arc length D.
- cycle_power_terminal_blocksAligned class blocks of radius 4R: below the terminal width they consist of two end blocks; at the terminal width they consist of three of…
- Used by 1
- cycle_power_aligned_terminal_blocks_endpoint_overlapFor the uniform nested block family with a three-quarter terminal class, every other class through the old endpoint intersects the class…
The proof, explained
The theorem states that the end blocks of length $4R$ and width $a$ are contained in the terminal blocks profile for either orientation `side`. The proof splits into cases depending on whether the block width $a$ reaches the maximum width $R$. When $a \neq R$, the terminal profile is defined to coincide with the end blocks, so the result holds immediately from the hypothesis. When $a = R$, expanding both definitions reveals that the end blocks $[p, p + R)$ and $[p + 3R, p + 4R)$ are subintervals of the terminal profiles for both values of `side`, which is verified by linear integer arithmetic.
When `a = R`, the terminal condition simplifies to explicit interval bounds for each orientation `side`.
We split into cases based on whether the block width $a$ equals the maximum width $R$. In the case $a = R$, we substitute $R$ for $a$ and consider both possible boolean orientations for `side`. Expanding the definition of `cycle_power_terminal_blocks`, the terminal condition simplifies to $u \in [p, p + R) \cup [p + 2R, p + 4R)$ when `side` is false, and to $u \in [p, p + 2R) \cup [p + 3R, p + 4R)$ when `side` is true.
uses
Bool.false_eq_trueby_cases he : a = R · subst a cases side <;> simp only [cycle_power_terminal_blocks, Bool.false_eq_true, ↓reduceIte]
For `a = R`, the end blocks are contained in the terminal intervals in both orientations.
Unfolding `cycle_power_end_blocks` with length $4R$ and width $R$, hypothesis $h$ states that $u \in [p, p + R)$ or $u \in [p + 4R - R, p + 4R) = [p + 3R, p + 4R)$. We split on this disjunction, producing four subgoals across the two orientations. Because $R > 0$ (from $0 < a$ and $a = R$), the interval $[p, p + R)$ is contained in $[p, p + R)$ (for `side = false`) and in $[p, p + 2R)$ (for `side = true`); similarly, $[p + 3R, p + 4R)$ is contained in $[p + 2R, p + 4R)$ (for `side = false`) and in $[p + 3R, p + 4R)$ (for `side = true`). Linear integer arithmetic (`omega`) confirms all four inclusions and closes the goals.
all_goals unfold cycle_power_end_blocks at h; rcases h with h | h all_goals omega
When `a ≠ R`, the terminal condition is identical to the end-blocks hypothesis.
In the case $a \ne R$, the outer conditional in `cycle_power_terminal_blocks` evaluates to its `else` branch via `if_neg he`. By definition, this `else` branch is `cycle_power_end_blocks (4 * R) a p u`, which matches the hypothesis $h$ directly.
uses
if_neg· simpa only [cycle_power_terminal_blocks, if_neg he] using h
Bool.false_eq_true- The equality `false = true` is equivalent to `False`.
if_neg- If the condition `c` of an `if-then-else` expression is false, the expression simplifies to its `else` branch.
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.
theorem cycle_power_end_blocks_sub_terminal (R a p u : ℤ) (side : Bool) (ha : 0 < a) (hA : a ≤ R) (h : cycle_power_end_blocks (4 * R) a p u) : cycle_power_terminal_blocks R a p u side := by by_cases he : a = R · subst a cases side <;> simp only [cycle_power_terminal_blocks, Bool.false_eq_true, ↓reduceIte] all_goals unfold cycle_power_end_blocks at h; rcases h with h | h all_goals omega · simpa only [cycle_power_terminal_blocks, if_neg he] using h