Marked Charge Obstruction
Abstract
Marked Charge Obstruction
Theorem 1.1 (Marked Charge Obstruction).
Proof. Machine-checked in Lean as D5/S1/Words/Palindromes/PeriodDoubling/MarkedPathObstruction.marked_charge_obstruction (✓ std3). ∎
Source. Repository-derived.
Commentary.
A class-S endpoint of even parity and even signed weight can attain its signed-weight lower bound only if twice its marked-prefix weight fits inside the signed-digit charge plus the lower-tail phase correction. The proof follows an optimal tight path and accounts for each removed marked digit. div and mod denote natural integer quotient and remainder; cast explicitly denotes the displayed coercions.
References
- Truth anchor:
D5/S1/Words/Palindromes/PeriodDoubling/MarkedPathObstruction.marked_charge_obstruction - Dependency: D5/S1/Words/Palindromes/PeriodDoubling/EvenTightPaths
- Dependency: D5/S1/Words/Palindromes/PeriodDoubling/MarkedPrefixRigidity
- Dependency: D5/S1/Words/Palindromes/PeriodDoubling/TightFactorization