Alphabeta Math
CorollaryStatement: AI-adaptedProof: 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 Borel-Weil-Bott Euler character is a signed dual Weyl character

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let ch denote the formal character of a finite-dimensional g-module (The formal character of a finite-dimensional weight module) and let A be the Weyl alternation operator with Weyl denominator A(ρ)=∏α>0(eα/2−e−α/2) (The Weyl alternation operator, The Weyl character formula). For every λ∈X∗(T): if λ+ρ is not regular then ∑i(−1)ich Hi(X,Lλ)=0; if λ+ρ is regular with Weyl element w, then ∑i(−1)ich Hi(X,Lλ)=(−1)ℓ(w)ch L(w⋅λ)∗=(−1)ℓ(w)A(−w0(w⋅λ)+ρ)A(ρ). Equivalently, with ν=−w0(w⋅λ), which is the dominant integral weight of the dual module L(w⋅λ)∗, the last expression is (−1)ℓ(w)A(ν+ρ)/A(ρ).

Facts & Assumptions

Given: The Axiom of Choice, the group G, its Borel B, the flag variety X=G/B, the Weyl group W with longest element w0, a weight λ, and its line bundle Lλ.

[F1]

Borel-Weil-Bott: if λ+ρ is singular then all Hi(X,Lλ) vanish, and if λ+ρ is regular with Weyl element w then Hℓ(w)(X,Lλ)≅L(w⋅λ)∗ and all other cohomology vanishes; in particular the alternating sum runs over a finite list of finite-dimensional modules (The Borel-Weil-Bott theorem).

[F2]

The formal character is additive: ch(V⊕W)=chV+chW and the zero module has character 0, the sum being taken in the completed character ring (Formal characters are additive and multiplicative, The formal character of a finite-dimensional weight module).

[F3]

For a dominant integral weight ν the dual L(ν)∗ is irreducible of highest weight −w0ν, so L(ν)∗≅L(−w0ν) by the classification of finite-dimensional irreducibles; the Weyl character formula gives ch L(μ)=A(μ+ρ)/A(ρ) for every dominant integral μ, and the denominator is A(ρ)=eρ∏α>0(1−e−α)=∏α>0(eα/2−e−α/2), where the last equality follows from ∑α>0α/2=ρ (Highest weight of the dual representation, Highest-weight classification, The Weyl character formula).

Proof

1.1F1F2given

If λ+ρ is not regular, then by [F1] every Hi(X,Lλ) vanishes, so each character is 0 and the alternating sum is the finite sum of zero characters, hence 0 by [F2].

1.2F1F2F3givenalgebra

If λ+ρ is regular with Weyl element w, then by [F1] only Hℓ(w)(X,Lλ) is nonzero and it is isomorphic to L(w⋅λ)∗; the alternating sum over the finitely many cohomology groups therefore equals (−1)ℓ(w)ch L(w⋅λ)∗ by additivity [F2]. Since w⋅λ is dominant integral, [F3] identifies L(w⋅λ)∗≅L(ν) with ν=−w0(w⋅λ) dominant integral, and the Weyl character formula gives ch L(ν)=A(ν+ρ)/A(ρ)=A(−w0(w⋅λ)+ρ)/A(ρ).

2.1step 1.1step 1.2∎

Combining the singular case of step 1.1 and the regular case of step 1.2 gives the two asserted evaluations of the alternating sum of characters.

Remarks

The scaffold stated the regular case as (−1)ℓ(w)ch L(w⋅λ)=(−1)ℓ(w)A(w⋅λ+ρ)/A(ρ), which is false in rank at least two: for G=SL3 and the dominant weight λ=ω1 one has w=1, H0(X,Lω1)≅L(ω1)∗, and L(ω1)∗ has weights −ω1, ω1−ω2, ω2, so its character is e−ω1+eω1−ω2+eω2, whereas ch L(ω1)=eω1+eω2−ω1+e−ω2; W-invariance of characters does not identify the two, because it only permutes the weights of a fixed module. The corrected statement above uses ch L(w⋅λ)∗=A(−w0(w⋅λ)+ρ)/A(ρ), which coincides with A(w⋅λ+ρ)/A(ρ) exactly when −w0(w⋅λ)=w⋅λ.

Depends on

Used by

Dependency tree · two levels

49 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