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.
A Verma embedding implies strong linkage
Statement
Assume the Axiom of Choice.
An embedding implies .
Facts & Assumptions
Given: The Axiom of Choice (The Axiom of Choice), injectivity A nonzero homomorphism between Verma modules is injective, finite length of category objects Every object of O has finite length, the unique simple Verma quotient A Verma module has a unique simple quotient, and Choice-qualified strong linkage The strong linkage principle for Verma modules.
Proof
The image of the embedding is a submodule isomorphic to , so its simple quotient is a subquotient of . Under the stated Choice premise has finite length; refining a composition series through this submodule and its maximal proper submodule shows that this simple subquotient is a composition factor.
Applying the strong linkage principle to that factor gives .
Depends on
Used by
Dependency tree · two levels
18 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
- Pavel Etingof, Representations of Lie Groups, Corollary 20.14 (standard reference, not scraped)