periodic_count_eq_of_shift_balance_of_lower_bound
For a finite-period count balance C(v)+R(v)=t+R(v+h), a pointwise lower bound C(v)>=t forces C to be identically t.
Statement
theorem periodic_count_eq_of_shift_balance_of_lower_bound
(n t : ℕ) (hn : 0 < n) (h : ℤ) (C R : ℤ → ℕ)
(hperiod : Function.Periodic R (n : ℤ))
(hbalance : ∀ v, C v + R v = t + R (v + h))
(hlower : ∀ v, t ≤ C v) : ∀ v, C v = t- Source
- Uniform helper for the OP-205 / RT-1 campaign, following arXiv:2610.15635 Section 3. These class-model, pruning and colour-rigidity lemmas do not establish the unresolved graph covering value. No research advance is claimed.
- Verified
- 27 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- periodic_int_shift_eq_of_leA natural-valued function on the integers with a positive finite period that never decreases under a fixed integer shift is invariant…
- Used by 2
- cycle_power_dyadic_boundary_pairing_of_terminal_eight_lower_boundFor any dyadic radius at least eight, a periodic tight Boolean class model with exact dyadic-edge coverage and all ordinary coverage has…
- cycle_power_dyadic_prune_count_of_lower_boundIn a finite periodic tight dyadic class model with original count t+1, a pointwise lower bound t on the pruned active counts implies exact…
The proof, explained
Combining the balance equation C(v) + R(v) = t + R(v + h) with the lower bound C(v) ≥ t implies that R(v) ≤ R(v + h) for all v. Because R is periodic with period n > 0, this pointwise inequality forces exact shift invariance, R(v + h) = R(v). Substituting this back into the balance relation cancels R and leaves C(v) = t everywhere.
For every v ∈ ℤ, R(v) ≤ R(v + h).
Fix an arbitrary v. From the balance condition C(v) + R(v) = t + R(v + h) and the lower bound t ≤ C(v), linear arithmetic (handled by `omega`) implies that R(v) ≤ R(v + h).
have hle : ∀ v, R v ≤ R (v + h) := by intro v have hb := hbalance v have hl := hlower v omega
For every v ∈ ℤ, R(v + h) = R(v).
Because R has positive period n and satisfies R(v) ≤ R(v + h) everywhere, periodic_int_shift_eq_of_le shows that the weak inequality forces exact shift invariance: R(v + h) = R(v) for all v.
uses
periodic_int_shift_eq_of_lehave heq := periodic_int_shift_eq_of_le n hn h R hperiod hleFor every v ∈ ℤ, C(v) = t.
For any v, we substitute R(v + h) = R(v) into the balance equation C(v) + R(v) = t + R(v + h) to obtain C(v) + R(v) = t + R(v). Subtracting R(v) from both sides (via `omega`) yields C(v) = t.
intro v have hb := hbalance v rw [heq v] at hb omega
periodic_int_shift_eq_of_le- If a function on ℤ is periodic with positive period n and satisfies R(v) ≤ R(v + h) for all v, then R(v + h) = R(v) for all v.
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 periodic_count_eq_of_shift_balance_of_lower_bound (n t : ℕ) (hn : 0 < n) (h : ℤ) (C R : ℤ → ℕ) (hperiod : Function.Periodic R (n : ℤ)) (hbalance : ∀ v, C v + R v = t + R (v + h)) (hlower : ∀ v, t ≤ C v) : ∀ v, C v = t := by have hle : ∀ v, R v ≤ R (v + h) := by intro v have hb := hbalance v have hl := hlower v omega have heq := periodic_int_shift_eq_of_le n hn h R hperiod hle intro v have hb := hbalance v rw [heq v] at hb omega