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

Standard-costandard Hom and Ext-one orthogonality

Statement

Assume the Axiom of Choice (The Axiom of Choice). For all weights μ and ν one has dim⁡CHom⁡O(Δ(μ),∇(ν))=1 if μ=ν,dim⁡CHom⁡O(Δ(μ),∇(ν))=0 if μ≠ν, and Ext⁡O1(Δ(μ),∇(ν))=0. Here Δ(ν)=M(ν) and ∇(ν)=D(M(ν)) are the standard and costandard objects of Standard and costandard objects, and Ext⁡1 is the derived Ext over the abelian category O, identified with classes of extensions by the Yoneda theorem.

Facts & Assumptions

Given: The Axiom of Choice, weights μ,ν, and the standard and costandard objects Δ(μ)=M(μ), ∇(ν)=D(M(ν)) of O.

[F1]

The negative-root ordered monomials on vλ form a basis of M(λ), its weights are exactly λ−Q+, its weight spaces are finite-dimensional and M(λ)λ=Cvλ; consequently M(λ)=n−M(λ)⊕Cvλ, and a b-linear map Cλ→V into a g-module V sending 1 to an n+-fixed vector of weight λ extends uniquely to a g-linear map M(λ)→V (Finite semisimple PBW and highest-weight construction, Weights of a Verma module lie below lambda, The universal property of Verma modules, Verma modules).

[F2]

Restricted duality D is an exact contravariant involution of O with D(M(λ))=∇(λ) and D(∇(λ))=M(λ), preserving weight-space dimensions and satisfying D(M)μ=Mμ∗ with action (xφ)(m)=φ(τ(x)m) for the Chevalley anti-involution τ (Restricted Chevalley dual, Restricted duality is exact and involutive on O, Chevalley-contravariant forms); τ(n+)=n− because τ exchanges the root spaces gα and g−α (Restricted self-duality of simple highest-weight modules).

[F3]

Category O has enough projectives (Category O has enough projectives). Applying [F2] to a projective epimorphism onto D(X) gives a monomorphism X↪D(P) with injective target, so it also has enough injectives. Finitely generated U(g)-modules have a set of representatives (quotients of the modules U(g)n). Work on a set-sized skeleton of O. Under AC, choose projective and injective resolutions on all its objects by successively covering kernels and embedding cokernels. Canonical comparison makes the resulting Ext independent of the chosen representatives. Thus the supplied resolution hypotheses of The balanced Ext bifunctor hold, and extensions form a set up to equivalence. AC also implies Dependent Choice by choosing successors of a serial relation. The Yoneda comparison therefore identifies Ext⁡1(Δ(μ),∇(ν)) with extensions 0→∇(ν)→N→Δ(μ)→0 (An extension of an object by an object in an abelian category, Yoneda Ext one is naturally isomorphic to derived Ext one).

[F4]

For weights, μ≤ν means ν−μ∈Q+; this is a partial order, the strict part ν−μ∈Q+∖{0} is transitive, and a sum of the form μ<γ≤ν therefore implies μ<ν.

Proof

technique · direct: count the $\mathfrak n^+$-fixed weight vectors of a costandard object, then split every extension by a weight argument, dualizing in the remaining case
1.1F1F2given

By [F1] a homomorphism Δ(μ)→∇(ν) corresponds to an n+-fixed vector of weight μ in ∇(ν), and by [F2] the space ∇(ν)μ is (M(ν)μ)∗, a functional being extended by zero off weight μ, with (xψ)(m)=ψ(τ(x)m); the fixed condition therefore says exactly that ψ annihilates τ(n+)M(ν)=n−M(ν). By [F1] one has M(ν)=n−M(ν)⊕Cvν, so a functional supported in weight μ and vanishing on n−M(ν) is zero when μ≠ν (its weight space lies in n−M(ν)) and is determined by an arbitrary value on Cvν when μ=ν; hence the Hom space has dimension 1 for μ=ν and 0 otherwise.

1.2F1F3F4algebra

Let 0→∇(ν)→N→Δ(μ)→0 be an extension and assume ν−μ∉Q+∖{0}; pull the sequence back along the b-linear map Cμ→Δ(μ), 1↦vμ, to obtain the b-exact sequence 0→∇(ν)→N′→Cμ→0 with N′=N×Δ(μ)Cμ. A g-splitting of the original sequence restricts to a b-splitting of the pulled-back sequence, and conversely a b-splitting Cμ→N′, composed with N′→N, is a b-map Cμ→N whose image is an n+-fixed vector of weight μ, so it extends to a g-map Δ(μ)→N by [F1], and the composite Δ(μ)→N→Δ(μ) is a g-endomorphism of Δ(μ) sending vμ to vμ, hence the identity; so the original sequence splits exactly when the pulled-back one does. The weights of N′ are those of ∇(ν), namely ν−Q+, together with μ; if a weight γ of ∇(ν) were strictly above μ, then μ<γ≤ν, so μ<ν by [F4], contrary to the case assumption, and no weight of N′ is strictly above μ. The quotient map N′→Cμ is surjective in weight μ, so choose a lift v of its basis vector that is a μ-weight vector. For x∈n+ nonzero of weight α∈Q+∖{0} the vector xv, if nonzero, would be a weight vector of weight μ+α>μ in N′, which is impossible; hence v is n+-fixed and the pulled-back sequence splits, so the original extension splits.

2.1F2step 1.2algebra

It remains to treat the case ν−μ∈Q+∖{0}, i.e. μ<ν. Applying the exact contravariant involution D of [F2] to the extension 0→∇(ν)→N→Δ(μ)→0 gives the extension 0→D(Δ(μ))=∇(μ)→D(N)→D(∇(ν))=Δ(ν)→0, in which the pair of weights is (ν,μ); since the strict order is transitive and μ<ν, antisymmetry gives μ−ν∉Q+∖{0} for the reversed pair, so step 1.2 shows that the dual extension splits. Applying the involution D again, and using D2≅id⁡ and exactness, the original extension splits.

3.1F3step 1.1step 1.2step 2.1∎

Every pair of weights satisfies ν−μ∉Q+∖{0} or μ<ν, so steps 1.2 and 2.1 show that every extension of Δ(μ) by ∇(ν) splits; by the Yoneda identification of [F3] this is exactly Ext⁡O1(Δ(μ),∇(ν))=0. Together with the Hom computation of step 1.1 this proves both assertions of the statement.

Depends on

Used by

Dependency tree · two levels

49 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