is_eventual_period_const
Every constant sequence of Booleans has eventual period 1.
Statement
theorem is_eventual_period_const (b : Bool) : is_eventual_period (fun _ => b) 1
- Source
- folklore
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- is_eventual_periodA positive integer $p$ is an eventual period of a sequence $w : \mathbb{N} \to \text{Bool}$ if there exists $N \in \mathbb{N}$ such that…
- cycle_power_dyadic_class_weight_dilateDuplicating each membership bit of a dyadic class doubles its dyadic class weight, when the original radius is at least two.
Read back from the Lean
For every Boolean value b, $1$ is an eventual period of the constant sequence fun _ => b.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
The proof, explained
The proof unfolds the definition of eventual periodicity for the constant sequence n ↦ b with candidate period 1. This requires showing that 0 < 1 and that eventually b = b, which reduces to a trivial arithmetic and logical truth that automation solves immediately.
Every constant Boolean sequence n ↦ b has eventual period 1. automation
Unfolding the definition of eventual period (`is_eventual_period`) for the constant sequence n ↦ b and period 1 produces the goal 0 < 1 ∧ ∃ N, ∀ n ≥ N, b = b. Since b = b evaluates to True, this reduces to 0 < 1 ∧ ∃ N, ∀ n ≥ N, True, which is solved automatically by standard simplification.
uses
is_eventual_period,cycle_power_dyadic_class_weight_dilatetheorem is_eventual_period_const (b : Bool) : is_eventual_period (fun _ => b) 1 := by first | exact cycle_power_dyadic_class_weight_dilate | (apply cycle_power_dyadic_class_weight_dilate <;> assumption) | (apply cycle_power_dyadic_class_weight_dilate <;> simp_all) | simpa using cycle_power_dyadic_class_weight_dilate | (simp only [is_eventual_period] at *; first | exact cycle_power_dyadic_class_weight_dilate | (apply cycle_power_dyadic_class_weight_dilate <;> assumption) | (apply cycle_power_dyadic_class_weight_dilate <;> simp_all) | simpa using cycle_power_dyadic_class_weight_dilate)
is_eventual_period- A sequence w has eventual period p if p > 0 and there exists some N such that w(n + p) = w(n) for all n ≥ N.
cycle_power_dyadic_class_weight_dilate- The dyadic class weight at level m + 1 of a sequence whose index is divided by 2 equals twice the dyadic class weight of the sequence at level m.
- The proof script is structured as a chain of fallback attempts (`first | ...`). The goal is solved by unfolding `is_eventual_period` followed by `simpa`. Although the tactic `simpa using cycle_power_dyadic_class_weight_dilate` names the lemma `cycle_power_dyadic_class_weight_dilate`, that lemma is completely unused: `simpa` closes the goal `0 < 1 ∧ ∃ N, ∀ n ≥ N, True` purely by elementary simplification.
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.
/-- A constant binary sequence has eventual period 1. -/theorem is_eventual_period_const (b : Bool) : is_eventual_period (fun _ => b) 1 := by first | exact cycle_power_dyadic_class_weight_dilate | (apply cycle_power_dyadic_class_weight_dilate <;> assumption) | (apply cycle_power_dyadic_class_weight_dilate <;> simp_all) | simpa using cycle_power_dyadic_class_weight_dilate | (simp only [is_eventual_period] at *; first | exact cycle_power_dyadic_class_weight_dilate | (apply cycle_power_dyadic_class_weight_dilate <;> assumption) | (apply cycle_power_dyadic_class_weight_dilate <;> simp_all) | simpa using cycle_power_dyadic_class_weight_dilate)