Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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 Kostant partition function

Definition

Let Φ+ be a positive system for the finite root system of Finite Weyl root system, lattice and chamber conventions with simple roots α1,…,αr and positive cone Q+. For β∈h∗ define P(β) to be the number of families (nα)α∈Φ+∈Z≥0Φ+ with ∑α∈Φ+nαα=β. This number is finite: writing an element of Q in the simple-root basis as β=∑i=1rmiαi by Simple roots form a signed integral basis, the weight β can be represented only if every mi≥0, and then each nα is bounded by the height ht⁡(β)=∑imi extending the root height of Height and highest root to Q by the same coordinate sum, because every positive root has height at least 1; so only finitely many families occur, and P(β)=0 for β∉Q+ while P(0)=1 (the all-zero family, empty when Φ+=∅).

Equivalently, P(β) is the coefficient of e−β in the finite product of geometric series ∏α∈Φ+∑k≥0e−kα=∏α∈Φ+(1−e−α)−1 of Geometric series are invertible in the completed character ring: a family (nα) with ∑αnαα=β contributes one monomial e−β, and a family representing β has nα≤ht⁡(β) and hence finite support, so ∏α∈Φ+(1−e−α)−1=∑β∈Q+P(β)e−β in the completed character ring R of The completed formal character ring.

Depends on

Used by

Dependency tree · two levels

13 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