Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Hom from a projective counts simple composition factors

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let λ be a weight and let P(λ) be the projective cover of L(λ) produced by Category O has enough projectives. For every finite-length object X of O, dim⁡CHom⁡O(P(λ),X)=[X:L(λ)], the multiplicity of L(λ) in a composition series of X (Composition series and composition factors of an object).

Facts & Assumptions

Given: The Axiom of Choice, a weight λ, the projective cover P(λ)↠L(λ) of the previous theorem, and a finite-length object X∈O.

[F1]

P(λ) is projective, is indecomposable with local endomorphism ring, has a unique maximal proper subobject J(P(λ)) with P(λ)/J(P(λ)) simple, and the canonical epimorphism onto the head is essential with head L(λ). The functor Hom⁡(P(λ),−) is exact (Category O has enough projectives, Projective covers in O are indecomposable and unique, Projective object characterisations).

[F2]

For a simple object L(μ) of O one has Hom⁡O(P(λ),L(μ))≅C if μ=λ and 0 if μ≠λ: a nonzero morphism P(λ)→L(μ) is an epimorphism, so L(μ) is the head of P(λ) and μ=λ by [F1]; and for μ=λ every nonzero morphism has kernel a maximal proper subobject, hence equal to J(P(λ)) by uniqueness, so all morphisms factor through the fixed quotient L(λ). Each endomorphism of this highest-weight simple acts by a scalar on its one-dimensional highest line, which generates the module, so End⁡(L(λ))=C. Simple labels are distinct by The simple objects of O. [F1]

[F3]

Every object of O has a finite composition series, and Jordan–Hölder makes its simple multiplicities independent of the series (Composition series and composition factors of an object, Every object of O has finite length, Jordan-Holder theorem in an abelian category). For 0→A→X→B→0, concatenate a composition series of A with the inverse images of a composition series of B: the resulting series of X has precisely their combined factors, proving additivity. The empty series of zero has all multiplicities zero.

Proof

technique · induction on the length of a composition series, using exactness of $\operatorname{Hom}(P(\lambda),-)$ and additivity of multiplicities
1.1F1F3given

Since P(λ) is projective, the functor Hom⁡O(P(λ),−) is exact; in particular, for a short exact sequence 0→A→X→B→0 with all terms of finite length if the two outer Hom spaces are finite-dimensional, so is the middle one and dim⁡Hom⁡(P(λ),X)=dim⁡Hom⁡(P(λ),A)+dim⁡Hom⁡(P(λ),B) and [X:L(λ)]=[A:L(λ)]+[B:L(λ)] by [F3].

1.2F2F3base

If X=0 both sides are zero, and if X is simple then X≅L(μ) for some μ and dim⁡Hom⁡(P(λ),X)=[X:L(λ)] by [F2]; this is the base of the induction on the composition length.

2.1F1F2F3step 1.1step 1.2ihalgebra

Now let X have finite length and induct on the length of a composition series 0=X0⊆X1⊆⋯⊆Xn=X. Assume as induction hypothesis that the identity holds for finite-length objects of smaller length. For n=0 both sides are zero. For n≥1 the exact sequence 0→Xn−1→Xn→Xn/Xn−1→0 has simple quotient Xn/Xn−1, and steps 1.1 and 1.2 with the induction hypothesis give dim⁡Hom⁡(P(λ),Xn)=dim⁡Hom⁡(P(λ),Xn−1)+dim⁡Hom⁡(P(λ),Xn/Xn−1)=[Xn−1:L(λ)]+[Xn/Xn−1:L(λ)]=[Xn:L(λ)].

3.1step 1.2step 2.1discharge-induction: step 2.1∎

By induction on the length of a composition series, step 2.1 proves dim⁡Hom⁡O(P(λ),X)=[X:L(λ)] for every finite-length X.

Depends on

Used by

Dependency tree · two levels

27 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