Status and scope
The manuscript proves two decomposed multivariate stability results for the deco descent-bottom polynomial. The stability of their total sum remains an open conjecture. This issue is only for the proved decompositions and must not present the total-stability conjecture as solved.
Target A: exact exceptional layers
For height h and an admissible nonconsecutive set R of exceptional construction positions, define the homogenized exact-layer polynomial
Btilde_(h,R)(s,u)
= sum_tau s^(h-1-des(tau)) product_(descent bottoms r of tau) u_r.
Formalize the construction from the seed s using:
- a normal step
f -> s(1+u_1 D)f, where D=partial_s+sum_j partial_(u_j) after the required relabeling;
- an exceptional step given by relabeling and multiplication by
s u_2.
Prove every exact layer is MvRealStable, then derive stability of its specialization at s=1.
Target B: normalized-code fibers
For a normalized code c, define the fiber over subsets of its disjoint eligible (0,2) pairs and prove the descent-bottom enumerator factors as a monomial, a power of two, and factors
Conclude that every fiber is real stable. If inexpensive, retain independent nonnegative pair weights through the corresponding partial symmetrizations.
Existing infrastructure
The library already has MvRealStable, multiplication, renaming, partial derivative, boundary specialization, and finite-product stability support. The main work is finite-variable indexing, relabeling, and the exact combinatorial decomposition; finite checks are not substitutes.
The existing Applications/EulerianVariations.PeakValues stability theorem concerns a different family and should only be used as an API/style precedent.
Explicit exclusions
- Do not claim stability of the sum of the layers or fibers. Stability is not closed under arbitrary addition.
- Do not add the total polynomial as a proved theorem or theorem-shaped scaffold.
- The all-rank total-stability conjecture and the affine-slice interval-preserver problem remain open mathematics.
Acceptance criteria
Status and scope
The manuscript proves two decomposed multivariate stability results for the deco descent-bottom polynomial. The stability of their total sum remains an open conjecture. This issue is only for the proved decompositions and must not present the total-stability conjecture as solved.
Target A: exact exceptional layers
For height
hand an admissible nonconsecutive setRof exceptional construction positions, define the homogenized exact-layer polynomialFormalize the construction from the seed
susing:f -> s(1+u_1 D)f, whereD=partial_s+sum_j partial_(u_j)after the required relabeling;s u_2.Prove every exact layer is
MvRealStable, then derive stability of its specialization ats=1.Target B: normalized-code fibers
For a normalized code
c, define the fiber over subsets of its disjoint eligible(0,2)pairs and prove the descent-bottom enumerator factors as a monomial, a power of two, and factorsConclude that every fiber is real stable. If inexpensive, retain independent nonnegative pair weights through the corresponding partial symmetrizations.
Existing infrastructure
The library already has
MvRealStable, multiplication, renaming, partial derivative, boundary specialization, and finite-product stability support. The main work is finite-variable indexing, relabeling, and the exact combinatorial decomposition; finite checks are not substitutes.The existing
Applications/EulerianVariations.PeakValuesstability theorem concerns a different family and should only be used as an API/style precedent.Explicit exclusions
Acceptance criteria
MvRealStabletheorem and a checkeds=1specialization.MvRealStabletheorem.sorry, new axiom, or theorem-shaped statement scaffold is counted as completion.