BonaMagaRicheyHalfFrequency
Abstract
Half letter frequency characterizes balanced borders of nonempty binary words.
Definition 1.1 (claim).
Formalization. D5/S1/Words/Forbidden/BonaMagaRicheyHalfFrequency.claim (✓ std3).
Citation. Miklós Bóna, Balázs Maga, Jacob Richey (2026). Letter frequency in shifts of finite type with one forbidden word. URL: https://arxiv.org/abs/2606.06655v2.
Commentary.
“A word has if and only if has balanced borders. The same holds with replaced by .” (Conjecture 6.1, p. 20.)
The first sentence is encoded for every nonempty List Bool as convergence of the source averages to 1/2. No separate convergence hypothesis is added. The q sentence is outside this claim.
Theorem 1.2 (result).
Proof. Machine-checked in Lean as D5/S1/Words/Forbidden/BonaMagaRicheyHalfFrequency.result (✓ std3). ∎
Resolves. Problems/bona-maga-richey-2026-half-frequency-balanced-borders (proved) by D5/S1/Words/Forbidden/BonaMagaRicheyHalfFrequency.result.
Source. Repository-derived.
Acknowledgement. Miklós Bóna, Balázs Maga, Jacob Richey (2026). Letter frequency in shifts of finite type with one forbidden word. URL: https://arxiv.org/abs/2606.06655v2.
Commentary.
The half-frequency characterization holds for every nonempty binary word. For lengths at least three, the scalar moment identities and escaping Abel weights force the boundary signed moment to vanish. The longest-border estimate then forces every border to be balanced. Singleton and constant length-two words are excluded directly; mixed length-two words have balanced borders. The reverse implication gives exact half frequency at every positive length.
References
- Truth anchor:
D5/S1/Words/Forbidden/BonaMagaRicheyHalfFrequency.claim - Truth anchor:
D5/S1/Words/Forbidden/BonaMagaRicheyHalfFrequency.result - Dependency: D5/S1/Words/Forbidden/ForbiddenWordRationalBoundary