Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedaudited 2026-09-30
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.

Stable Schur functions from bialternants

Definition

For a partition λ and an integer N≥ℓ(λ), pad λ with zero parts to length N and set δN=(N−1,N−2,…,0). Define the alternating polynomial aλ+δN(x1,…,xN):=det⁡(xiλj+N−j)1≤i,j≤N, and define aδN by the same formula with λ=∅. The finite-rank Schur polynomial is sλ(x1,…,xN):=aλ+δN(x1,…,xN)aδN(x1,…,xN). For 0≤N<ℓ(λ), define sλ(x1,…,xN):=0. Thus a component is specified at every rank, including rank zero; empty determinants have value 1.

Well-definedness and stability. The exponents λj+N−j are strictly decreasing, so the numerator is alternating. Setting xi=xj makes it zero; the factor theorem therefore gives divisibility by each xi−xj in Z[x1,…,xN]. These pairwise nonassociate prime factors therefore have product aδN dividing the numerator, so the quotient is an integral polynomial. Since numerator and denominator both change by the sign of a variable permutation, their quotient is symmetric. Its degree is ∣λ∣.

If N+1>ℓ(λ), setting xN+1=0 in the rank-(N+1) numerator and denominator expands each determinant along its last row; both resulting minors have the common factor x1⋯xN, and after cancelling it the quotient is exactly the rank-N quotient. At the remaining boundary N+1=ℓ(λ)>0, every exponent in the rank-(N+1) numerator is positive, so its last row becomes zero when xN+1=0. The denominator specializes to (x1⋯xN)aδN, a nonzero polynomial (equal to 1 when N=0). Specializing the polynomial identity aλ+δN+1=aδN+1sλ and cancelling this nonzero polynomial shows that the specialized Schur polynomial is zero, as required by the rank-N definition. Below this boundary both components are zero. Hence these polynomials form a compatible sequence in the inverse limit The stable graded ring of symmetric functions, defining sλ∈Λ∣λ∣. With the empty determinant equal to 1, s∅=1. The partition length and padding convention is that of Partitions, English diagrams, and conjugation.

At the minimal rank N=1, the one-box partition gives s(1)(x1)=x1 directly from the quotient; its stable sequence is nonzero.

Depends on

Used by

Dependency tree · two levels

4 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