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

Equivalences preserve small projective generators

Statement

Let F:C→D be an equivalence of locally small abelian categories, with C cocomplete and P an object of C. Then P is a small projective generator of C if and only if F(P) is a small projective generator of D; in that case D is cocomplete. No choice and no commutativity assumption are used.

Facts & Assumptions

Given: An equivalence F:C→D of locally small abelian categories with C cocomplete, and an object P of C.

[F1]

A small projective generator of a locally small cocomplete abelian category is an object that is projective, is a generator, and whose representable functor preserves every set-indexed coproduct (Small projective generators and progenerators).

[F2]

An equivalence consists of F and a quasi-inverse G with natural isomorphisms η:1C⇒GF and ε:FG⇒1D, and can be equipped as an adjoint equivalence satisfying the triangle identities εFc∘F(ηc)=1Fc and G(εd)∘ηGd=1Gd (Equivalence, quasi-inverse, and adjoint equivalence of categories, Every equivalence of categories can be equipped as an adjoint equivalence, Adjunction by unit, counit, and the triangle identities).

[F3]

An equivalence preserves and reflects every existing limit and colimit (Equivalences preserve, reflect, and create limits and colimits in the isomorphism-invariant sense).

[F5]

An object is projective exactly when every epimorphism onto it splits (Projective object characterisations).

[F6]

In a locally small abelian category satisfying AB3, an object is a generator exactly when its representable functor is faithful (The cancellation and epimorphism descriptions of a generator agree); AB3 is cocompleteness in this setting (The axioms AB3 and AB3*, Finite, small, and large limits and colimits; complete and cocomplete categories).

[F7]

Under an adjunction F⊣G between locally small categories the transposition Φc,d:D(Fc,d)→C(c,Gd), Φc,d(w)=G(w)∘ηc, is a natural bijection with inverse v↦εd∘F(v) (Adjuncts and transposition under an adjunction, Under local smallness, transposition gives the natural hom-set bijection, and conversely).

Proof

technique · direct
1.1F2F3F4F7given

(Set-up.) Equip F with the adjoint-equivalence data F⊣G, η, ε of [F2]; then F and G preserve and reflect all existing colimits by [F3] and preserve epimorphisms by [F4], and the transposition Φc,d of [F7] is a natural bijection for all c∈C, d∈D. The same properties hold for the equivalence G, whose quasi-inverse is F, with unit ε−1 and counit η−1, and with transposition C(Gd,c)≅D(d,Fc).

2.1F5step 1.1givenalgebra

(Forward: projectivity transfers.) Assume P is projective, let q:E↠M be an epimorphism in D and f:F(P)→M. Then G(q) is an epimorphism, and G(f)∘ηP:P→G(M) is a map, so by projectivity of P and [F5] there is s:P→G(E) with G(q)∘s=G(f)∘ηP. Put t:=εE∘F(s):F(P)→E. Using naturality of ε at f, naturality of η at s, and the triangle identity εF(P)∘F(ηP)=1F(P), one computes q∘t=εM∘F(G(q)∘s)=εM∘F(G(f)∘ηP)=f∘εF(P)∘F(ηP)=f. Hence every epimorphism onto F(P) splits, so F(P) is projective by [F5].

2.2F1F7step 1.1given

(Forward: coproduct preservation transfers.) Assume C(P,−) preserves set-indexed coproducts. For every set-indexed family (Yi) in D, the natural bijection [F7] and preservation of coproducts by G give natural bijections D(F(P),∐iYi)≅C(P,G(∐iYi))≅C(P,∐iG(Yi))≅⨁iC(P,G(Yi))≅⨁iD(F(P),Yi); all stages are natural in the family, so the canonical comparison ⨁iD(F(P),Yi)→D(F(P),∐iYi) is an isomorphism of abelian groups, since the adjoint transpositions are additive by [F4] and their formulas in [F7], which is exactly preservation of this coproduct.

2.3F6F7step 1.1given

(Forward: the generator condition transfers.) Assume C(P,−) is faithful, and let u≠v:X→Y in D. Since G is faithful (as part of the equivalence), G(u)≠G(v); by faithfulness of C(P,−) there is h:P→G(X) with G(u)∘h≠G(v)∘h. Let h♯:=εX∘F(h):F(P)→X be the transpose of h under [F7]. By the formula ΦP,Y(w)=G(w)∘ηP and naturality of η at h, ΦP,Y(u∘h♯)=G(u)∘G(εX)∘GF(h)∘ηP=G(u)∘G(εX)∘ηG(X)∘h=G(u)∘h, and likewise for v, using the triangle identity G(εX)∘ηG(X)=1G(X). Since ΦP,Y is injective, u∘h♯≠v∘h♯, so D(F(P),−) is faithful and F(P) is a generator by [F6].

2.4F2F3step 1.1given

(Forward: the target is cocomplete.) Let X:J→D be any small diagram and let (L,λ) be a colimiting cocone of the composite diagram G∘X in C, which exists because C is cocomplete; no choice is needed because the argument verifies any such cocone. Then F(L) with the cocone Fλ:FGX⇒ΔF(L) is a colimit of FGX by [F3], and the counit ε is a natural isomorphism FG⇒1D, so the legs F(λj)∘εX(j)−1 give a colimiting cocone of X with apex F(L). Hence every small diagram in D has a colimit, and D is cocomplete.

3.1F1F6step 2.1step 2.2step 2.3step 2.4

(Forward conclusion.) Under the assumption that P is a small projective generator of C, steps 2.1, 2.2 and 2.3 show that F(P) is projective, that D(F(P),−) preserves every set-indexed coproduct, and that it is faithful, while step 2.4 shows D is cocomplete; by [F1] and [F6] the object F(P) is a small projective generator of D.

4.1F1F5step 1.1step 3.1given

(Converse.) Assume D is cocomplete and Q:=F(P) is a small projective generator of D. The argument of steps 2.1-2.4 applies to the equivalence G:D→C, whose source D is now cocomplete, and shows that G(Q)=GF(P) is a small projective generator of C. The unit ηP:P→GF(P) is an isomorphism and induces a natural isomorphism C(GF(P),−)≅C(P,−), ψ↦ψ∘ηP; consequently faithfulness, preservation of coproducts, and the splitting characterization of projectivity transfer along it (for projectivity, transport a map P→M and its lift through ηP and ηP−1). Hence P is itself a small projective generator of C.

5.1step 2.1step 2.2step 2.3step 2.4step 3.1step 4.1∎

Steps 3.1 and 4.1 prove the two implications, and step 2.4 supplies the cocompleteness of D in the case where the properties hold; no commutativity of rings is involved and the only selections are the pointwise existentials supplied by the given lifting property and by cocompleteness, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

42 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