LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-16

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The leading multidegree of a symmetric polynomial is weakly decreasing

Statement

If $0 \neq f \in R [x_{1}, \dots, x_{n}]$ is symmetric and has leading multidegree $(a_{1}, \dots, a_{n})$ in lexicographic order, then

$a_{1} \geq a_{2} \geq \dots \geq a_{n} .$

Facts & Assumptions

Given: A nonzero symmetric polynomial $f$ with leading multidegree $a = (a_{1}, \dots, a_{n})$ .

[L1]

Every permutation of the variables fixes a symmetric polynomial (Symmetric polynomials as the invariants of variable permutations).

[L2]

The leading multidegree is the lexicographically greatest exponent tuple carrying a nonzero coefficient (Lexicographic order on exponent tuples and the multidegree of a nonzero polynomial).

Proof

technique · contradiction

1.1assume-contra

Suppose, for contradiction, that $a_{i} < a_{i + 1}$ for some $i < n$ .

1.2givenL1

Interchanging $x_{i}$ and $x_{i + 1}$ fixes $f$ , so the tuple $a^{'} = (a_{1}, \dots, a_{i - 1}, a_{i + 1}, a_{i}, a_{i + 2}, \dots, a_{n})$ occurs in $f$ with the same nonzero coefficient as $a$ .

2.1step 1.1step 1.2L2discharge-contradiction∎

The tuples agree before coordinate $i$ and $a_{i}^{'} = a_{i + 1} > a_{i}$ , so $a^{'} >_{l e x} a$ , contradicting the maximality in [L2]. Therefore no such $i$ exists and the tuple is weakly decreasing.

Depends on

Used by

Every symmetric polynomial over a commutative ring is a polynomial in the elementary symmetric polynomials Theorem

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

K. Conrad, Symmetric Polynomials, Section 2 (standard reference, not scraped)