Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 shifted norm of a weight is maximal only at the top weight

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ∈Λ+ be a dominant integral weight and let μ be a weight of the finite-dimensional simple module L(λ) (Highest-weight classification, Weight and weight space). With ρ the Weyl vector (The Weyl vector rho for a chosen positive system), (μ+ρ,μ+ρ)≤(λ+ρ,λ+ρ), with equality if and only if μ=λ. Consequently (λ+ρ,λ+ρ)−(μ+ρ,μ+ρ) is strictly positive for every weight μ≠λ of L(λ).

Facts & Assumptions

Given: The Axiom of Choice, a dominant integral weight λ∈Λ+, a weight μ of L(λ), the form ( , ) on E=span⁡RΦ, the Weyl group W and the Weyl vector ρ.

[A1]

The Axiom of Choice is assumed; it enters through the published weight-multiplicity and highest-weight suppliers, which carry it (The Axiom of Choice).

[F1]

Every W-orbit in E has exactly one point in the closed chamber C‾, so every weight has a unique dominant representative (Finite Weyl closed chambers and stabilizers, Finite Weyl root system, lattice and chamber conventions), and the weight multiplicities of L(λ) are W-invariant, so the weight set of L(λ) is stable under W (Simple reflections preserve weight multiplicities).

[F2]

Every weight ν of L(λ) satisfies ν≤λ, that is, λ−ν∈Q+ (Highest weight modules lie below the top weight, Simple roots form a signed integral basis).

[F3]

For every w∈W one has ρ−wρ=∑α∈Φ+,w−1α<0α∈Q+ (The difference of the Weyl vector from its reflections is a sum of positive roots).

[F4]

The action of W on E is by isometries of ( , ): (wν,wη)=(ν,η) (Finite Weyl root system, lattice and chamber conventions, Root reflections and the Weyl group action).

[F5]

Pairings against Q+: for δ∈Q+∖{0} one has (δ,ρ)>0; for δ∈Q+ and a dominant ν one has (δ,ν)≥0, because writing δ=∑iniαi with ni≥0 gives (αi,ν)=(αi,αi)2⟨ν,αi∨⟩ and ⟨ρ,αi∨⟩>0, so in particular μ++ρ is strictly dominant (Positive coroot pairings of a dominant integral weight, Integral, dominant, and strictly dominant weights).

[F6]

For a dominant integral λ and v∈W with reduced expression v=si1⋯sik one has λ−vλ=∑l=1k⟨λ,αil∨⟩ βl with every βl=si1⋯sil−1αil a positive root and every coefficient ⟨λ,αil∨⟩≥0; this is the reduced-word telescoping with prefix positivity from Finite Weyl strong exchange and deletion and Finite Weyl positive roots and simple reflections.

Proof

technique · direct
1.1F1F2F3F4algebraA1

Let μ+ be the unique dominant representative of the W-orbit of μ, which exists by [F1], and note that μ+ is also a weight of L(λ) by the W-invariance in [F1]; choose w∈W with μ+=wμ and put δ:=λ−μ+, so that δ∈Q+ by [F2], and put γ:=ρ−wρ, so that γ∈Q+ by [F3]; since w is an isometry by [F4], (μ+ρ,μ+ρ)=(w(μ+ρ),w(μ+ρ))=(μ++wρ,μ++wρ) and μ++wρ=μ++ρ−γ.

2.1F4step 1.1algebra

With D:=(λ+ρ,λ+ρ)−(μ+ρ,μ+ρ) steps 1.1 gives D=(μ++ρ+δ,μ++ρ+δ)−(μ++ρ−γ,μ++ρ−γ)=(δ+γ,2(μ++ρ)+δ−γ), and expanding this bilinear expression yields D=2(δ,μ++ρ)+(δ,δ)+2(γ,μ+)+(2(γ,ρ)−(γ,γ)); the last bracket is (γ,2ρ−γ)=(ρ−wρ,ρ+wρ)=(ρ,ρ)−(wρ,wρ)=0 by symmetry and the isometry property [F4].

3.1F5step 2.1algebra

Hence D=2(δ,μ++ρ)+(δ,δ)+2(γ,μ+) with δ,γ∈Q+ by step 1.1; the first term is nonnegative and the third is nonnegative because μ+ is dominant and μ++ρ is strictly dominant, while (δ,δ)≥0 by positive definiteness of the form, so D≥0; if δ≠0 then D≥2(δ,ρ)>0 by [F5], so equality forces δ=0, that is, μ+=λ.

4.1F5F6step 1.1step 2.1step 3.1algebra∎

Suppose δ=0, so μ+=λ and μ=w−1λ; then steps 1.1 and 2.1 give D=2(γ,λ)=2((ρ,λ)−(wρ,λ))=2(ρ,λ−w−1λ)=2(ρ,λ−μ), and [F6] applied to v=w−1 writes λ−μ=∑l⟨λ,αil∨⟩βl with βl∈Φ+ and coefficients ≥0, so D=2∑l⟨λ,αil∨⟩(ρ,βl)≥0; by [F5] each (ρ,βl)>0, and the sum vanishes exactly when λ−μ=0, that is, when μ=λ, while for w=1 and μ=λ clearly D=0; combining with step 3.1, D≥0 with equality exactly for μ=λ, and D>0 for every weight μ≠λ.

Depends on

Used by

Dependency tree · two levels

53 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