29.10.2014 Views

alternative lecture notes - Rational points and algebraic cycles

alternative lecture notes - Rational points and algebraic cycles

alternative lecture notes - Rational points and algebraic cycles

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

It is common when describing a model category to specify W <strong>and</strong> only one of FIB <strong>and</strong><br />

COF — the lemma shows that the other is determined.<br />

Let A ∈ C. Let f : A ∐ A → A. It factors as A ∐ A ↩→ A × I ∼ ↠ A. (This is the definition<br />

of A × I, which is a single symbol; there is no I.) This A × I is called the universal cylinder<br />

object of A.<br />

More generally, given a factorization A ∐ A → A ∧ I ∼ → A, call the object A ∧ I a cylinder<br />

object.<br />

Given two maps f, g : A → B, we will say that f is strictly left homotopic to g by A ∧ I<br />

<strong>and</strong> write f l ∼ g if there exists H completing the diagram below:<br />

A ∐ f ∐ g<br />

A B<br />

<br />

<br />

<br />

<br />

<br />

H<br />

A ∧ I.<br />

The dual definition: Let X ∈ C. Let ∆: X → X × X. We have X ∼<br />

↩→ X I ↠ X × X <strong>and</strong><br />

X I is called the universal path object. Given any decomposition X ∼ → X ∧I → X × X, call<br />

X ∧I a path object.<br />

Given f, g : Y → X, write f r ∼ g (right homotopic) if there exists H completing the diagram<br />

below:<br />

Y<br />

X ∧I<br />

<br />

H <br />

<br />

<br />

<br />

X × X<br />

Proposition 8.2. Let A ∈ C be cofibrant, let X ∈ C be fibrant, <strong>and</strong> let f, g : A → X. Then<br />

(1) If f l ∼ g by some A ∧ I, then f l ∼ g by A × I.<br />

(2) l ∼ is an equivalence relation on maps A → X<br />

(3) f l ∼ g if <strong>and</strong> only if f r ∼ g.<br />

Proof.<br />

(1) Given A ∐ A → A ∧ I ∼ → A, factor the second map as A ∧ I ∼<br />

↩→ A ∧ I ′ ↠ A; then the<br />

last morphism must also be in W .<br />

Then<br />

A ∐ A<br />

<br />

A ∧ I<br />

∼<br />

A ∧ I ′<br />

H<br />

f ∐ g<br />

X<br />

∗<br />

A ∐ A A ∧ I<br />

<br />

′<br />

<br />

<br />

<br />

∼<br />

<br />

<br />

∼<br />

A × I A<br />

18

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!