fib two le
ProvedBlockCycleRotation.fib_two_lealgorithmsblock-cycle-rotationnumber-theory
A supporting lemma of the formalization, declared as fib_two_le.
This is an auxiliary lemma of the formalization rather than a result stated in the paper.
Preamble
import Mathlib
Formal statement
theorem BlockCycleRotation.fib_two_le {j : ℕ} : 2 ≤ Nat.fib (j + 3) := by sorrySource
Valentin Blomer and Kai-Uwe Bux, "The cost of cyclic permutations and remainder sums in the Euclidean algorithm", AofA 2026, LIPIcs vol. 381, pp. 14:1-14:17, doi:10.4230/LIPIcs.AofA.2026.14. Numbering follows the full version, arXiv:2601.00979v1. Lean source: https://github.com/dbenbenn/block-cycle-rotation/blob/f69003fd8b00c9b5d6d1a4f6807b4943bce0a92c/BlockCycleRotation/Algorithm.lean#L180-L183