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.

Direct summands of Verma-filtered objects are Verma-filtered

Statement

Assume the Axiom of Choice (The Axiom of Choice). If X=X1⊕X2 is a direct sum decomposition in O and X is Verma-filtered (Finite Verma flags and their multiplicities), then both X1 and X2 are Verma-filtered.

Facts & Assumptions

Given: The Axiom of Choice, a Verma-filtered object X=X1⊕X2 with a fixed Verma flag of length m, and an enumeration of the two summands.

[F1]

If X=X1⊕X2 and Δ(ν)↪X1 is a subobject, then X/Δ(ν)≅(X1/Δ(ν))⊕X2. The weights of X are the union of the weights of the factors of any Verma flag, and a maximal weight of X is the label of some factor (Finite Verma flags and their multiplicities).

[F2]

If ν is maximal among the weights of a Verma-filtered object X with a flag of length m and v≠0 is a vector of weight ν, then v is a highest-weight vector, the induced homomorphism Δ(ν)→X is injective, and the cokernel has a Verma flag of length m−1 (Peeling a maximal-weight Verma from a standard filtration).

[F3]

If 0→A→E→B→0 is exact and A and B are Verma-filtered, then E is Verma-filtered: concatenating a flag of A with the preimages of a flag of B gives a flag of E. [F1]

Proof

technique · induction on the flag length, peeling a maximal-weight Verma that lies in one of the two summands
1.1F1base

If m=0 then X=0, so X1=X2=0 and both summands are Verma-filtered with the empty flag.

1.2F1givenih

Let m≥1. The finite set of labels of the fixed flag has a maximal element ν; every weight of X lies below one of those labels, so a weight strictly above ν would force a flag label strictly above it. Thus ν is a maximal element of the set of weights of X, with no greatest-label assumption. By [F1] the weight ν is the label of some factor of the fixed flag: it lies in μi−Q+ for a factor Δ(μi), so ν≤μi, while μi is a weight of X and ν is maximal, so comparability ν≤μi forces μi=ν. Choose a nonzero vector v of weight ν; writing v=v1+v2 with vi∈Xi, some vi≠0 is again a maximal-weight vector, and after exchanging the names of the summands we may assume v∈X1. Assume as induction hypothesis that every Verma-filtered direct sum with a flag of length m−1 has Verma-filtered summands.

2.1F1F2F3step 1.1step 1.2

By [F2] the induced homomorphism Δ(ν)→X is injective with image in X1 (its image is the submodule generated by v) and cokernel Verma-filtered with a flag of length m−1. Since Δ(ν)⊆X1, [F1] gives X/Δ(ν)≅(X1/Δ(ν))⊕X2; the induction hypothesis applies to this Verma-filtered direct sum of flag length m−1, so X2 and X1/Δ(ν) are Verma-filtered. From the exact sequence 0→Δ(ν)→X1→X1/Δ(ν)→0, both ends Verma-filtered, [F3] makes X1 Verma-filtered.

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

By induction on m, steps 1.1 and 2.1 show that whenever X=X1⊕X2 is Verma-filtered, both summands are Verma-filtered.

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