Parent: #783
Depends on: #782, #786, #787
Roadmap parent: #697
Goal
Prove the single eligible-pair inverse-word theorem for a normalized chronological Deco code.
For a one-based eligible start j with 3 ≤ j < h, compare the normalized pair (0,2) with the singleton exceptional decoration (1,0). Prove that the resulting inverse word is obtained by swapping exactly the final adjacent labels h-j and h-j+1.
Add a family-neutral comparison-word definition for positive integer words and the minimal insertion lemmas needed to prove that the normal and exceptional inverse words have identical ascent/descent comparison words after every common suffix.
Placement
Extend RealRooted/Applications/OEIS/A144438/InverseWord.lean; place genuinely reusable word-comparison lemmas in RealRooted/Combinatorics/MinimumInsertionWord.lean or a focused sibling if that keeps dependencies smaller.
Boundaries
Do not prove simultaneous finite decorations, orbit sums, descent-bottom monomial identities, or stability. Those remain in #783/#785.
Acceptance
- Checked singleton-decoration code theorem.
- Checked final adjacent-label swap with the stated one-based indexing.
- Checked equality of full comparison words.
- No
sorry, admit, new axiom, statement-only substitute, or prohibited tactic.
- Focused and full builds plus proof-status and axiom audits pass.
Parent: #783
Depends on: #782, #786, #787
Roadmap parent: #697
Goal
Prove the single eligible-pair inverse-word theorem for a normalized chronological Deco code.
For a one-based eligible start
jwith3 ≤ j < h, compare the normalized pair(0,2)with the singleton exceptional decoration(1,0). Prove that the resulting inverse word is obtained by swapping exactly the final adjacent labelsh-jandh-j+1.Add a family-neutral comparison-word definition for positive integer words and the minimal insertion lemmas needed to prove that the normal and exceptional inverse words have identical ascent/descent comparison words after every common suffix.
Placement
Extend
RealRooted/Applications/OEIS/A144438/InverseWord.lean; place genuinely reusable word-comparison lemmas inRealRooted/Combinatorics/MinimumInsertionWord.leanor a focused sibling if that keeps dependencies smaller.Boundaries
Do not prove simultaneous finite decorations, orbit sums, descent-bottom monomial identities, or stability. Those remain in #783/#785.
Acceptance
sorry,admit, new axiom, statement-only substitute, or prohibited tactic.