Skip to content

[application][P1] Single Deco eligible-pair inverse-word swap #788

Description

@PerAlexandersson

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.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions