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 single-wall tensor-weight exclusion lemma
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a single-wall translation datum as in Dot-Weyl facets and single-wall translation data, with translating weight , wall reflection , and . Then for all and every weight of : if then and .
Equivalently, for every the tensor has exactly one standard factor whose central character is that of , namely , and its multiplicity in the Verma flag computed by Finite-dimensional tensoring preserves Verma flags is one: the multiplicity is nonzero, among labels in the dot orbit of , only for , where it equals one.
Facts & Assumptions
Given: The Axiom of Choice and a single-wall translation datum with translating weight , wall reflection , and ; write and .
The datum gives integral dot-antidominant with dot-regular, so is regular for the linear action and is fixed exactly by ; hence is dominant regular and is dominant, and . The translating weight is the unique dominant weight of the linear orbit , and (Dot-Weyl facets and single-wall translation data, Integral, dominant, and strictly dominant weights, Finite Weyl closed chambers and stabilizers).
Every weight of satisfies , with equality exactly when , and every weight of occurs in with multiplicity one (Weights of a finite-dimensional simple module lie in the norm ball, Finite-dimensional simple modules are classified by dominant highest weights).
For dominant in the real span of the roots one has for every , with equality exactly when (A dominant vector minimises its distance to a dominant weight).
Modulo the identification of with and of weight spaces, the tensor has a finite Verma flag with multiplicities , and for (Finite-dimensional tensoring preserves Verma flags, Finite semisimple PBW and highest-weight construction).
Two weights have the same central character exactly when they lie in one dot-Weyl orbit (Central characters are dot-Weyl orbits).
Proof
Let and let be a weight of with . Since , setting gives , that is, .
By [F2] one has , and -invariance of the form gives , so the identity of step 1.1 yields . On the other hand [F3] applied to the dominant vectors and (dominant and regular by [F1]) gives .
The two inequalities of step 2.1 are equalities, so the equality case of [F3] applies: with by [F1], that is, , so . Regularity of then forces : from we get , and from directly . Both and fix , hence and . Moreover . Finally and , so by [F2] the weight occurs in with multiplicity one.
For the reformulation, fix and let be a weight in the dot orbit of , so for some and has the central character of by [F5]. If , then is a weight of with , so step 3.1 gives and ; conversely . Hence among labels in the dot orbit of only occurs, with multiplicity one, in the Verma flag of supplied by [F4].
Steps 3.1 and 4.1 prove both formulations: the tensor-weight identity forces and with multiplicity one, and the only standard factor of with central character is , once.
Depends on
- Central characters are dot-Weyl orbits
- The Axiom of Choice
- Dot-Weyl facets and single-wall translation data
- Integral, dominant, and strictly dominant weights
- A dominant vector minimises its distance to a dominant weight
- Finite semisimple PBW and highest-weight construction
- Finite Weyl closed chambers and stabilizers
- Finite-dimensional tensoring preserves Verma flags
- Weights of a finite-dimensional simple module lie in the norm ball
- Finite-dimensional simple modules are classified by dominant highest weights
Used by
Dependency tree · two levels
39 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
- James E. Humphreys, Representations of Semisimple Lie Algebras in the BGG Category O, Sec. 7.5 Key Lemma (standard reference, not scraped)
- Lin Chen, lecture notes (Spring 2024), Lecture 9, Theorem 3.12 and its proof (standard reference, not scraped)
- Pavel Etingof, Representations of Lie Groups (18.757, Fall 2023), Theorem 24.1 and Lemma 23.4 (standard reference, not scraped)