Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 Frobenius characteristic is an isometry

Statement

Extend the Hall form on Λ Q-bilinearly to ΛQ and then sesquilinearly to ΛC=C⊗QΛQ, linear in the first argument and conjugate-linear in the second, so that ⟨pρ,pσ⟩H=δρσzρ for all partitions ρ,σ (Power sums are orthogonal for the Hall form, The Hall inner product on symmetric functions). For all f,g∈cf(Sn),

⟨ch⁡(f),ch⁡(g)⟩H=⟨f,g⟩Sn=1n!∑w∈Snf(w)g(w)‾.

Consequently ch⁡ is injective on cf(Sn), and ⟨f,f⟩Sn=∑ρ⊢n∣f(ρ)∣2/zρ≥0 with equality if and only if f=0.

Facts & Assumptions

Given: An integer n≥0 and class functions f,g∈cf(Sn).

[F1]

ch⁡(f)=∑ρ⊢nf(ρ)pρ/zρ∈ΛCn, where f(ρ) is the common value of f on elements of cycle type ρ and zρ=∏iimi(ρ)mi(ρ)! (The Frobenius characteristic map).

[F2]

A class function is constant on conjugacy classes, and a class function is determined by its values on one representative of each conjugacy class; the space cf(Sn) carries pointwise addition and scalar multiplication (Class functions and the complex vector space cf(G)).

[F3]

The standard inner product on cf(Sn) is ⟨φ,ψ⟩Sn=1n!∑w∈Snφ(w)ψ(w)‾, linear in the first argument and conjugate-linear in the second, and it is positive definite (The standard inner product on cf(G)).

[F4]

The Hall form is the graded Z-bilinear form on Λ with ⟨hλ,mμ⟩H=δλμ; its Q-bilinear extension to ΛQ satisfies ⟨pρ,pσ⟩H=δρσzρ for all partitions ρ,σ (The Hall inner product on symmetric functions, Power sums are orthogonal for the Hall form).

[F5]

If σ∈Sn has exactly mi(ρ) cycles of length i, then its centralizer has order zρ=∏iimi(ρ)mi(ρ)! (If σ∈Sn has ck cycles of length k, then ∣CSn(σ)∣=∏k=1nkckck!).

[F6]

The conjugacy classes of Sn are indexed by the cycle types ρ⊢n, and for w∈Sn the class of w has cardinality [Sn:CSn(w)]=n!/∣CSn(w)∣ (The conjugacy classes of Sn are indexed by the tuples (c1,…,cn) with ∑kck=n, G/CG(x)→Cl⁡G(x) is a bijection, so ∣Cl⁡G(x)∣=[G:CG(x)] whenever these cardinalities are finite).

Proof

technique · direct
1.1F4

The Q-bilinear extension of the Hall form to ΛQ extends to a sesquilinear form on ΛC=C⊗QΛQ by ⟨a⊗x,b⊗y⟩H:=ab‾ ⟨x,y⟩H on decomposable tensors; it is well defined because the form is Q-bilinear, it is linear in the first argument and conjugate-linear in the second, and on power sums it has ⟨pρ/zρ,pσ/zσ⟩H=δρσ/zρ by [F4] and zρ>0.

1.2F2F3F5F6algebra

On the group side, grouping the defining sum of [F3] by conjugacy classes, which by [F6] are indexed by the cycle types ρ⊢n and have cardinality n!/zρ by [F5] and [F6], and using that f,g are constant on classes by [F2], gives ⟨f,g⟩Sn=1n!∑ρ⊢nn!zρf(ρ)g(ρ)‾=∑ρ⊢nf(ρ)g(ρ)‾/zρ.

2.1F1F4step 1.1algebra

Expanding both characteristics in the basis {pρ/zρ:ρ⊢n} of ΛQn via [F1] and using the sesquilinearity of step 1.1 and the values ⟨pρ/zρ,pσ/zσ⟩H=δρσ/zρ, ⟨ch⁡(f),ch⁡(g)⟩H=∑ρ,σf(ρ)g(σ)‾⟨pρ/zρ,pσ/zσ⟩H=∑ρ⊢nf(ρ)g(ρ)‾/zρ.

3.1F3step 2.1step 1.2∎

Steps 2.1 and 1.2 prove the displayed isometry ⟨ch⁡(f),ch⁡(g)⟩H=⟨f,g⟩Sn for all f,g∈cf(Sn). Taking g=f and using positive definiteness of the standard inner product [F3], ⟨f,f⟩Sn=∑ρ⊢n∣f(ρ)∣2/zρ≥0, with equality exactly when f(ρ)=0 for every ρ, that is, when f=0; hence if ch⁡(f)=0 then ⟨f,f⟩Sn=⟨ch⁡(f),ch⁡(f)⟩H=0 and f=0, so ch⁡ is injective on cf(Sn).

Depends on

Used by

Dependency tree · two levels

30 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