AFTD Auto-Formalizing Theoretical Domains

cycle_power_aligned_terminal_blocks_label_period

theoremverified

For nested aligned terminal profiles, complete palettes and separation of equally labelled classes force label period equal to the full radius.

Statement

theorem cycle_power_aligned_terminal_blocks_label_period
    {α : Type*} (R c : ℤ) (side : Bool) (w : ℤ → ℤ) (σ : ℤ → α)
    (hR : 0 < R) (hpos : ∀ p, 0 < w p) (hbound : ∀ p, w p ≤ R)
    (hdiv : ∀ p, 2 * w p ∣ 4 * R)
    (hchain : ∀ p q, w p = w q ∨ 2 * w p ∣ w q ∨ 2 * w q ∣ w p)
    (halign : ∀ p, w p ∣ p + c)
    (hodd : ∀ p, w p < R → 2 * w p ∣ p + c - w p)
    (hwperiod : ∀ p, w (p + 4 * R) = w p)
    (hslots : ∀ (v : ℤ) (a : α), ∃ p, cycle_power_terminal_blocks R (w p) p v side ∧ σ p = a)
    (hsep : ∀ (p q u : ℤ), p ≠ q → cycle_power_terminal_blocks R (w p) p u side →
      cycle_power_terminal_blocks R (w q) q u side → σ p ≠ σ q) :
    ∀ p, σ (p + 4 * R) = σ p
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 3

The proof, explained

To prove that the labelling σ is 4R-periodic, we pick an index q using slot completeness such that the boundary point p + 4R - 1 falls in the terminal blocks of q and σ(q) = σ(p + 4R). If q = p, the label equality is immediate. When q ≠ p, a support bound shows q ≠ p + 4R, and an endpoint overlap lemma guarantees that the terminal blocks of q and p + 4R overlap, which by the separation hypothesis forces σ(q) ≠ σ(p + 4R), contradicting our choice of q.

  1. Fix an arbitrary position p, and choose an index q whose terminal blocks contain p + 4R - 1 and whose label is σ(p + 4R).

    We introduce p. By the slot completeness hypothesis (hslots), every coordinate and label are covered by some terminal block. Applying this to the position p + 4R - 1 and label σ(p + 4R) gives an index q whose terminal blocks contain p + 4R - 1 and with σ(q) = σ(p + 4R).

    lines 13–14

      intro p
      obtain ⟨q, hq, hσ⟩ := hslots (p + 4 * R - 1) (σ (p + 4 * R))
  2. If q = p, then σ(p + 4R) = σ(p).

    We perform a case split on whether q = p. In the case where q = p, substituting p for q into σ(q) = σ(p + 4R) gives σ(p) = σ(p + 4R), which yields σ(p + 4R) = σ(p) by symmetry.

    lines 15–17

      by_cases hqp : q = p
      · subst q
        exact hσ.symm
  3. In the case q ≠ p, the index q cannot equal p + 4R.

    Suppose for contradiction that q = p + 4R. Then the position p + 4R - 1 would have to belong to the terminal blocks based at p + 4R. Unfolding the definitions of terminal blocks and end blocks and splitting cases according to whether the width equals R and the value of side, all constituent intervals have their lower bound at or above p + 4R. Since widths and R are positive, p + 4R ≤ p + 4R - 1 is impossible in each case, and linear integer arithmetic (omega) derives a contradiction.

    lines 18–26

      have hqnew : q ≠ p + 4 * R := by
        intro he
        subst q
        have hb := hbound (p + 4 * R)
        have hp := hpos (p + 4 * R)
        unfold cycle_power_terminal_blocks at hq
        split_ifs at hq with hw hs
        all_goals try { unfold cycle_power_end_blocks at hq }
        all_goals rcases hq with hq | hq <;> omega
  4. There exists a point u at which the terminal blocks of q overlap with the terminal blocks of p + 4R (with width w(p)).

    Because q ≠ p and the terminal blocks of q contain p + 4R - 1, the endpoint overlap lemma cycle_power_aligned_terminal_blocks_endpoint_overlap applies and produces a common point u belonging to both terminal blocks.

    lines 27–29

    uses cycle_power_aligned_terminal_blocks_endpoint_overlap

      obtain ⟨u, hqu, hnewu⟩ := cycle_power_aligned_terminal_blocks_endpoint_overlap R (w p) (w q)
        p q c side hR (hpos p) (hpos q) (hbound p) (hbound q) (hdiv p) (hdiv q)
        (hchain p q) (halign p) (hodd p) (halign q) (hodd q) hq hqp
  5. The point u belongs to the terminal blocks of p + 4R with the actual width w(p + 4R).

    By the 4R-periodicity of the width function w (hwperiod), w(p + 4R) = w(p). Rewriting by this identity establishes that u is in the terminal blocks of p + 4R with width w(p + 4R).

    lines 30–32

      have hnew : cycle_power_terminal_blocks R (w (p + 4 * R)) (p + 4 * R) u side := by
        rw [hwperiod p]
        exact hnewu
  6. The case q ≠ p leads to a contradiction, concluding the theorem.

    Since q ≠ p + 4R and both terminal blocks contain u, the separation hypothesis (hsep) requires σ(q) ≠ σ(p + 4R). However, q was chosen so that σ(q) = σ(p + 4R). This contradiction is eliminated with False.elim to complete the proof.

    line 33

    uses False.elim

      exact False.elim ((hsep q (p + 4 * R) u hqnew hqu hnew) hσ)
cycle_power_aligned_terminal_blocks_endpoint_overlap
For two distinct positions p and q satisfying the nested alignment hypotheses, if the terminal blocks of q contain the boundary point p + 4R - 1, then the terminal blocks of q overlap with the terminal blocks of p + 4R (using width w(p)).
False.elim
From a proof of False, any proposition follows (the principle of explosion).

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

theorem cycle_power_aligned_terminal_blocks_label_period    {α : Type*} (R c : ℤ) (side : Bool) (w : ℤ → ℤ) (σ : ℤ → α)    (hR : 0 < R) (hpos : ∀ p, 0 < w p) (hbound : ∀ p, w p ≤ R)    (hdiv : ∀ p, 2 * w p ∣ 4 * R)    (hchain : ∀ p q, w p = w q ∨ 2 * w p ∣ w q ∨ 2 * w q ∣ w p)    (halign : ∀ p, w p ∣ p + c)    (hodd : ∀ p, w p < R → 2 * w p ∣ p + c - w p)    (hwperiod : ∀ p, w (p + 4 * R) = w p)    (hslots : ∀ (v : ℤ) (a : α), ∃ p, cycle_power_terminal_blocks R (w p) p v side ∧ σ p = a)    (hsep : ∀ (p q u : ℤ), p ≠ q → cycle_power_terminal_blocks R (w p) p u side →      cycle_power_terminal_blocks R (w q) q u side → σ p ≠ σ q) :    ∀ p, σ (p + 4 * R) = σ p := by  intro p  obtain ⟨q, hq, hσ⟩ := hslots (p + 4 * R - 1) (σ (p + 4 * R))  by_cases hqp : q = p  · subst q    exact hσ.symm  have hqnew : q ≠ p + 4 * R := by    intro he    subst q    have hb := hbound (p + 4 * R)    have hp := hpos (p + 4 * R)    unfold cycle_power_terminal_blocks at hq    split_ifs at hq with hw hs    all_goals try { unfold cycle_power_end_blocks at hq }    all_goals rcases hq with hq | hq <;> omega  obtain ⟨u, hqu, hnewu⟩ := cycle_power_aligned_terminal_blocks_endpoint_overlap R (w p) (w q)    p q c side hR (hpos p) (hpos q) (hbound p) (hbound q) (hdiv p) (hdiv q)    (hchain p q) (halign p) (hodd p) (halign q) (hodd q) hq hqp  have hnew : cycle_power_terminal_blocks R (w (p + 4 * R)) (p + 4 * R) u side := by    rw [hwperiod p]    exact hnewu  exact False.elim ((hsep q (p + 4 * R) u hqnew hqu hnew) hσ)
See it in the graphDiscuss this resultChallenge it