fibonacci_attractor_basis_seven_card
The cardinality of the candidate attractor basis fibonacci_attractor_basis 7 is exactly 7.
Statement
theorem fibonacci_attractor_basis_seven_card :
(fibonacci_attractor_basis 7).card = 7- Source
- arXiv:2610.10950 Smallest String Attractors and Minimal Coverage Certificates of Thue--Morse Words
- Verified
- 30 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- fibonacci_attractor_basisFor a natural number n, fibonacci_attractor_basis n is the finite set (Finset (List Bool)) formed by the union of: (1) the image under…
Read back from the Lean
The finite set fibonacci_attractor_basis 7 has cardinality 7.
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 statement asserts that the candidate attractor basis for $n = 7$ contains exactly 7 elements. Because the basis is defined constructively as a union of images of finite sets under computable word-building operations, the claim reduces to a finite computation. Lean's `decide` tactic evaluates the set and verifies that its cardinality is 7.
The cardinality of `fibonacci_attractor_basis 7` is 7. automation
The set `fibonacci_attractor_basis 7` is explicitly constructed from computable operations on finite ranges: it takes the singular words for $j \\in \\{0, 1, 2, 3, 4, 5\\}$ and the boundary words for $j \\in \\{3\\}$ satisfying the parity condition $j \\equiv 7 \\pmod 2$. The `decide` tactic evaluates this finite set of lists and counts its elements, verifying by direct computation that the resulting set contains exactly 7 distinct elements.
decide
- The proof proceeds purely by algorithmic evaluation (`decide`): Lean normalizes the computable definition of `fibonacci_attractor_basis 7` to an explicit finite set of 7 distinct boolean words and verifies its cardinality directly.
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.
/-- The candidate basis B_7 has cardinality 7, matching ceil(3*7/2) - 4. -/theorem fibonacci_attractor_basis_seven_card : (fibonacci_attractor_basis 7).card = 7 := by decide