Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Schur functions form an orthonormal integral basis

Statement

For every d≥0, the stable Schur functions {sλ:λ⊢d} form a Z-basis of Λd and are orthonormal for the Hall form: ⟨sλ,sμ⟩H=δλμ for all partitions λ,μ.

Facts & Assumptions

Given: The degreewise stable ring, partition indexing and dominance order, the Jacobi–Trudi determinant, the integral h-basis, the Cauchy expansions, and the defining Hall duality.

[F1]

The stable ring is graded, with homogeneous components Λd and algebraic direct sum Λ=⨁d≥0Λd (The stable graded ring of symmetric functions).

[F2]

A partition of d is a finite weakly decreasing sequence of positive integers with sum d; its length is its number of parts, and ∅ is the sole partition of zero (Partitions, English diagrams, and conjugation).

[F3]

For partitions of the same integer, ν⊵λ exactly when every prefix sum of ν is at least the corresponding prefix sum of λ; strict dominance means ν⊵λ and ν≠λ (Dominance order on partitions).

[F4]

For each d≥0, the products hλ indexed by λ⊢d form a Z-basis of Λd (Elementary and complete families freely generate the stable ring).

[F5]

For any r≥ℓ(λ), sλ=det⁡(hλi−i+j)1≤i,j≤r, with zero padding, h0=1, hk=0 for k<0, and the empty determinant equal to 1 (Jacobi–Trudi and dual Jacobi–Trudi identities).

[F6]

In the bidegree completion, Ω(x,y)=∑αhα(x)mα(y)=∑λsλ(x)sλ(y), with both sums taken by diagonal bidegree (Power-sum, complete, and Schur expansions of the Cauchy kernel).

[F7]

The Hall form is graded and satisfies ⟨hα,mβ⟩H=δαβ (The Hall inner product on symmetric functions).

Proof

technique · triangularity
1.1F2F3F5algebra

Fix λ⊢d with n=ℓ(λ)>0 and apply [F5] with r=n. In the determinant expansion, a permutation σ∈Sn contributes sgn⁡(σ)∏ihαi, where αi=λi−i+σ(i). If some αi<0, that term is zero by [F5]; otherwise ∑iαi=d, and sorting the nonnegative αi and omitting zeros gives a partition ν⊢d with ∏ihαi=hν. The identity permutation contributes hλ with coefficient one. For σ≠id, some initial set {1,…,k} is not preserved, so ∑i≤kσ(i)>∑i≤ki; for every k, the same sum is at least ∑i≤ki. Hence ∑i≤kαi≥∑i≤kλi for all k, strictly for some k. Sorting the nonnegative αi can only increase each prefix sum, so every nonzero nonidentity term has ν⊳λ.

2.1F1F2F3F4F5step 1.1algebra

For d>0, combine equal terms in step 1.1 to write sλ=∑ν⊢dcλνhν, where cλλ=1 and cλν=0 unless ν=λ or ν⊳λ. The dominance poset of the finite set of partitions of d has a linear extension (successively remove a minimal element), making this coefficient matrix triangular with diagonal one. Its off-diagonal part is nilpotent, so the finite inverse I−N+N2−⋯ has integer entries. Thus the sλ form a Z-basis because the hν do by [F4]. For d=0, [F2] gives only ∅, and [F5] gives s∅=1, the basis of Λ0=Z.

3.1F1F4F6F7step 2.1algebra

Fix d≥0 and index the finite partition set by Pd. The basis result of step 2.1 and the h-basis [F4] give invertible rational matrices A,B with sλ=∑α∈PdAλαhα=∑β∈PdBλβmβ. Comparing the two degree-(d,d) Cauchy expansions in [F6] gives ATB=I. By [F7], the pairing matrix is (⟨sλ,sμ⟩H)λ,μ=ABT=I, since B=(AT)−1. This proves orthonormality without assuming symmetry of the Hall form. In degree zero both bases consist of 1, so the pairing is ⟨1,1⟩H=1; in degree one, s(1)=h1 and the same kernel calculation gives ⟨s(1),s(1)⟩H=1.

4.1F1F2F5F7algebra∎

If ∣λ∣≠∣μ∣, gradedness in [F7] gives zero pairing, and bilinearity makes any zero input pair to zero. The proof treats the least degree d=0, the minimal Jacobi–Trudi size n=ℓ(λ), and every finite partition set at each d. The determinant terms, matrix inverse, and linear extension of a finite poset use only finite operations; no form of the axiom of choice is used.

Depends on

Used by

Dependency tree · two levels

18 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