Parent roadmap: #697
Independent of the exact-layer implementation except for shared deco code definitions.
Goal
Define normalized deco construction codes, eligible disjoint adjacent (0,2) pairs, subset decoration back to (1,0), the resulting inverse words, and descent-bottom monomials. Prove that each selected pair acts by the stated adjacent final-label swap, that the swaps commute because their supports are disjoint, and that the complete fiber polynomial factors into a monomial, a power of two, and factors
Conclude MvRealStable for every normalized fiber. If it does not materially enlarge the proof, retain independent nonnegative pair weights.
Boundaries
Do not infer stability of the sum over normalized codes. Finite enumeration may test definitions but is not proof.
Acceptance
- Exact definitions and all-rank word/swap identities.
- Checked fiber factorization and MvRealStable witness.
- No sorry, admit, new axiom, statement-only substitute, or prohibited tactic.
- Focused and full builds plus proof-status and axiom audits pass.
Parent roadmap: #697
Independent of the exact-layer implementation except for shared deco code definitions.
Goal
Define normalized deco construction codes, eligible disjoint adjacent (0,2) pairs, subset decoration back to (1,0), the resulting inverse words, and descent-bottom monomials. Prove that each selected pair acts by the stated adjacent final-label swap, that the swaps commute because their supports are disjoint, and that the complete fiber polynomial factors into a monomial, a power of two, and factors
Conclude MvRealStable for every normalized fiber. If it does not materially enlarge the proof, retain independent nonnegative pair weights.
Boundaries
Do not infer stability of the sum over normalized codes. Finite enumeration may test definitions but is not proof.
Acceptance