TheoremComplete

Ken Brown Lemma

Ken Brown's Lemma is a fundamental result about when functors preserve weak equivalences. It provides the main tool for constructing derived functors and establishing that functors descend to the homotopy category.

TheoremKen Brown's Lemma

Let F:M→NF: \mathcal{M} \to \mathcal{N} be a functor between model categories. If FF preserves fibrations (resp. cofibrations) and trivial fibrations (resp. trivial cofibrations), then FF preserves weak equivalences between fibrant (resp. cofibrant) objects.

RemarkWhy This Is Important

The lemma says we don't need to verify directly that a functor preserves all weak equivalencesβ€”it suffices to check the technically simpler condition of preserving (trivial) fibrations or (trivial) cofibrations. This is crucial because:

  • Fibrations and cofibrations are often characterized by explicit lifting properties
  • Weak equivalences can be difficult to detect directly
  • The lemma converts a homotopy-theoretic condition into a categorical one
ExampleDerived Tensor Product

For the tensor product functor βˆ’βŠ—Y:Ch(Z)β†’Ch(Z)- \otimes Y: \mathbf{Ch}(\mathbb{Z}) \to \mathbf{Ch}(\mathbb{Z}), Ken Brown's Lemma shows:

If YY is cofibrant (projective), then XβŠ—YX \otimes Y preserves weak equivalences between cofibrant objects. This justifies defining the derived tensor product as: XβŠ—LY=P(X)βŠ—P(Y)X \otimes^{\mathbf{L}} Y = P(X) \otimes P(Y) where PP denotes projective replacement.

ProofSketch of Proof

Suppose FF preserves fibrations and trivial fibrations. Let f:X→Yf: X \to Y be a weak equivalence between fibrant objects. By the factorization axiom, factor ff as: X→jZ→qYX \xrightarrow{j} Z \xrightarrow{q} Y where jj is a trivial cofibration and qq is a fibration.

By two-out-of-three, qq is also a weak equivalence, hence a trivial fibration. Since FF preserves trivial fibrations, F(q)F(q) is a trivial fibration, hence a weak equivalence.

The key observation is that F(j)F(j) can be shown to be a weak equivalence using the cylinder construction and the fact that FF preserves trivial fibrations. Then by two-out-of-three: F(f)=F(q)∘F(j)F(f) = F(q) \circ F(j) is a weak equivalence.

β– 
DefinitionRight/Left Quillen Functors

A functor F:M→NF: \mathcal{M} \to \mathcal{N} is:

  • Right Quillen if it has a left adjoint and preserves fibrations and trivial fibrations
  • Left Quillen if it has a right adjoint and preserves cofibrations and trivial cofibrations

Ken Brown's Lemma immediately implies that right Quillen functors preserve weak equivalences between fibrant objects, and left Quillen functors preserve weak equivalences between cofibrant objects.

ExampleGeometric Realization

The geometric realization functor βˆ£βˆ’βˆ£:sSetβ†’Top|-|: \mathbf{sSet} \to \mathbf{Top} is left Quillen because it:

  • Preserves cofibrations (monomorphisms map to cofibrations)
  • Preserves trivial cofibrations

Ken Brown's Lemma then guarantees that βˆ£βˆ’βˆ£|-| preserves weak equivalences between cofibrant objects. Since all simplicial sets are cofibrant, βˆ£βˆ’βˆ£|-| preserves all weak equivalences.

RemarkApplications to Derived Functors

Ken Brown's Lemma is the main tool for showing that derived functors are well-defined. For a left Quillen functor FF, the derived functor: LF:Ho(M)β†’Ho(N)\mathbf{L}F: \text{Ho}(\mathcal{M}) \to \text{Ho}(\mathcal{N}) LF(X)=F(QX)\mathbf{L}F(X) = F(QX) is well-defined because Ken Brown's Lemma ensures that different cofibrant replacements QXQX give isomorphic results in Ho(N)\text{Ho}(\mathcal{N}).

ExampleHom Functors

For a fixed cofibrant object AA in a simplicial model category, the functor Map(A,βˆ’):Mβ†’sSet\text{Map}(A, -): \mathcal{M} \to \mathbf{sSet} preserves fibrations and trivial fibrations.

Ken Brown's Lemma implies it preserves weak equivalences between fibrant objects, making it a well-defined functor on the homotopy category.

Ken Brown's Lemma elegantly bridges the gap between the technical machinery of model categories (fibrations and cofibrations) and the homotopy-theoretic goal (preserving weak equivalences), making it indispensable for working with derived functors.