Alphabeta Math
TheoremStatement: 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.

Indecomposable tilting objects exist and are classified in parabolic category O

Statement

Assume the Axiom of Choice (The Axiom of Choice). Every label A in a genuine tableau parabolic block of The integral parabolic category-O blocks for higher-level Schur-Weyl duality has a unique indecomposable tilting object T(A) whose standard flag begins with M(A) once at the bottom and has all remaining labels B<A. Equivalently, T(A) has that maximal-label normalized standard flag and Ext⁡1(M(B),T(A))=0 for all B. Every tilting object is a finite direct sum of these, and their classes form a unitriangular Grothendieck basis. Restricted duality fixes T(A). For a finite lower ideal Γ containing A the corresponding partial tilting is the same ambient T(A), since all support labels are ≤A; compatible ideal systems therefore stabilize in each finite block, with flag-preserving inclusions. No uniqueness is claimed from a bottom-standard occurrence alone without indecomposability and maximal support. In the inline prinjectivity claim, P(A) is projective-injective (equivalently self-dual) exactly when A is standard; in that case P(A)=T(A↑) with the proved rectification label.

Facts & Assumptions

Given: A finite genuine tableau parabolic block with its generalized standards M(A), simples L(A), projectives P(A) and the filtered category of Standard- and costandard-filtered objects and tilting objects; the semi-regular duality Ψ and F=DΨ of Parabolic semi-regular duality and the reverse-column label map; the residue functors and their head/socle behavior of The residue translation functors give the integrable Fock-space action; the highest-component normalization of The highest weight Fock submodule carries the quantum-group global bases; the standard-monomial basis of Standard tableau monomials form a basis of the highest weight Fock submodule.

[F1]

Filtered categories (Standard- and costandard-filtered objects and tilting objects): the homological criterion, uniqueness of an indecomposable tilting object with bottom label A and maximal support, BGG reciprocity, restricted duality, closure under summands and lower-ideal invariance.

[F2]

Semi-regular duality (Parabolic semi-regular duality and the reverse-column label map): Ψ is an exact contravariant equivalence of opposite and target standard-flag categories, sends Δˉ(A) to Δ(A), and reverses the label order; DΨ is covariant and takes opposite standards to target costandards.

[F4]

Residue functors and labels (The residue translation functors give the integrable Fock-space action, Standard tableau monomials form a basis of the highest weight Fock submodule, The highest weight Fock submodule carries the quantum-group global bases): simple head/socle of residue translates, the projection kernel spanned by off-standard L-vectors, the straightening formula, and the normalization PA=saTA↑ at s=1.

[F5]

Axiom of Choice (The Axiom of Choice).

Proof

technique · direct
1.1F5F1F2F3algebra

Construction from actual exact sequences. Let Pˉ(A) be the labelled opposite projective cover. Its highest-weight sequence is 0→Kˉ(A)→Pˉ(A)→Δˉ(A)→0, with Kˉ(A) standard-filtered by labels strictly above A. Applying Ψ gives 0→M(A)→X(A)→ΨKˉ(A)→0, where X(A)=ΨPˉ(A) and the quotient has a finite standard flag with labels strictly below A. Its endomorphism algebra is the opposite of the local endomorphism algebra of Pˉ(A), so X(A) is indecomposable. For an arbitrary extension 0→X(A)→Z→M(B)→0, extension closure makes Z standard-filtered. Inverting Ψ turns this into an extension with source projective Pˉ(A) as quotient, which splits; exact equivalence transfers the splitting back. Hence Ext⁡1(M(B),X(A))=0 for every B. The proved homological criterion of [F1] gives a costandard flag of X(A), so it is the required actual tilting object with normalized bottom-standard inclusion.

2.1F1step 1.1

Uniqueness. Let T,T′ be two indecomposable tilting objects with M(A) once at the bottom and all other labels ≺A. Extending the common normalized bottom inclusion both ways uses Ext⁡1 vanishing against standard flags, and the resulting composites restrict to the identity on the bottom standard, hence are not nilpotent; finite-dimensional local End⁡ and Fitting's lemma force them to be isomorphisms. So T≅T′, and [F1] identifies its unique maximal support label as A.

3.1F1F3step 1.1step 2.1algebra

Every tilting is a sum of these. Let T≠0 be an arbitrary tilting object and let Γ be the lower ideal generated by its entire composition support. Choose one maximal support label A, which is maximal in Γ, and put m=[T:L(A)]≥1. All standard and costandard sections of T have labels in Γ, so it is tilting in that truncated highest-weight category. The proved maximal-standard trace in [F1] injects Δ(A)⊕m into T with standard-filtered quotient. Choose one copy i:Δ(A)↪T; its quotient is still standard-filtered, since the other m−1 copies and the trace quotient have such flags. Let j:Δ(A)↪X(A) be the actual normalized inclusion of step 1.1. Since X(A)/Δ(A) is standard-filtered and T is tilting, Ext⁡1(X(A)/Δ(A),T)=0 extends i to f:X(A)→T with fj=i. Similarly Ext⁡1(T/Δ(A),X(A))=0 extends j to g:T→X(A) with gi=j. The composite gf fixes the nonzero bottom standard of the indecomposable X(A), so it is invertible by the finite local-End/Fitting argument. Hence f splits with retraction (gf)−1g, and T≅X(A)⊕T′. The complement is tilting by summand closure and has strictly smaller length; induction proves the stated finite decomposition. Incomparable maximal support labels and multiplicities m>1 are both allowed: no normalized flag of the entire T was assumed.

3.2F1step 1.1step 2.1

Duality, ideals and Grothendieck basis. Restricted duality makes DT(A) an indecomposable tilting object with the same composition support ≤A and [DT(A):L(A)]=1. In the lower highest-weight ideal of labels ≤A, the maximal-standard trace proved in [F1] gives an inclusion M(A)↪DT(A) with standard-filtered quotient of strictly smaller labels, since its multiplicity space has dimension one. This supplies an actual normalized standard flag, so uniqueness identifies DT(A)≅T(A). If Γ is a lower ideal containing A, every support label of T(A) lies in Γ, so T(A) computed in the ambient block lies in the Serre subcategory of Γ and coincides with the partial tilting there; the classes [T(A)] are unitriangular in the standard basis by the flag multiplicities, hence form a Grothendieck basis.

4.1F4step 3.1

The projection kernel and standard embeddings. The projection π of [F4] has kernel spanned by the L-vectors off StdΛ and is U-stable; the residue functors have nonnegative composition coefficients, so iterating them on an off-standard simple never produces a standard composition factor. For this embedding argument, enlarge a finite upper alphabet if necessary while keeping the lower endpoint and the Levi column heights fixed. The blocks of the original labels are unchanged, because their entry multisets are unchanged; the established Fock projection and its off-standard kernel apply on the enlarged alphabet, where the standard predicate for those labels is the same. Every generalized standard M(B) then embeds into an iterated e-word applied to an irreducible standard M(C): add successively huge offsets to the later columns so that all later entries lie above the earlier ones, making C the unique minimum in its fixed-multiset tableau order and hence M(C)=L(C) simple; then lower the later-column entries back, column by column and bottom to top, with the explicit residue word. A later column stays above the active residues, so a wrong move can only occur in an earlier column and strictly increases an earlier prefix weight; hence B is the unique maximal final standard section and occurs once, and the canonical maximal trace embeds M(B) at the bottom. If L(A) embedded into M(B) with A off standard, adjunction would give the standard L(C) as a quotient of an f-word applied to L(A), impossible by kernel stability.

5.1F3F4step 4.1

Converse and prinjectivity. Conversely every standard label is reached from the ground simple projective by the crystal f-word, and the simple-head clause of [F4] makes P(A) a summand of that translated projective-injective, hence injective; projectivity of P(A) is by definition. A projective-injective indecomposable is self-dual: DP(A)=P(B) with [P(A)]=[P(B)] because simple classes are duality-fixed and the Cartan matrix is DDt with unitriangular invertible D, so A=B. A self-dual P(A) has its head in its socle, and its standard flag embeds that simple into a standard section; conversely if A is standard then P(A) is projective-injective by the previous sentence. BGG reciprocity and Parabolic Kazhdan-Lusztig polynomials give the dual-canonical transition matrix identify the standard coefficients of [P(A)] with the transpose composition matrix defining the quasi-canonical vector PA at s=1. Thus the normalization PA=saTA↑ of [F4] identifies that actual projective class with the source canonical vector at s=1, whose unitriangular monomial expansion has unique maximal label A↑. Since P(A) is an indecomposable tilting object its unique maximal standard label identifies it as T(A↑).

6.1step 1.1step 2.1step 3.1step 3.2step 4.1step 5.1∎

Conclusion. Every label has a unique normalized indecomposable tilting object with the stated maximal-support flag, every tilting is a finite sum of these, restricted duality fixes them, lower ideals stabilize the same objects, and P(A) is projective-injective exactly for standard A, in which case P(A)=T(A↑); no Irving criterion or future Schur-theoretic input is used.

Depends on

Used by

Dependency tree · two levels

97 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