Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Jacobi–Trudi and dual Jacobi–Trudi identities

Statement

For every partition λ, let sλ∈Λ be the stable Schur function defined by bialternants (Stable Schur functions from bialternants). For any integers r≥ℓ(λ) and c≥ℓ(λ′), pad λ and λ′ with zero parts to lengths r and c, respectively. Then sλ=det⁡(hλi−i+j)1≤i,j≤r=det⁡(eλi′−i+j)1≤i,j≤c, where hk,ek∈Λ are the stable complete and elementary functions (Elementary and complete families freely generate the stable ring, The elementary symmetric polynomials e0,e1,…,en, Power sums pk and complete homogeneous symmetric polynomials hk). In these determinants use h0=e0=1, set hk=ek=0 for k<0, and take the empty determinant to be 1.

Facts & Assumptions

Given: The stable graded ring, partition conjugation, the bialternant definition of sλ, stable er,hr, and their finite-rank conventions.

[F1]

Each Λd is the inverse limit of the degree-d finite symmetric-polynomial parts, and Λ=⨁d≥0Λd has coordinatewise multiplication (The stable graded ring of symmetric functions).

[F2]

The conjugate partition has parts λj′=#{i:λi≥j}, its length is λ1, and ∅′=∅ (Partitions, English diagrams, and conjugation).

[F3]

For N≥ℓ(λ), the finite Schur polynomial is the bialternant quotient aλ+δN/aδN, and its compatible rank sequence defines sλ∈Λ∣λ∣ (Stable Schur functions from bialternants).

[F4]

The finite sequences er,hr specialize compatibly to stable elements, have e0=h0=1, and the hr are algebraically independent generators of Λ (Elementary and complete families freely generate the stable ring).

[F5]

In rank N, eq is the sum of squarefree monomials indexed by the q-element subsets, with e0=1 and eq=0 for q>N (The elementary symmetric polynomials e0,e1,…,en).

[F6]

In rank N, hk is the sum of all monomials of total degree k, with h0=1 (Power sums pk and complete homogeneous symmetric polynomials hk).

[F7]

In every finite rank, E(−t)H(t)=1, with E(−t)=∏i=1N(1−xit) and H(t)=∑k≥0hktk (The generating-series identity E(−t)H(t)=1).

Proof

technique · direct
1.1F1F4F5F7

For each n≥1, take the coefficient of tn in the finite identity [F7] at every rank N. By [F4] and [F5], these coefficients are the rank projections of the stable products ∑i=0n(−1)ieihn−i. Since all projections vanish, the inverse-limit element is zero by [F1]; the constant coefficient is e0h0=1. Hence E(−t)H(t)=1 coefficientwise in Λ⟦t⟧.

1.2F5F6F7algebra

Fix a finite rank N≥1 and let eq(k) be the elementary polynomial in the variables other than xk. By [F5] and [F7], HN(t)∑q=0N−1(−1)qeq(k)tq=(1−xkt)−1. For α∈NN, define Aα=(xkαi)i,k, Mj,k=(−1)N−jeN−j(k), and (Hα)i,j=hαi−N+j. Taking the coefficient of tαi gives Aα=HαM.

2.1F1F2F3step 1.2

If λ=∅, then sλ=1 by [F3], and either determinant is upper unitriangular or empty, hence equals 1. Otherwise fix any finite rank N≥r≥ℓ(λ)≥1. Put δN=(N−1,…,0) and αi=λi+N−i. For α=δN, HδN is upper triangular with diagonal 1, so det⁡M=det⁡AδN=aδN≠0. For α=λ+δN, det⁡Aα is the bialternant numerator and Hα=(hλi−i+j)i,j. Taking determinants in Aα=HαM and using det⁡M=det⁡AδN gives det⁡Aα/det⁡AδN=det⁡Hα; by [F3] this is the rank-N Schur polynomial. Appending a zero part to λ changes the determinant to (Bv01), so its value is independent of determinant size; hence for every rank N≥r the size-r determinant equals the rank-N Schur polynomial. Compatibility gives equality in Λ.

2.2F1F4step 1.1

For the chosen sizes r,c, index matrices by 0,…,r+c−1 and set Ua,b=hb−a and Va,b=(−1)b−aeb−a when b≥a, with both entries zero when b<a. Step 1.1 gives UV=I coefficientwise; both matrices are upper unitriangular, so V=U−1 and det⁡U=1.

3.1F1F2F3F4step 2.1step 2.2algebra∎

If λ=∅, each determinant is upper unitriangular, or empty, and equals 1. Otherwise pad λ and λ′ with zero parts to the chosen sizes and set I={λi+r−i:1≤i≤r} and J={r−i:1≤i≤r}. In increasing order, the minor UJ,I is the transpose of (hλi−i+j) with both orders reversed, so det⁡UJ,I=det⁡(hλi−i+j). Its complements are Jc={r+j−1:1≤j≤c} and Ic={r−1+j−λj′:1≤j≤c}. The listed Ic indices are strictly increasing and lie in {0,…,r+c−1}. None equals λi+r−i, since equality would give λi+λj′=i+j−1: if j≤λi the left side is at least i+j, and if j>λi it is at most i+j−2. The two sets have r+c distinct indices in total and are therefore complementary. At rank N≥ℓ(λ), the bialternant numerator and denominator are nonzero: the strictly decreasing exponents give distinct monomials in the numerator determinant, and the Vandermonde denominator is nonzero. Thus sλ≠0; by [F4], Λ is a domain. Over K=Frac⁡(Λ), A=UJ,I is invertible by step 2.1. Reorder rows as J,Jc and columns as I,Ic, giving U~=(ABCD). Block elimination gives det⁡U~=det⁡Adet⁡(D−CA−1B), while the lower-right block of U~−1 is (D−CA−1B)−1. Thus det⁡A=det⁡U~det⁡(VIc,Jc). Moving an increasing index set S of size r to the front has sign (−1)∑S−r(r−1)/2; the row and column reorderings therefore give det⁡U~=(−1)∑I+∑Jdet⁡U. Since ∑I+∑J=∣λ∣+r(r−1) and det⁡U=1, this sign is (−1)∣λ∣. The complementary minor has entries Vr−1+i−λi′,r+j−1=(−1)λi′−i+jeλi′−i+j; a negative subscript gives zero by the stated convention. Factoring row and column signs contributes (−1)∑iλi′−∑ii+∑jj=(−1)∣λ∣, which cancels the permutation sign. Therefore det⁡(hλi−i+j)=det⁡(eλi′−i+j). For λ=(1) and r=c=1, these are h1 and e1, each the sum of the variables by [F5] and [F6].

Depends on

Used by

Dependency tree · two levels

15 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