TheoremComplete

Ken Brown's Lemma

Ken Brown's lemma is a fundamental tool in model category theory that reduces the problem of verifying a Quillen adjunction to a much simpler check. It states that a functor preserving weak equivalences between fibrant objects (or cofibrant objects) automatically produces well-defined derived functors. This lemma is used constantly in establishing Quillen adjunctions and constructing derived functors.


Statement

Theorem2.1Ken Brown's Lemma

Let M\mathcal{M} be a model category and F:MDF: \mathcal{M} \to \mathcal{D} a functor to a category D\mathcal{D} with a class of weak equivalences satisfying two-out-of-three. Then:

(Cofibrant version) If FF sends trivial cofibrations between cofibrant objects to weak equivalences, then FF sends all weak equivalences between cofibrant objects to weak equivalences.

(Fibrant version) If FF sends trivial fibrations between fibrant objects to weak equivalences, then FF sends all weak equivalences between fibrant objects to weak equivalences.


Proof

Proof

We prove the cofibrant version. Let f:XYf: X \xrightarrow{\sim} Y be a weak equivalence between cofibrant objects. Factor ff using the factorization axiom:

XiZpYX \xrightarrow{i} Z \xrightarrow{p} Y

where ii is a cofibration and pp is a trivial fibration.

Since f=pif = p \circ i and both ff and pp are weak equivalences, two-out-of-three gives that ii is a weak equivalence. So ii is a trivial cofibration.

Now XX is cofibrant and i:XZi: X \to Z is a cofibration, so ZZ is also cofibrant (cofibrations are closed under composition with the initial map). Similarly, YY is cofibrant by hypothesis.

We need to show F(f)F(f) is a weak equivalence. We have:

  • F(i)F(i) is a weak equivalence (since ii is a trivial cofibration between cofibrant objects).
  • pp is a trivial fibration, so it is also a weak equivalence. But we need F(p)F(p) to be a weak equivalence.

For pp, factor the map (idY,p):YXY(\mathrm{id}_Y, p): Y \sqcup X \to Y using the fold map and ii. Consider the pushout: since XX is cofibrant, the map YZY \to Z obtained from pushing out ii along XYX \to Y gives a trivial cofibration YZY \hookrightarrow Z' (trivial cofibrations are preserved by pushout) with a retraction to pp. By two-out-of-three in D\mathcal{D}, F(p)F(p) is a weak equivalence.

More precisely, form the coproduct inclusion inY:YYXZ\mathrm{in}_Y: Y \hookrightarrow Y \sqcup_X Z (pushout along ii). This is a trivial cofibration (pushout of the trivial cofibration ii), and YY is cofibrant, so F(inY)F(\mathrm{in}_Y) is a weak equivalence. The projection YXZYY \sqcup_X Z \to Y composed with inY\mathrm{in}_Y is the identity, so by two-out-of-three, both are weak equivalences under FF. Since f=pif = p \circ i and F(i)F(i) is a weak equivalence, F(p)F(p) is also a weak equivalence by two-out-of-three. Hence F(f)=F(p)F(i)F(f) = F(p) \circ F(i) is a weak equivalence.


Applications

ExampleVerifying Quillen adjunctions

To show that an adjunction FGF \dashv G is a Quillen adjunction, it suffices to check:

  • FF preserves cofibrations between cofibrant objects and trivial cofibrations between cofibrant objects.

By Ken Brown's lemma, if FF sends trivial cofibrations between cofibrant objects to weak equivalences, then FF sends all weak equivalences between cofibrant objects to weak equivalences. Combined with preserving cofibrations, this gives a Quillen adjunction.

In practice, one often checks the even simpler condition that FF sends generating (trivial) cofibrations to (trivial) cofibrations.

ExampleExistence of derived functors

Ken Brown's lemma guarantees the existence of total left derived functors. If F:MNF: \mathcal{M} \to \mathcal{N} preserves trivial cofibrations between cofibrant objects, then the composition

MQMcFNγHo(N)\mathcal{M} \xrightarrow{Q} \mathcal{M}_c \xrightarrow{F} \mathcal{N} \xrightarrow{\gamma} \operatorname{Ho}(\mathcal{N})

factors through Ho(M)\operatorname{Ho}(\mathcal{M}), giving LF:Ho(M)Ho(N)\mathbf{L}F: \operatorname{Ho}(\mathcal{M}) \to \operatorname{Ho}(\mathcal{N}).

This is the standard way to construct derived functors in homological algebra: one checks that the functor preserves quasi-isomorphisms between projective complexes.

ExampleHomotopy invariance of homology

The singular chain complex functor C:TopCh(Z)C_*: \mathbf{Top} \to \mathbf{Ch}(\mathbb{Z}) sends weak homotopy equivalences to quasi-isomorphisms. By Ken Brown's lemma, it suffices to check this for trivial cofibrations (which are homotopy equivalences of CW complexes), where it follows from the homotopy invariance of singular homology.

More generally, any functor that sends trivial cofibrations between CW complexes to quasi-isomorphisms automatically sends all weak homotopy equivalences between CW complexes to quasi-isomorphisms.

ExampleApplication to sheaf cohomology

In the model category of chain complexes of sheaves, the global sections functor Γ(X,)\Gamma(X, -) sends trivial fibrations between injective complexes to quasi-isomorphisms. By the fibrant version of Ken Brown's lemma, Γ\Gamma sends all weak equivalences between injective complexes to quasi-isomorphisms, establishing the well-definedness of RΓ\mathbf{R}\Gamma.

ExampleLocalization functors

Consider a left Bousfield localization LSML_S \mathcal{M} of a model category. The identity functor id:MLSM\mathrm{id}: \mathcal{M} \to L_S\mathcal{M} is a left Quillen functor. By Ken Brown's lemma, it suffices to check that the identity sends SS-local trivial cofibrations (which include the old trivial cofibrations plus the SS-equivalences) to weak equivalences in LSML_S\mathcal{M}.


Variants

ExampleSimplicial version

In a simplicial model category, Ken Brown's lemma has a simplicial enrichment: if F:MsSetF: \mathcal{M} \to \mathbf{sSet} is a simplicial functor that sends trivial cofibrations between cofibrant objects to weak equivalences, then FF sends all weak equivalences between cofibrant objects to weak equivalences.

This is used to verify that mapping spaces MapM(,Y)\operatorname{Map}_{\mathcal{M}}(-, Y) and MapM(X,)\operatorname{Map}_{\mathcal{M}}(X, -) are homotopy invariant in their cofibrant/fibrant arguments.

ExampleRelative version

A relative version of Ken Brown's lemma works for functors between model categories: if F:MNF: \mathcal{M} \to \mathcal{N} preserves trivial cofibrations between cofibrant objects, then FF preserves all weak equivalences between cofibrant objects. This does not require FF to be a left adjoint; it works for any functor.

This is useful for functors that are not part of an adjunction, such as certain geometric constructions or composite functors.

ExampleInfinity-categorical analogue

In the \infty-categorical setting, Ken Brown's lemma becomes essentially tautological: a functor F:CDF: \mathcal{C} \to \mathcal{D} between \infty-categories automatically preserves equivalences (by definition of functor between \infty-categories). The model-categorical lemma is the technical tool that makes this automatic preservation work at the level of ordinary categories with model structures.


Historical Context

RemarkHistory

Ken Brown's lemma appeared in Kenneth Brown's 1973 paper "Abstract homotopy theory and generalized sheaf cohomology." The lemma was originally formulated for categories of fibrant objects (a weaker structure than model categories), where it played a crucial role in constructing sheaf cohomology via resolutions.

The lemma is sometimes called the "factorization trick" because the proof uses the factorization axiom to reduce a general weak equivalence to a trivial cofibration followed by a trivial fibration, each of which can be handled separately.


Summary

RemarkKey points

Ken Brown's lemma is a workhorse of model category theory:

  1. Statement: A functor preserving trivial cofibrations between cofibrant objects automatically preserves all weak equivalences between cofibrant objects.

  2. Key use: Verifying that adjunctions are Quillen adjunctions (reduces to checking on generators).

  3. Derived functors: Guarantees existence of total left/right derived functors.

  4. Proof technique: Uses the factorization axiom to decompose weak equivalences into trivial cofibrations and trivial fibrations.

  5. \infty-categorical perspective: In the \infty-categorical world, the lemma becomes automatic, reflecting the deeper truth that homotopy-coherent functors preserve equivalences by definition.