Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Omitting the rho shift breaks Kostant's formula

Statement refuted

False claim. In Kostant's weight multiplicity formula the second shift can be omitted, that is, the multiplicity of μ as a weight of L(λ) equals m^λ(μ):=∑w∈W(−1)ℓ(w)P(w(λ+ρ)−μ) as well.

Facts & Assumptions

Given: The Axiom of Choice, g=sl2 with positive root α, fundamental weight ω=α/2, Weyl group W={1,s}, Weyl vector ρ=ω, the weight λ=2ω, the weight μ=0, and the Kostant partition function P.

[A1]

The Axiom of Choice is assumed; it enters through the Kostant formula used in the counterexample (The Axiom of Choice).

[F1]

For sl2 the positive root satisfies α=2ω and sω=−ω, so ρ=α/2=ω and λ+ρ=3ω (Finite Weyl root system, lattice and chamber conventions, Fundamental weights, The Weyl vector rho for a chosen positive system).

[F2]

L(2ω) is the irreducible three-dimensional sl2-module whose weights are 2ω,0,−2ω, each with multiplicity one (Finite-dimensional representations of sl_2, Integral, dominant, and strictly dominant weights).

[F3]

P(β) counts the families (nα) with nαα=β, so P(α)=P(2ω)=1, while P(−4ω)=P(3ω)=0 because −4ω and 3ω=32α are not nonnegative integral multiples of the simple root α; the multiplicity formula of the Statement is mλ(μ)=∑w∈W(−1)ℓ(w)P(w(λ+ρ)−(μ+ρ)) (The Kostant partition function, Kostant's weight multiplicity formula).

Counterexample

technique · direct
1.1F1F2F3A1

The correct formula of [F3] gives m2ω(0)=P(3ω−ω)−P(−3ω−ω)=P(2ω)−P(−4ω)=1−0=1, in agreement with the weight string of [F2].

1.2F1F3

The modified expression omitting the shift μ↦μ+ρ gives m^2ω(0)=P(3ω−0)−P(−3ω−0)=P(3ω)−P(−3ω)=0−0=0, because 3ω=32α and −3ω are not nonnegative integral multiples of α.

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 exhibit a weight, namely μ=0 in L(2ω), whose true multiplicity is 1 while the modified formula returns 0; hence the modified formula is false, and the shift μ↦μ+ρ inside the partition argument is not a convention that can be dropped.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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