cycle_power_no_island_of_half_monotone
A Boolean class which is monotone toward the left endpoint on the left half and toward the right endpoint on the right half has no selected island between two missing offsets.
Statement
theorem cycle_power_no_island_of_half_monotone
(H D : ℕ) (x : ℤ → ℕ → Bool)
(hmono : ∀ p : ℤ,
(∀ a b : ℕ, a ≤ b → b < H → x p b = true → x p a = true) ∧
(∀ a b : ℕ, H ≤ a → a ≤ b → b < D → x p a = true → x p b = true)) :
∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < D →
x p a = false → x p b = true → x p c = true- Source
- Uniform conditional structural helper for OP-205 / RT-1 following arXiv:2610.15635 Section 3. The middle-bit fullness assumptions and smaller-quarter monotonicity are explicit when used; no optimal-count classification, graph covering value or research advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
Quot.soundpropext- Used by 2
- cycle_power_dyadic_no_island_of_middle_full_pruneIn a tight exact full ordinary-cover dyadic integer model, current-scale middle-bit fullness alone implies that every class has no…
- cycle_power_dyadic_no_island_of_outer_projection_fullnessA tight exact full-coverage model has no-island class shape if every selected middle bit at EVERY direct outer projection level forces the…
The proof, explained
The proof proceeds by case analysis on whether the middle offset $b$ lies in the left half $[0, H)$. If $b < H$, then since $a < b$, left-monotonicity forces $x(p, a) = \text{true}$, contradicting the hypothesis that $x(p, a) = \text{false}$. Otherwise $b \ge H$, and right-monotonicity on $[H, D)$ propagates the truth value from $b$ to $c$, yielding $x(p, c) = \text{true}$.
Fix an integer $p$, offsets $a < b < c < D$, and assume $x(p, a) = \text{false}$ and $x(p, b) = \text{true}$.
We introduce the arbitrary integer $p$, the offsets $a, b, c$ satisfying $a < b$, $b < c$, and $c < D$, and the assumptions that $x(p, a) = \text{false}$ and $x(p, b) = \text{true}$. The goal is to deduce that $x(p, c) = \text{true}$.
intro p a b c hab hbc hc ha hbThe case $b < H$ cannot occur.
We perform a case split on whether $b < H$. In the branch where $b < H$, since $a < b$, the left-half monotonicity condition applies to $a \le b < H$. Because $x(p, b) = \text{true}$, this forces $x(p, a) = \text{true}$. However, rewriting with the assumption $x(p, a) = \text{false}$ produces the contradiction $\text{false} = \text{true}$.
by_cases hbl : b < H · have hh := (hmono p).1 a b (by omega) hbl hb rw [ha] at hh contradiction
In the remaining case $b \ge H$, $x(p, c) = \text{true}$.
In the case where $b \ge H$, the inequalities $H \le b \le c < D$ hold by linear arithmetic. The right-half monotonicity condition on $[H, D)$ then applies to $b \le c$. Because $x(p, b) = \text{true}$, it directly implies that $x(p, c) = \text{true}$, completing the proof.
· exact (hmono p).2 b c (by omega) (by omega) hc hb
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.
open Finsettheorem cycle_power_no_island_of_half_monotone (H D : ℕ) (x : ℤ → ℕ → Bool) (hmono : ∀ p : ℤ, (∀ a b : ℕ, a ≤ b → b < H → x p b = true → x p a = true) ∧ (∀ a b : ℕ, H ≤ a → a ≤ b → b < D → x p a = true → x p b = true)) : ∀ (p : ℤ) (a b c : ℕ), a < b → b < c → c < D → x p a = false → x p b = true → x p c = true := by intro p a b c hab hbc hc ha hb by_cases hbl : b < H · have hh := (hmono p).1 a b (by omega) hbl hb rw [ha] at hh contradiction · exact (hmono p).2 b c (by omega) (by omega) hc hb