Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Fitting decomposition in a finite-length abelian category

Statement

Let A be an abelian category in which every object has finite length, and define an object to be indecomposable when it is nonzero and every decomposition X≅Y⊕Z has Y=0 or Z=0. Then:

  1. every object of A is a finite direct sum of indecomposable objects;
  2. the endomorphism ring of an indecomposable object is local, and for an endomorphism f of an indecomposable object either f is an isomorphism or f is nilpotent;
  3. the decomposition is unique up to isomorphism and permutation of the summands;
  4. an indecomposable projective object P of A has a unique maximal proper subobject J(P), its quotient P/J(P) is simple, and P is a projective cover of P/J(P) (Projective object, An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map; projectivity here is relative to A. In a full subcategory closed under submodules, essentiality is the superfluous-kernel condition of the cited module definition; projectivity in the ambient module category is not asserted).

Facts & Assumptions

Given: An abelian category A in which every object has a finite composition series, and the notion of an indecomposable object as in the Statement.

[F1]

Every object X has a composition series, and by Jordan-Hölder the number of factors ℓ(X) is independent of the series; ℓ is additive on short exact sequences and strictly increases under proper inclusions, because a nonzero quotient has a composition factor. Hence every chain of subobjects of X stabilizes and every nonzero object has a maximal proper subobject (Composition series and composition factors of an object, Jordan-Holder theorem in an abelian category).

[F2]

If A,B⊆X are subobjects with A∩B=0 and A+B=X, the canonical morphism A⊕B→X is an isomorphism; and X=0 exactly when id⁡X=0.

[F3]

An object P is projective exactly when Hom⁡(P,−) is exact, equivalently when every epimorphism onto P splits, equivalently when every epimorphism E↠M induces a surjection Hom⁡(P,E)→Hom⁡(P,M) (Projective object, Projective object characterisations). An epimorphism π:P→M is essential when N+ker⁡π=P with N⊆P forces N=P, and a projective cover of M is an essential epimorphism from a projective object (An essential epimorphism is a surjection with superfluous kernel, and a projective cover is a projective source with such a map).

Proof

technique · direct: Fitting decomposition for the stable powers of an endomorphism, local endomorphism rings, exchange and cancellation for the Krull-Schmidt uniqueness, and the unique maximal subobject of an indecomposable projective
1.1F1given

A proper inclusion A⊊B of subobjects of a finite-length object has ℓ(A)<ℓ(B), because B/A≠0 contributes at least one composition factor; consequently any ascending chain of subobjects stabilizes, and a nonzero object has a proper subobject of maximal length, hence a maximal proper subobject.

1.2F1F2given

Every object X is a finite direct sum of indecomposable objects, by induction on ℓ(X): for X=0 take the empty sum; if X≠0 is indecomposable there is nothing to prove; otherwise X≅Y⊕Z with Y,Z≠0, and ℓ(Y),ℓ(Z)<ℓ(X), so the induction hypothesis applies to Y and Z.

2.1F1F2step 1.1algebra

For an endomorphism f:X→X, the image and kernel chains stabilize by [F1]. Choose N with im⁡fN=im⁡f2N and ker⁡fN=ker⁡f2N, and put I=im⁡fN, K=ker⁡fN. The restriction fN∣I:I→I is epic by image stabilization, hence is an isomorphism: length additivity makes its kernel zero. If p:X↠I is the image factorization of fN, then (fN∣I)−1p:X→I retracts the inclusion I↪X and has kernel K. The split exact sequence therefore gives X≅I⊕K.

3.1F1step 2.1algebra

If X is indecomposable, step 2.1 forces I=0 or K=0. The first case gives fN=0. In the second case fN is monic; length additivity makes its cokernel zero, so fN is an isomorphism. Since f commutes with fN and its inverse, fN−1(fN)−1 is an inverse of f. Thus every endomorphism of X is either invertible or nilpotent.

4.1F2step 3.1algebra

Let X be indecomposable and f,g∈End⁡(X) with f+g=u an isomorphism. If neither f nor g is an isomorphism, both are nilpotent by step 3.1; then a:=u−1f and b:=u−1g satisfy a+b=id⁡X and are non-units, hence nilpotent, and a=id⁡X−b gives ab=b−b2=ba, so the commuting nilpotents a,b have nilpotent sum: id⁡X=a+b is nilpotent, forcing id⁡X=0 and X=0 by [F2], contrary to indecomposability. Hence f or g is an isomorphism.

5.1step 4.1algebra

More generally, if f1+⋯+fk=id⁡X with X indecomposable, then some fi is an isomorphism: induct on k, the cases k=1 and k=2 being trivial and step 4.1; for k≥3 put g=f2+⋯+fk, so that f1+g=id⁡X, and if f1 is not an isomorphism then g is an isomorphism by step 4.1, and g−1f2+⋯+g−1fk=id⁡X has k−1 terms, so some g−1fi is an isomorphism by induction and then fi=g(g−1fi) is an isomorphism. Consequently End⁡(X) is local: in a ring R, locality is equivalent to the criterion that for every a∈R either a or 1−a is a unit, and here a+(1−a)=id⁡X is the identity, so the two-term case applies. Also, a nonzero idempotent in a local ring is the identity.

6.1F2step 5.1algebra

Let X=X1⊕A=Y1⊕⋯⊕Ym with X1,Yj indecomposable, and let aj:Yj→X1, bj:X1→Yj be the composites of the inclusions and projections. Then ∑jajbj=id⁡X1; by step 5.1 some aj0bj0 is an isomorphism, and after relabelling j0=1 and setting β:=a1b1 we obtain ε:=b1β−1a1∈End⁡(Y1) with ε2=b1β−1(a1b1)β−1a1=ε, so ε is an idempotent; it is nonzero because β−1a1 is a left inverse of b1 and X1≠0, and its image is b1(X1). By the last sentence of step 5.1, ε=id⁡Y1; hence β−1a1 and b1 are mutually inverse isomorphisms X1≅Y1.

6.2F1F3step 1.1step 5.1

Let P be an indecomposable projective object and let Q,Q′⊆P be proper subobjects with Q+Q′=P. The addition morphism Q⊕Q′→P is an epimorphism, so by [F3] the identity of P lifts to h:P→Q⊕Q′; writing h=(h1,h2) and φ:=iQh1, ψ:=iQ′h2 in End⁡(P), one has φ+ψ=id⁡P, so φ or ψ is an isomorphism by the two-term case of step 5.1. If φ is an isomorphism then iQ is a split monomorphism and an epimorphism, hence an isomorphism Q≅P, contradicting the strictness ℓ(Q)<ℓ(P) for the proper inclusion Q⊊P from step 1.1; the same argument applies to ψ. Hence proper subobjects of P have proper sum. Now choose a proper subobject M⊆P of maximal length, which exists by step 1.1. For any proper Q the sum M+Q is proper, so ℓ(M+Q)≤ℓ(M), while M⊆M+Q gives ℓ(M)≤ℓ(M+Q); hence M=M+Q and Q⊆M. Therefore M is the unique maximal proper subobject J(P), and P/J(P) is simple, since a proper subobject of the quotient pulls back to a proper subobject of P contained in J(P).

7.1F2step 6.1algebra

Keep the notation of step 6.1, put B=⨁j≥2Yj, and use the isomorphism b1:X1→Y1 to define Θ=iX1b1−1pY1+iBpB∈End⁡(X). Relative to X=Y1⊕B, its matrix is (10w1), where w=pBiX1b1−1:Y1→B, because pY1iX1=b1. Thus Θ is invertible with inverse (10−w1), sends Y1 onto X1, and fixes B. Therefore X=X1⊕B. Taking the quotient by X1 in this decomposition and in X=X1⊕A gives A≅X/X1≅B, establishing cancellation.

8.1step 6.1step 7.1step 1.2

Let X=X1⊕⋯⊕Xn=Y1⊕⋯⊕Ym with all Xi,Yj indecomposable, and induct on n. For n=0 we have X=0, so m=0 because the Yj are nonzero. For n≥1, steps 6.1 and 7.1 applied with A=⨁i≥2Xi provide j0 with X1≅Yj0 and ⨁i≥2Xi≅⨁j≠j0Yj; the left-hand side is a sum of n−1 indecomposables and the right-hand side of m−1, so the induction hypothesis gives n−1=m−1 and a bijection matching the remaining factors up to isomorphism, and X1≅Yj0 completes the correspondence.

9.1F3step 1.2step 3.1step 5.1step 6.2step 8.1∎

Collecting the results: step 1.2 gives the finite decomposition into indecomposables, step 5.1 the local endomorphism ring together with the finite-sum criterion, step 3.1 the dichotomy isomorphism-or-nilpotent, step 8.1 the uniqueness up to isomorphism and permutation, and step 6.2 the unique maximal proper subobject J(P) of an indecomposable projective P with simple quotient. Moreover the canonical epimorphism π:P→P/J(P) is essential: if N⊆P satisfies N+J(P)=P and N were proper, then N⊆J(P) by step 6.2 and P=N+J(P)=J(P), a contradiction; hence N=P. With P projective, (P,π) is a projective cover of the simple object P/J(P) in the sense of [F3].

Depends on

Used by

Dependency tree · two levels

14 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