Alphabeta Math
PropositionStatement: 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.

The omega involution conjugates Schur functions

Statement

Let ω:Λ→Λ be the graded Z-algebra endomorphism determined by ω(er)=hr for every r≥1. Then ω is an involution and ω(hr)=er,ω(pr)=(−1)r−1pr in ΛQ(r≥1),ω(sλ)=sλ′for every partition λ.

Facts & Assumptions

Given: The stable graded ring, the free stable elementary and complete generators, the finite reciprocal-series identity, the stable power sums, partition conjugation, and both Jacobi–Trudi formulas.

[F1]

The degreewise inverse-limit ring Λ=⨁d≥0Λd has coordinatewise multiplication and finite degree support (The stable graded ring of symmetric functions).

[F2]

The stable elements satisfy Λ=Z[e1,e2,…], and the er are algebraically independent generators; the hr are also stable homogeneous elements (Elementary and complete families freely generate the stable ring).

[F3]

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

[F4]

For r≥1, pr∈Λr is the compatible sequence of finite power sums pr(x1,…,xN)=∑i=1Nxir (Power sums form a rational but not integral stable basis).

[F5]

Partition conjugation is an involution: λ′′=λ (Partitions, English diagrams, and conjugation).

[F6]

For every partition μ, sμ=det⁡(hμi−i+j)=det⁡(eμi′−i+j) for all allowed determinant sizes, with zero padding and negative-index terms zero (Jacobi–Trudi and dual Jacobi–Trudi identities).

Proof

technique · direct
1.1F1F2F3F4algebra

By [F3], each finite-rank coefficient of E(−t)H(t)−1 is zero. By [F1] and [F2], these are projections of stable coefficients, so equality of every projection gives E(−t)H(t)=1 in Λ⟦t⟧. For finite rank N≥0, write HN(t)=∑k≥0hk(x1,…,xN)tk and pr(N)=∑i=1Nxir. The finite identity [F3] gives HN(t)=∏i=1N(1−xit)−1. Differentiating this finite product and expanding each geometric series gives tHN′(t)/HN(t)=∑i=1Nxit/(1−xit)=∑r≥1pr(N)tr. Each coefficient is stable by [F1], [F2], and [F4], so equality of all rank projections gives tH′(t)/H(t)=∑r≥1prtr in ΛQ⟦t⟧, where H(t)=∑k≥0hktk and H(t) is invertible because its constant term is 1.

1.2F1F2

Since Λ=Z[e1,e2,…] freely by [F2], replacing each polynomial generator er by the stable element hr∈Λr defines a unique unital graded Z-algebra endomorphism ω of Λ.

2.1step 1.1step 1.2

The coefficient of tn in the stable identity of step 1.1 gives ∑i=0n(−1)ieihn−i=0 for each n≥1. Applying ω and using ω(ei)=hi gives ω(hn)+∑i=1n(−1)ihiω(hn−i)=0. Reversing the index in the original recurrence also gives en+∑i=1n(−1)ihien−i=0. Starting with ω(h0)=1=e0, induction on n makes these last two sums identical after the leading term, so ω(hn)=en. Therefore ω2(en)=en for every free generator; hence ω2 is the identity on Λ and ω is a ring automorphism. It sends 0 to 0 and 1 to 1.

3.1F5F6step 1.1step 1.2step 2.1algebra

For a partition λ, apply ω to the h Jacobi–Trudi determinant in [F6]; for nonnegative indices step 2.1 gives ω(hk)=ek, and for negative indices both are zero by [F6] and ω(0)=0. Multiplicativity and additivity therefore give ω(sλ)=det⁡(eλi−i+j). Apply the dual formula in [F6] to λ′ with determinant size r=ℓ(λ), which is allowed because ℓ((λ′)′)=ℓ(λ) and [F5] identifies (λ′)′=λ. Thus this determinant is sλ′, including at the minimal allowed size. The empty case gives ω(1)=1=s∅. For λ=(1) the size-one determinant gives ω(s(1))=e1=h1=s(1), where e1=h1 is the coefficient of t in the stable identity of step 1.1.

4.1F1F2F3F4step 1.1step 2.1algebra∎

Extend ω to ΛQ and apply it coefficientwise to the logarithmic-derivative identity of step 1.1. By step 2.1, ω(H(t))=E(t):=∑k≥0ektk, and a coefficientwise ring map commutes with formal differentiation and inverses of series with constant term 1; hence tE′(t)/E(t)=∑r≥1ω(pr)tr. At rank N, replacing t by −t in [F3] gives EN(t)=∏i=1N(1+xit), so tEN′(t)/EN(t)=∑ixit/(1+xit)=∑r≥1(−1)r−1pr(N)tr. Each coefficient is stable by [F1], [F2], and [F4]; therefore tE′(t)/E(t)=∑r≥1(−1)r−1prtr in ΛQ⟦t⟧. Comparing coefficients proves ω(pr)=(−1)r−1pr for every r≥1, including the endpoint r=1.

Depends on

Used by

Nothing in the library uses this result yet.

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