Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Signed-Weight Lower Bound for Period Doubling

Abstract

Every actual period-doubling prefix requires at least the signed weight of its rounded half.

Theorem 1.1 (A lower bound for the true prefix palindromic length).

Proof. Machine-checked in Lean as D5/S1/Words/Palindromes/PeriodDoubling/SignedCutLowerBound.palindromic_suffix_signed_bound (✓ std3). ∎

Source. Repository-derived.

Commentary.

For an actual palindrome suffix from cut j to endpoint n, the signed binary weight of the rounded half of n is at most one more than the weight at j. The short-radius and long-radius cases use different dyadic estimates, and the even-palindrome case has length two. Strong induction along optimal suffix cuts gives the second clause for every prefix. Nat.sub is truncated natural subtraction, Nat.div is natural integer division, and cast denotes the natural-to-integer embedding.

References