Statement and result
This note disproves Conjecture 5 in Hong Chen, Apoorva Khare and Siddhartha Sahi, Majorization via positivity of Jack and Macdonald polynomial differences, arXiv:2509.19649v2, §5. The implication from majorization to Muirhead-semiring membership fails. The weaker evaluation-positivity inequality is a different assertion and is not disproved here.
Work in three variables. For a partition , put
The Muirhead semiring consists of finite sums with nonnegative real coefficients of finite products of the and . As in the source's §2.1, partitions have nonnegative integer parts. The partitions in a difference have equal size. Conjecture 5, assertion , claims that
for every whenever . Here denotes the monic Macdonald polynomial.
Theorem. At
the normalized difference in (1) does not belong to . The same conclusion holds, at the same parameters, for every pair
The proof gives a rational linear functional that is nonnegative on the entire relevant homogeneous part of the semiring and is strictly negative on (1). All computations below are rational identities; verify.py checks them using only Python's standard library.
1. A separating functional
On the degree-six symmetric polynomials define by
| 600 | 510 | 420 | 411 | 330 | 321 | 222 | |
|---|---|---|---|---|---|---|---|
| 62 | 28 | 9 | 9 | 2 | 2 | 0 |
Digits abbreviate partitions; for example, 420 means . Since these seven form a basis, this defines uniquely. Its values on the unnormalized monomial basis are
We will prove
Exhaustive reduction of the semiring
Every generator of is homogeneous and nonnegative on the nonnegative orthant. For differences this is Muirhead's inequality. Consequently, if a homogeneous polynomial of degree six belongs to the semiring, it has a representation using only products of total degree six. Indeed, each homogeneous component of any other degree in a proposed representation is a nonnegative sum of nonnegative polynomials and is identically zero. Every nonzero summand in such a component would be positive somewhere on the positive orthant, which is impossible.
There are two further reductions.
- A difference is a sum of differences along a saturated chain from to in dominance order. Thus it suffices to use cover differences.
- A product of ordinary -factors has nonnegative coefficients in the monomial basis and is symmetric. It is therefore a nonnegative linear combination of single . Thus a product containing differences needs at most one ordinary -factor.
Every nonzero difference has degree at least two. A degree-six product therefore has at most three difference factors. The exhaustive remaining list consists of:
- 27 products with one cover difference;
- 10 products with two cover differences;
- the cube of the unique degree-two difference;
- the seven ordinary degree-six monomials .
For completeness, the cover differences in degrees two through six are
| Degree | Covers |
|---|---|
| 2 | 200–110 |
| 3 | 300–210, 210–111 |
| 4 | 400–310, 310–220, 220–211 |
| 5 | 500–410, 410–320, 320–311, 311–221 |
| 6 | 600–510, 510–420, 420–411, 420–330, 411–321, 330–321, 321–222 |
The following table checks all 38 products. Write and .
| Product | value |
|---|---|
| 5 | |
| 4 | |
| 4 | |
| 3 | |
| 9 | |
| 9 | |
| 7 | |
| 4 | |
| 2 | |
| 2 | |
| 16 | |
| 15 | |
| 24 | |
| 11 | |
| 0 | |
| 3 | |
| 34 | |
| 19 | |
| 0 | |
| 7 | |
| 7 | |
| 0 | |
| 2 | |
| 1 | |
| 0 | |
| 1 | |
| 0 | |
| 2 | |
| 0 | |
These entries can be obtained by expanding and applying the first table. The verifier generates the cover list independently from dominance inequalities, enumerates precisely the cases above, and recomputes every entry. All are nonnegative. The ordinary monomial generators also have nonnegative -values, proving (5).
2. Exact Macdonald polynomials
At the rational parameters (2), the two required monic polynomials are
Here is an independent way to verify their identification that does not use the branching implementation that found the example. The first Macdonald difference operator is
It is triangular on the monomial basis, with diagonal eigenvalues
The monic triangular eigenpolynomial with eigenvalue is . At (2), the seven degree-six eigenvalues are distinct. Direct substitution of (6) into (7) gives
These checks are polynomial identities after multiplication by . For example, writing the variables as , the three coefficients after this multiplication are
The verifier expands and compares every rational monomial coefficient with that of . It also checks distinctness of all seven eigenvalues, monicity, and triangular support. This proves (6) using the defining eigenfunction characterization.
The evaluations and functional values are
Subtracting gives
Because , equations (5) and (9) contradict (1). This proves the first assertion of the theorem.
3. Rectangular translates give an infinite counterfamily
Write . We first prove the following property of the whole Muirhead semiring:
For a monomial generator , its order of vanishing in is , and
For a nonzero difference , dominance implies , so
The residual factor in (11) is again a Muirhead difference. Its restriction to is nonnegative and is not identically zero: the first partition has last part zero; the second either has positive last part, in which case its monomial restriction vanishes, or also has last part zero, in which case the two distinct monomial symmetric polynomials in the remaining variables cannot cancel. Thus the order in of this difference is exactly .
It follows that every nonzero product of generators can be written , where and is a nonzero nonnegative polynomial. In a finite nonnegative sum of such products, terms of minimum order cannot cancel: their leading coefficients are nonnegative functions on the positive quadrant and are not all zero. Consequently, if the sum is divisible by , every product in the sum has . Dividing each product by leaves , proving (10).
The standard rectangular-translation identity is
Normalization at preserves this identity. Thus the difference for the pair (3) is times the difference in (9). If any such translate belonged to the semiring, (10) would imply that the original difference did too. This contradiction proves the whole family (3).
4. Scope and validation
This is a counterexample to the complete equivalence asserted in Conjecture 5, through its majorization-to-semiring implication. It makes no claim that the ordinary evaluation difference is negative. In fact, Sra's October 2026 paper proves evaluation positivity for the very pair , in Certificate 4.1.
The authors' Example 4.1 concerns a Schur difference outside the smaller Muirhead cone and explicitly represents it inside the semiring. Their Example 4.7 concerns a different Jack semiring and reverses the allowed parameter order. Neither is the counterexample proved here. The Jack-semiring Conjecture 4 remains untouched by this argument.
Validation performed:
- exact discovery by Macdonald branching and a rational dual functional;
- independent identification by the first Macdonald difference operator;
- exhaustive reduction of the full degree-six semiring to 38 products;
- an independently written standard-library check of the same 38 products;
- exact rational evaluations in (6)–(9);
- separate source and prior-status audits.
Run python verify.py. No numerical approximation or Lean verification is used in the certificate. The auxiliary discovery scripts use numerical linear programming only to propose functionals; that search is not part of the proof.
Sources
- Hong Chen, Apoorva Khare and Siddhartha Sahi, Majorization via positivity of Jack and Macdonald polynomial differences, arXiv:2509.19649v2, Conjecture 5, equation (5.7), and the Muirhead-semiring definition in §1. https://arxiv.org/html/2509.19649v2
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, second edition, Oxford University Press, 1995, Chapter VI, §4, for the difference-operator characterization and rectangular translations. The operator and eigenfunction characterization also appear explicitly in A. M. Garsia and M. Haiman, A remarkable q,t-Catalan sequence and q-Lagrange inversion, §2, equations (2.1)–(2.5), printed page 14: https://math.berkeley.edu/~mhaiman/ftp/remarkable-qtcat/qtcat.pdf
- Suvrit Sra, On majorization inequalities for normalized Jack and Macdonald polynomials, 8 October 2026, Certificate 4.1 and §1.3. https://suvrit.github.io/papers/jackratio/jackratio-v1.pdf Also available at https://hexagonmath.org/pdf/2610.00725v1.
See SOURCE_AUDIT.md for the separate priority search and ANALYSIS_REVIEW.md for independent review.