<?xml version="1.0" encoding="UTF-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xml:lang="fr">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>Fonds Grothendieck, cote n° 105, pages 21–40 — transcription</title>
        <author>Alexandre Grothendieck</author>
        <respStmt>
          <resp>transcription automatique — première passe, non vérifiée contre les pages par une personne (<date when="2026-09-23">2026-09-23</date>)</resp>
          <name xml:id="pass" type="model">Opus 5.5 (claude-opus-5-5)</name>
        </respStmt>
        <respStmt>
          <resp>procédure, outillage, export TEI</resp>
          <orgName xml:id="ed">grothendieck.commutator.io (Commutator, Paris)</orgName>
        </respStmt>
      </titleStmt>
      <editionStmt>
        <edition>Édition de démonstration</edition>
      </editionStmt>
      <publicationStmt>
        <publisher>Commutator</publisher>
        <pubPlace>Paris</pubPlace>
        <date when="2026-09-25">2026-09-25</date>
        <availability status="restricted">
          <p>Le fonds Alexandre Grothendieck est sous droits. Cette transcription
          est une édition de démonstration, non autorisée, produite par une
          machine et non vérifiée ; aucune image du fonds n'est reproduite. La
          source LaTeX dont ce fichier dérive est publiée sous https://github.com/Commutator-IO/grothendieck-project.</p>
        </availability>
        <ref target="https://grothendieck.commutator.io/">https://grothendieck.commutator.io</ref>
      </publicationStmt>
      <sourceDesc>
        <msDesc>
          <msIdentifier>
            <country>France</country>
            <settlement>Montpellier</settlement>
            <repository>Université de Montpellier</repository>
            <collection>Fonds Alexandre Grothendieck (archives mathématiques, 1949–1991)</collection>
            <idno type="cote">105</idno>
          </msIdentifier>
          <head>[Champs (stacks) 2] : notes manuscrites (s.d.).</head>
          <msContents>
            <summary>Pages 21 à 40 de la cote, dans la
            numérotation des archivistes (crayon, en bas à gauche de chaque
            page) ; lot 2 de vingt pages.
            Les pages absentes de la transcription ne portent pas de
            mathématiques et sont omises ; le saut dans la numérotation en est
            le seul enregistrement.</summary>
          </msContents>
          <history><origin><origDate>[à partir de 1982]</origDate><note>Datation de l'inventaire de l'Université de Montpellier, reproduite telle quelle ; les crochets sont ceux des archivistes.</note></origin></history>
          <additional>
            <surrogates>
              <bibl>
                <ref target="https://grothendieck.umontpellier.fr/105.pdf">https://grothendieck.umontpellier.fr/105.pdf</ref>
                <note>Fac-similé numérique de l'Université de Montpellier. Sa
                première page est une feuille de garde générée par
                l'université : la page <hi rend="italic">n</hi> des archivistes
                est la page <hi rend="italic">n</hi>+1 du PDF, et l'attribut
                <hi rend="monospace">facs</hi> de chaque
                <hi rend="monospace">pb</hi> tient compte de ce décalage.</note>
              </bibl>
            </surrogates>
          </additional>
        </msDesc>
      </sourceDesc>
    </fileDesc>
    <encodingDesc>
      <projectDesc>
        <p>Transcription mathématique du fonds, une passe de vingt pages par
        conversation avec un grand modèle multimodal, sous la procédure
        <hi rend="monospace">transcribe-grothendieck</hi> du dépôt. Le fichier
        LaTeX est la source de référence ; ce TEI en est dérivé mécaniquement
        par <hi rend="monospace">scripts/tei.mjs</hi> et n'a pas été relu.</p>
      </projectDesc>
      <editorialDecl>
        <p>L'édition n'est pas diplomatique : elle encode les mathématiques et
        l'apparat, rien du support. Correspondance avec l'apparat de la source :
        <hi rend="monospace">\ill</hi> devient <hi rend="monospace">gap[@reason='illegible']</hi>
        (jamais deviné) ; <hi rend="monospace">\uncertain</hi> devient
        <hi rend="monospace">unclear</hi> ; <hi rend="monospace">\add</hi> devient
        <hi rend="monospace">supplied</hi> ; <hi rend="monospace">\struck</hi> devient
        <hi rend="monospace">del</hi> (biffé par l'auteur) ;
        <hi rend="monospace">\note</hi> devient <hi rend="monospace">note[@type='editorial']</hi>
        (du transcripteur) ; <hi rend="monospace">\marginal</hi> devient
        <hi rend="monospace">note[@type='authorial'][@place='margin']</hi> (de l'auteur) ;
        <hi rend="monospace">\page</hi> devient <hi rend="monospace">pb</hi>.</p>
        <p>Les mathématiques sont transportées en TeX dans
        <hi rend="monospace">formula[@notation='TeX']</hi>, les diagrammes
        commutatifs en <hi rend="monospace">formula[@notation='tikz-cd']</hi>,
        sans conversion. Une marque d'apparat située à l'intérieur d'une
        formule (un exposant illisible, un symbole biffé) reste dans le TeX de
        la formule, sous les mêmes macros.</p>
        <p>Orthographe, ponctuation et lapsus de l'auteur sont conservés ; une
        faute évidente est signalée par une note, jamais corrigée.</p>
      </editorialDecl>
      <appInfo>
        <application ident="grothendieck-tei" version="1">
          <label>scripts/tei.mjs</label>
          <ref target="https://github.com/Commutator-IO/grothendieck-project">https://github.com/Commutator-IO/grothendieck-project</ref>
        </application>
      </appInfo>
    </encodingDesc>
    <profileDesc>
      <langUsage>
        <language ident="fr">français, avec la notation mathématique de l'auteur</language>
      </langUsage>
    </profileDesc>
    <revisionDesc>
      <change when="2026-09-23" who="#pass">Première passe de transcription.</change>
      <change when="2026-09-25" who="#ed">Export TEI depuis la source LaTeX.</change>
    </revisionDesc>
  </teiHeader>
  <text>
    <body>
      <div type="batch" n="2">
<div type="section">
<head>[Structures de modèles fermées, paires et triples de Quillen]</head>
<p><note type="editorial" resp="#pass">titre de l'éditeur, entre crochets : les feuillets n'en portent aucun.
Le texte est en anglais, tel qu'il l'écrit ; dans ce lot, la pagination de
sa main commence à 9.</note></p>
<pb n="21" facs="https://grothendieck.umontpellier.fr/105.pdf#page=22"/><p><note type="editorial" resp="#pass">p. 9 de l'auteur.</note>
Alternative presentation of theory, with possibly slightly less strong
result — as presentation of <unclear>homotopy as conditions</unclear> on a <formula notation="TeX">W</formula>, so
that there should exist a closed model structure on <formula notation="TeX">A</formula>, s.th. 
<formula notation="TeX">C = \text{mono}</formula>, <formula notation="TeX">W =</formula> the given ones, hence <formula notation="TeX">TC = C \cap W</formula>, <formula notation="TeX">F</formula> defined
by <del>lift.</del> RLP with respect to <formula notation="TeX">TC = C \cap W</formula>
<unclear>(or by <formula notation="TeX">(TC)_*</formula>)</unclear>, <formula notation="TeX">TF</formula> (« <unclear>Kan-</unclear><gap reason="illegible"/> » maps) defined
by RLP with respect to <formula notation="TeX">C</formula> (<formula notation="TeX">TF = C_*</formula>).</p>
<p>The problems which remain (as we know <unclear>always</unclear>
<formula notation="TeX">(TF)^* = (C_*)^* = C</formula>)</p>
<p>ⓐ <formula notation="TeX">F^* = \struck{A_{\text{any}}}\ ((TC)_*)^* = TC</formula> — and as <gap reason="illegible"/>
<formula notation="TeX">F^* \subset (TF)^* = C</formula>, this amounts to: any monomorphism which has the LLP
with respect to <formula notation="TeX">F</formula> is in <formula notation="TeX">W</formula>. (A saturation type property of <formula notation="TeX">W</formula> with
respect to monomorphisms.)</p>
<p>ⓑ <formula notation="TeX">TF = W \cap F</formula> — in terms of the assumptions already made previously upon
<formula notation="TeX">W</formula>, we know <formula notation="TeX">TF \subset W</formula>, i.e. <formula notation="TeX">TF \subset W \cap F</formula>, thus the problem is
<formula notation="TeX">W \cap F \subset TF</formula>, i.e. any <formula notation="TeX">f \in W</formula> which has the RLP with respect to
<formula notation="TeX">W \cap C</formula> is in <formula notation="TeX">TF</formula> i.e. is <unclear>Kan-</unclear><gap reason="illegible"/>.</p>
<p>c) Factorization <formula notation="TeX">f = pi</formula> with either <formula notation="TeX">p \in TF</formula>, <formula notation="TeX">i \in C</formula> (but this is
already known and independent of <formula notation="TeX">W</formula>), or <formula notation="TeX">p \in F</formula>, <formula notation="TeX">i \in TC</formula>
<supplied resp="#pass">and even <formula notation="TeX">i \in C \cap W</formula></supplied> — and this shouldn't be too hard in terms of
3) and 4) by standard arguments. Thus I'll admit c for the time being.
<note type="editorial" resp="#pass">« and even <formula notation="TeX">i \in C \cap W</formula> » est en interligne. Les conditions 3), 4)
et, plus bas, 5) sur <formula notation="TeX">W</formula> ne sont pas posées dans ce lot.</note></p>
<p>ⓓ Moreover, <del>I'm</del> I'm interested in the following, quite important
for me, dual to <unclear>(b)</unclear>: If <formula notation="TeX">f \in F</formula>, <formula notation="TeX">X \to Y</formula>, and
<formula notation="TeX">(Y' \to Y) \in W</formula>, then <formula notation="TeX">(X' \to X) \in W</formula>.</p>
<p>For handling ⓐ ⓑ ⓓ presumably I'll have to rely strongly upon factorization
c). Thus for <unclear>a)</unclear>, using factorization of <formula notation="TeX">f = pi</formula>, and using
<formula notation="TeX">f \in F^*</formula> we get a section <formula notation="TeX">s</formula> of <formula notation="TeX">p</formula> s.th. <formula notation="TeX">sf = i</formula>, thus <formula notation="TeX">f</formula> is a
retract of <formula notation="TeX">i \in W</formula>, and <gap reason="illegible"/> <gap reason="illegible"/> if we assume 5).</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  &amp; X' \arrow[d, "p \in F"] \\
  X \arrow[ur, "i \in W \cap C"] \arrow[r, "f"'] &amp; Y \arrow[u, bend right=40, "s"']
\end{tikzcd}</formula></figure></p>
<p><note type="editorial" resp="#pass">le petit diagramme est dans la marge inférieure, à gauche de la
dernière ligne. La lettre après « Thus for » est tracée comme le c) qui
précède ; mais l'argument (un monomorphisme ayant la LLP par rapport à <formula notation="TeX">F</formula>
est rétracte de <formula notation="TeX">i \in W \cap C</formula>) est celui qui répond à ⓐ.</note></p>
<pb n="24" facs="https://grothendieck.umontpellier.fr/105.pdf#page=25"/><p><note type="editorial" resp="#pass">p. 10 de l'auteur.</note>
<formula notation="TeX">A</formula> category, if <formula notation="TeX">\Phi \subset \mathrm{Fl}(A)</formula>, let
<formula notation="TeX" rend="display">\Phi^* = \{ u \in \mathrm{Fl}(A) \mid u \text{ has the LLP with respect to }
  \Phi \},</formula>
<formula notation="TeX" rend="display">\Phi_* = \{ u \in \mathrm{Fl}(A) \mid u \text{ has the RLP with respect to }
  \Phi \} .</formula>
<formula notation="TeX">\Phi</formula> is called left saturated if <formula notation="TeX">\Phi = \Psi^*</formula> for some <formula notation="TeX">\Psi</formula>, i.e. 
<formula notation="TeX">\Phi = (\Phi_*)^*</formula>; <formula notation="TeX">\Psi</formula> right saturated if <del>it is</del>
<formula notation="TeX">\Psi = \Phi_*</formula> for some <formula notation="TeX">\Phi</formula> i.e. <formula notation="TeX">\Psi = (\Psi^*)_*</formula>. Left saturation,
right saturation, <formula notation="TeX">\Phi \subset (\Phi_*)^*</formula>, <formula notation="TeX">\Psi \subset (\Psi^*)_*</formula>,
associations <formula notation="TeX">\Phi \mapsto \Phi_*</formula>, <formula notation="TeX">\Psi \mapsto \Psi^*</formula> are order
reversing bijections between left saturated and right saturated subsets.</p>
<p><note type="authorial" place="margin"><unclear>Right</unclear> saturation <formula notation="TeX">\Rightarrow</formula> stability by
composition, <unclear>base ch.</unclear>, <unclear>retracts</unclear> ; dually for left
saturation.</note>
<note type="editorial" resp="#pass">note écrite en oblique dans la marge gauche, en regard des lignes
précédentes.</note></p>
<p>The <hi rend="italic">factorization property</hi> for a pair <formula notation="TeX">(\Phi, \Psi)</formula> of mutually
orthogonal subsets of <formula notation="TeX">\mathrm{Fl}(A)</formula> (<formula notation="TeX">\Phi \subset \Psi^*</formula> i.e. 
<formula notation="TeX">\Psi \subset \Phi_*</formula>), is the property <del>that</del>
<formula notation="TeX" rend="display">\forall f \in \mathrm{Fl}(A) \quad \exists \text{ factorization }
  f = pi, \text{ with } i \in \Phi,\ p \in \Psi .</formula>
<del>Let <gap reason="illegible"/> be the left and right saturations respectively</del>
<del>Prop.</del> <del>Let</del>
<hi rend="italic">Proposition</hi> <supplied resp="#pass">(for orthogonal pairs <formula notation="TeX">(\Phi, \Psi)</formula>)</supplied>. Assume
factorization property holds. Then <formula notation="TeX">\Phi = \Psi^*</formula> iff <formula notation="TeX">\Phi</formula> stable by
direct factors. Dually <formula notation="TeX">\Psi = \Phi_*</formula> iff <formula notation="TeX">\Psi</formula> stable by retractions.
Hence <formula notation="TeX">(\Phi, \Psi)</formula> are dual pair of subsets of <formula notation="TeX">\mathrm{Fl}(A)</formula>
(localizers) iff <del>and</del> <del>(they are orthogonal)</del> both <formula notation="TeX">\Phi</formula> and
<formula notation="TeX">\Psi</formula> are stable by direct factors.</p>
<p><hi rend="italic">Quillen pair</hi> <formula notation="TeX">(\Phi, \Psi)</formula>: dual pair <formula notation="TeX">+</formula> factorization
<formula notation="TeX">\Leftrightarrow</formula> orthogonal pair <formula notation="TeX">+</formula> factorization <formula notation="TeX">+</formula> stability of
<formula notation="TeX">\Phi</formula>, <formula notation="TeX">\Psi</formula> (by direct factors).</p>
<p><hi rend="italic">Quillen triple</hi> <formula notation="TeX">(C, F, W)</formula> <del>Now let</del> with</p>
<p>a) <formula notation="TeX">W</formula> <del><gap reason="illegible"/></del> <unclear>weakly</unclear> saturated (isos in <formula notation="TeX">W</formula>,
<del>and</del> and the <gap reason="illegible"/> <gap reason="illegible"/> <supplied resp="#pass">and stable by direct factors</supplied>) (M5)</p>
<p>b) <formula notation="TeX">(C, F \cap W \overset{\text{def}}{=} TF)</formula> and
<formula notation="TeX">(TC \overset{\text{def}}{=} C \cap W, F)</formula> are Quillen pairs i.e. (M1)
(M2) and stability of <formula notation="TeX">C</formula>, <formula notation="TeX">F</formula>, <supplied resp="#pass"><formula notation="TeX">TC</formula>, <formula notation="TeX">TF</formula></supplied> <del>under</del> under direct
factors (it is enough for <formula notation="TeX">C</formula>, <formula notation="TeX">F</formula>, provided it holds for <formula notation="TeX">W</formula>).
<formula notation="TeX" rend="display">\begin{array}{ccc}
    C &amp; TF &amp; \\
    \cup &amp; \cap &amp; W \\
    TC &amp; F &amp;
  \end{array}</formula>
<supplied resp="#pass">it would not be necessary here to assume the direct factor condition on
<formula notation="TeX">W</formula>, if we assume b)</supplied>
<note type="editorial" resp="#pass">cette insertion est reliée par une flèche au a).</note></p>
<p>(hence <formula notation="TeX">f \in W \Longleftrightarrow f = pi</formula>, <formula notation="TeX">i \in TC</formula>,
<unclear><formula notation="TeX">p</formula></unclear><formula notation="TeX">{} \in TF</formula>)</p>
<p>! This implies <formula notation="TeX">W</formula> is strongly saturated i.e. if
<formula notation="TeX">\gamma_W : A \to W^{-1}A</formula>, <formula notation="TeX">f \in W \Longleftrightarrow \gamma_W(f)</formula> iso.
<note type="authorial" place="margin">true at any rate if in <formula notation="TeX">A</formula> finite direct <unclear>limits</unclear> and
<unclear>finite inverse limits</unclear> exist (M0)</note></p>
<pb n="26" facs="https://grothendieck.umontpellier.fr/105.pdf#page=27"/><p><note type="editorial" resp="#pass">feuillet de brouillon sans numéro de l'auteur, barré de deux longues
diagonales au crayon ; on le transcrit tel qu'il se lit.</note>
<formula notation="TeX">Y</formula> is Kan.    <formula notation="TeX">X \to Y</formula> fibration, Kan.</p>
<p><formula notation="TeX">\underline{\mathrm{Hom}}(I, Y) \to Y \times Y</formula> is a Kan fibration (if <formula notation="TeX">Y</formula>
is Kan); is it a Serre fibration?
<formula notation="TeX" rend="display">a \to Y \times Y, \quad \alpha, \beta \in Y_a, \quad
  \underline{\mathrm{Hom}}_{\alpha,\beta}(I_a, Y_a), \quad
  \underline{\mathrm{Hom}}_{\alpha_b, \beta_b}(I_b, Y_b)</formula></p>
<p>a) <formula notation="TeX">\mathrm{Iso}_M \subset W</formula></p>
<p>b) If <gap reason="illegible"/> <gap reason="illegible"/> among <formula notation="TeX">u</formula>, <formula notation="TeX">v</formula>, <formula notation="TeX">uv</formula> <unclear>two</unclear> are in <formula notation="TeX">W</formula>, so is
the third</p>
<p>c) <formula notation="TeX">W</formula> stable by retraction <del>(stronger than <gap reason="illegible"/>)</del></p>
<p><formula notation="TeX">\Rightarrow</formula> <unclear>mild</unclear> saturation. But does it imply saturation,
namely <formula notation="TeX">fg \in W</formula>, <formula notation="TeX">gf \in W \Longrightarrow f, g \in W</formula>??</p>
<p><formula notation="TeX">A \underset{g}{\overset{f}{\rightleftarrows}} B</formula>   
<formula notation="TeX">fg \in W</formula>, <formula notation="TeX">gf \in W \Longrightarrow f, g \in W</formula>?</p>
<p><formula notation="TeX">fg \in W_A</formula>, <formula notation="TeX">gf = \mathrm{id}_A \Longrightarrow f, g \in W</formula></p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  A \arrow[r, "f"] \arrow[d, bend left=30, "i"] &amp; B \arrow[d, bend left=30, "j"] \\
  A' \arrow[r, "f'"'] \arrow[u, bend left=30, "p"] &amp; B' \arrow[u, bend left=30, "q"]
\end{tikzcd}</formula></figure></p>
<p><formula notation="TeX">f'i = jf</formula>,    <formula notation="TeX">fp = qf'</formula>,    <formula notation="TeX">pi = \mathrm{id}_A</formula>,   
<formula notation="TeX">qj = \mathrm{id}_B</formula>,    <formula notation="TeX">f' \in W</formula> <formula notation="TeX">\overset{?}{\Longrightarrow}</formula>
<formula notation="TeX">f \in W</formula>.</p>
<p>(i) <formula notation="TeX">gf = \mathrm{id}_A</formula>, <formula notation="TeX">fg \in W \Rightarrow f, g \in W</formula></p>
<p>(ii) <formula notation="TeX">gf \in W</formula>, <formula notation="TeX">fg \in W \Rightarrow f, g \in W</formula></p>
<p>(iii) <formula notation="TeX">W</formula> stable <del>by factors</del> direct factors</p>
<p>(ii) <formula notation="TeX">\Rightarrow</formula> (i) <formula notation="TeX">\Leftarrow</formula> (iii)</p>
<p><note type="editorial" resp="#pass">autour de ces lignes, des esquisses : les carrés
<formula notation="TeX">A \to A</formula>, <formula notation="TeX">A \xrightarrow{f} B</formula>, <formula notation="TeX">B \xrightarrow{fg} B</formula> exhibant <formula notation="TeX">f</formula> comme
rétracte de <formula notation="TeX">fg</formula> ; un encadré « a) b) c<formula notation="TeX">_1</formula>) (c<formula notation="TeX">_2</formula>) (c<formula notation="TeX">_3</formula>) » ; en bas à
gauche, <formula notation="TeX">A \rightleftarrows B</formula> avec « <formula notation="TeX">W</formula> », « <formula notation="TeX">{}^{h}W</formula> »,
<formula notation="TeX">gf \sim_h \mathrm{id}_A</formula> donc <formula notation="TeX">gf \in W</formula>, <formula notation="TeX">fg \sim_h \mathrm{id}_B</formula> donc
<formula notation="TeX">fg \in W</formula>, et un triangle <formula notation="TeX">X \leftarrow I \times X</formula> ; en bas à droite, un
schéma <formula notation="TeX">X \to X</formula>, <formula notation="TeX">X \wedge X</formula> qu'on ne restitue pas.</note></p>
<pb n="27" facs="https://grothendieck.umontpellier.fr/105.pdf#page=28"/><p><note type="editorial" resp="#pass">p. « 10 bis » de l'auteur. Le listing sur lequel il écrit porte
imprimé dans sa marge « 06/09/82-09:14:22 » et « CFT 1.09 (05/10/82) ».</note>
<formula notation="TeX">X \xrightarrow{f} Y</formula>,    <formula notation="TeX">X, Y \in M_{c,f}</formula>,    <formula notation="TeX">f \in F</formula>.</p>
<p>Then <formula notation="TeX">f \in TF \Longleftrightarrow</formula> retract property <formula notation="TeX">\Longleftrightarrow</formula>
i.e.</p>
<p><formula notation="TeX" rend="display">\begin{array}{cc}
    C &amp; F \cap W = TF \\
    \cup &amp; \cap \\
    TC = C \cap W &amp; F
  \end{array}</formula>
ⓐ <formula notation="TeX">\begin{cases} C = (TF)^* \\ F = (TC)_* \end{cases}</formula>
   ⓑ <formula notation="TeX">W = \bigl\{ pi \bigm| p \in \underbrace{C_*}_{\widetilde{TF}},\;
i \in \underbrace{F^*}_{\widetilde{TC}} \bigr\}</formula></p>
<p><formula notation="TeX">\widetilde{TF} \subset F</formula>, <formula notation="TeX">\widetilde{TC} \subset C</formula> (because <formula notation="TeX">F</formula>, <formula notation="TeX">C</formula>
<supplied resp="#pass"><unclear>trivially</unclear></supplied> saturated)</p>
<p><del><formula notation="TeX">TF = \widetilde{TF}</formula>, <formula notation="TeX">TC = \widetilde{TC}</formula> <formula notation="TeX">\}</formula> because
<formula notation="TeX">TF = F \cap W</formula>, <formula notation="TeX">TC = C \cap W</formula> are stable under direct factors [provided
we know <formula notation="TeX">W</formula> is stable]</del></p>
<p>we only have to <del>prove</del> <unclear>express</unclear>, to get <gap reason="illegible"/> of
<gap reason="illegible"/>, that
<formula notation="TeX" rend="display">\boxed{\widetilde{TF} \subset W,\ \widetilde{TC} \subset W}
  \quad \text{and this is equivalent with} \quad
  \boxed{\widetilde{TF} = TF,\ \widetilde{TC} = TC}</formula>
i.e. <formula notation="TeX">TF</formula>, <formula notation="TeX">TC</formula> saturated i.e. <formula notation="TeX">(C, TF)</formula>, <formula notation="TeX">(TC, F)</formula> Quillen pairs.</p>
<p><hi rend="italic">Equivalent conditions on a model category</hi> (in Quillen's sense)
<del>Closed model</del></p>
<p>(i) satisfies ⓐ and ⓑ, i.e. closed model category in Quillen sense</p>
<p><formula notation="TeX">\Updownarrow</formula> (ii) <formula notation="TeX">(C, TF = F \cap W)</formula> and <formula notation="TeX">(TC = C \cap W, F)</formula> are Quillen
pairs</p>
<p>(iii) <formula notation="TeX">C</formula>, <formula notation="TeX">F</formula>, <formula notation="TeX">W</formula> are stable under direct factors.</p>
<p>But I've to check that (i) (ii) (which are equivalent) does imply that
<hi rend="italic"><formula notation="TeX">W</formula></hi> is stable under direct factors. But Quillen proves it even
implies <formula notation="TeX">W</formula> is strongly saturated (i.e. <formula notation="TeX">f \in W</formula> iff <formula notation="TeX">\gamma(f)</formula> iso)
— at least under the assumption that finite direct and inverse limits exist
in <formula notation="TeX">M</formula>.</p>
<p><unclear>for any model category</unclear></p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}[column sep=small, row sep=small, nodes={font=\scriptsize}]
  &amp; &amp; X_2 \arrow[r, "C \text{ or } F", "g"'] &amp; Y_2 \arrow[dr, "TF"] &amp; &amp; \\
  \varnothing \arrow[r, "C"] &amp; X_1 \arrow[ur, "TC"] \arrow[dr, "TF"'] &amp; &amp; &amp; Y_1 \arrow[r, "F"] &amp; e \\
  &amp; &amp; X \arrow[r, "f"'] &amp; Y \arrow[ur, "TC"'] &amp; &amp;
\end{tikzcd}</formula></figure></p>
<p><note type="editorial" resp="#pass">deux flèches en pointillé, marquées l'une « <formula notation="TeX">\varepsilon</formula> »,
l'autre « <formula notation="TeX">F</formula> », vont de <formula notation="TeX">X_1</formula> et de <formula notation="TeX">X_2</formula> vers <formula notation="TeX">Y_1</formula> ; on ne les restitue
pas. L'objet de départ est tracé <formula notation="TeX">\varphi</formula> : on le lit comme l'objet
initial.</note></p>
<p><formula notation="TeX">\gamma(f)</formula> iso <formula notation="TeX">\Longleftrightarrow \gamma(g)</formula> iso;   
<formula notation="TeX">f \in W \Longleftrightarrow g \in W</formula>.</p>
<p><formula notation="TeX">W</formula> strongly saturated <formula notation="TeX">\Longleftrightarrow</formula> for <formula notation="TeX">f : X \to Y</formula>,
<formula notation="TeX">X, Y \in M_{cf}</formula>, <formula notation="TeX">f \in C</formula>, <formula notation="TeX">\gamma(f)</formula> iso <formula notation="TeX">\Rightarrow f \in W</formula>
<formula notation="TeX">\Longleftrightarrow</formula> for <formula notation="TeX">f : X \to Y</formula>, <formula notation="TeX">X, Y \in M_{cf}</formula>, <formula notation="TeX">f \in F</formula>,
<formula notation="TeX">\gamma(f)</formula> iso <formula notation="TeX">\Rightarrow f \in W</formula>.</p>
<pb n="29" facs="https://grothendieck.umontpellier.fr/105.pdf#page=30"/><p><note type="editorial" resp="#pass">p. 11 de l'auteur.</note>
To construct any Quillen triple, we may proceed as follows: start with
<supplied resp="#pass">a localizer,</supplied> <formula notation="TeX">C \subset \mathrm{Fl}(A)</formula>, ⓐ <formula notation="TeX">C</formula> stable <del><gap reason="illegible"/></del>
by direct factors, hence a pair <formula notation="TeX">(C, C_* = TF)</formula> — we must check ⓑ
<hi rend="italic">factorization condition for the pair</hi> <formula notation="TeX">(C, C_*)</formula>. <del>Hence</del> Then
<formula notation="TeX">(C, TF)</formula> is a Quillen pair. Let next ⓒ <formula notation="TeX">\boxed{W \supset TF}</formula> any
localizer which is <supplied resp="#pass">ⓓ <unclear>mildly</unclear></supplied> <hi rend="italic">saturated and stable
under direct factor</hi>. We now get <formula notation="TeX">TC = C \cap W</formula> <supplied resp="#pass"><formula notation="TeX">\subset C</formula></supplied>, which is
<del><gap reason="illegible"/></del> stable under direct factor. Take <formula notation="TeX">F = (TC)_*</formula>
(<formula notation="TeX">\supset TF = C_*</formula>), we must check ⓔ <hi rend="italic">factorization property for the
pair</hi> <formula notation="TeX">(TC, F)</formula> — thus we get that <formula notation="TeX">(TC, F)</formula> is a Quillen pair. Lastly, we
must still check that <formula notation="TeX">TF = F \cap W</formula>, and by c) we know already
<formula notation="TeX">TF \subset F \cap W</formula>, we have to check still that <formula notation="TeX">F \cap W \subset TF</formula>.
But using a factorization <formula notation="TeX">f = pi</formula>, <formula notation="TeX">p \in TF</formula>, <formula notation="TeX">i \in C</formula>, as
<formula notation="TeX">f, p \in W</formula> we get <formula notation="TeX">i \in W</formula> hence <formula notation="TeX">i \in W \cap C = TC</formula>, hence there
exists <formula notation="TeX">s : X' \to X</formula> s.th. <formula notation="TeX">si = \mathrm{id}_X</formula> (retraction of <formula notation="TeX">X'</formula> upon
<formula notation="TeX">X</formula>) and <formula notation="TeX">fs = p</formula>, hence <formula notation="TeX">f</formula> a retraction of <formula notation="TeX">p</formula>, hence is in <formula notation="TeX">TF</formula>. OK.</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  X \arrow[r, "="] \arrow[d, "i"'] &amp; X \arrow[d, "f \in F"] \\
  X' \arrow[r, "p"'] \arrow[ur, dashed, "s"] &amp; Y
\end{tikzcd}</formula></figure></p>
<p><note type="editorial" resp="#pass">à côté, un second schéma : <formula notation="TeX">X' \rightleftarrows X</formula> par <formula notation="TeX">s</formula> et <formula notation="TeX">i</formula>,
au-dessus de <formula notation="TeX">Y \rightleftarrows Y</formula>, avec <formula notation="TeX">p</formula> et <formula notation="TeX">f</formula> verticales — <formula notation="TeX">f</formula>
rétracte de <formula notation="TeX">p</formula>. Le <formula notation="TeX">i</formula> du premier carré est marqué « <formula notation="TeX">\in TC</formula> ».</note></p>
<p>Thus</p>
<p><hi rend="italic">Proposition</hi> In order for a pair <formula notation="TeX">(C, W)</formula> to correspond to a Quillen
triple <formula notation="TeX">(C, F, W)</formula> <supplied resp="#pass">fibrations</supplied>, it is n.s. that the following
conditions be satisfied:</p>
<list rend="enumerate">
<label>1)</label><item><formula notation="TeX">C</formula>, <formula notation="TeX">W</formula> <hi rend="italic">stable by direct factors</hi>, <formula notation="TeX">W</formula> mildly saturated</item>
<label>2)</label><item>Factorization conditions for <formula notation="TeX">(C, C_*)</formula> and for
  <formula notation="TeX">(C \cap W, (C \cap W)_*)</formula>.</item>
<label>3)</label><item><formula notation="TeX">W \supset TF \overset{\text{def}}{=} C_*</formula></item>
</list>
<p>We have to develop mainly a criterion to get factorization. [In the case of
interest to us, we get 1) free, 3) almost free (<gap reason="illegible"/> comes in the
« test »-assumption though), and 2) <unclear>causing</unclear> a little technical
problem.] I am however <gap reason="illegible"/> factorization conditions, interested in the
<gap reason="illegible"/> <gap reason="illegible"/> in</p>
<pb n="31" facs="https://grothendieck.umontpellier.fr/105.pdf#page=32"/><p><note type="editorial" resp="#pass">p. 12 de l'auteur.</note>
following properties (characterizing a <hi rend="italic">strict</hi> Quillen triple)</p>
<p>4) <del>A any cobase change of</del> <supplied resp="#pass"><formula notation="TeX">W</formula> stable by base</supplied> change by any
<formula notation="TeX">g \in F</formula>, and by cobase change by any <formula notation="TeX">g \in C</formula>.</p>
<p><hi rend="italic">NB</hi> From my point of view, <formula notation="TeX">W</formula> is given beforehand in a rather
tangible way, by a homological criterion, which turns out very handy. In
Kan-Quillen's point of view, <formula notation="TeX">W</formula> was a little more hidden maybe in terms of
(say) <unclear>ss</unclear> structures, they get to it via <gap reason="illegible"/> the pair
<formula notation="TeX">(C, TF)</formula> and <formula notation="TeX">F \supset TF</formula> the <unclear>Kan</unclear> fibrations, which is a
somewhat ad-hoc construction in terms of a <gap reason="illegible"/> <unclear>a-priori</unclear>
generating set <formula notation="TeX">(TC)_0</formula> — corresponding roughly to expressing the
<unclear>Kan</unclear> lifting property. What remains to be understood, in the
context of general test category, is the relationship between this and the
direct description <formula notation="TeX">TC = C \cap W</formula>, i.e. why this is just the
<hi rend="italic">saturation</hi> of <formula notation="TeX">(TC)_0</formula>. Maybe I should have a look at
Gabriel-Zisman and their treatment of « anodyne extensions ».</p>
</div>
<div type="section">
<head>Factorization</head>
<p><note type="editorial" resp="#pass">titre de sa main, souligné, écrit en oblique dans la marge supérieure
gauche du feuillet 33.</note></p>
<pb n="33" facs="https://grothendieck.umontpellier.fr/105.pdf#page=34"/><p><note type="editorial" resp="#pass">p. 13 de l'auteur.</note>
<formula notation="TeX">M</formula> a category, <formula notation="TeX">\Phi_0 \subset \mathrm{Fl}(M)</formula>, <formula notation="TeX">\Psi = (\Phi_0)_*</formula>,
<formula notation="TeX">\Phi_0 \subset \Phi \subset \overline{\Phi}_0 = \Psi^*</formula>, we want to deduce
conditions on <formula notation="TeX">\Phi_0</formula>, <formula notation="TeX">\Phi</formula> insuring that the pair <formula notation="TeX">(\Phi, \Psi)</formula>
satisfies factorization conditions, i.e. 
<formula notation="TeX">\forall f \in \mathrm{Fl}(M)</formula>, <formula notation="TeX">\exists</formula> factorization <formula notation="TeX">f = pi</formula>,
<formula notation="TeX">i \in \Phi</formula>, <formula notation="TeX">p \in \Psi</formula>.
<supplied resp="#pass">NB. we don't use <formula notation="TeX">\Phi \subset \uncertain{\overline{\Phi}_0}</formula></supplied>
<note type="editorial" resp="#pass">un astérisque est tracé au-dessus de <formula notation="TeX">\Phi_0</formula> dans
<formula notation="TeX">\Psi = (\Phi_0)_*</formula> ; sa portée n'est pas claire. L'insertion « NB. we
don't use … » est au-dessus de la ligne.</note></p>
<p><note type="authorial" place="margin"><gap reason="illegible"/> the Problem <gap reason="illegible"/> which <gap reason="illegible"/> ; <unclear>give the
result</unclear> <gap reason="illegible"/> p. 16<formula notation="TeX">^*</formula> <gap reason="illegible"/></note>
<note type="editorial" resp="#pass">note oblique dans la marge gauche, sous le titre ; « p. 16 » est sa
pagination et renvoie au feuillet 39, qui énonce le théorème.</note></p>
<p>The idea is to take <supplied resp="#pass">(for given <formula notation="TeX">f</formula>)</supplied> <del>all</del> <supplied resp="#pass">commutative</supplied>
diagrams</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  A \arrow[r, "u"] \arrow[d, "g"'] &amp; X \arrow[d, "f"] \\
  B \arrow[r, "v"'] &amp; Y
\end{tikzcd}</formula></figure></p>
<p>(D), with <formula notation="TeX">g \in \Phi_0</formula>, giving rise to</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  A \arrow[r, "u"] \arrow[d, "\alpha"'] &amp; X \arrow[d, "i_D"] \arrow[dd, bend left=50, "f"] \\
  B \arrow[r] &amp; X_D = X \sqcup_A B \arrow[d, "p_D"] \\
  &amp; Y
\end{tikzcd}</formula></figure></p>
<p><note type="editorial" resp="#pass">le carré supérieur est marqué « coc. » (cocartésien).</note></p>
<p>and to define
<formula notation="TeX" rend="display">\struck{\Sigma_1(f)}\; X_1(f) = \struck{\varinjlim}\;
  \coprod_{\substack{(X) \\ \text{all } D}} X_D
  \qquad \text{(amalgamated sum under } X)</formula>
so that we get factorization</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  X \arrow[r, "i_1(f)"] \arrow[d, "f"'] &amp; X_1(f) \arrow[dl, "\Sigma_1(f)"] \\
  Y &amp;
\end{tikzcd}</formula></figure></p>
<p>with (hopefully) <formula notation="TeX">i_1(f) \in \Phi</formula>.
<note type="editorial" resp="#pass">le but de <formula notation="TeX">i_1(f)</formula> est d'abord écrit <formula notation="TeX">\Sigma_1(f)</formula>, surchargé.</note></p>
<p>For this first step, we need</p>
<p>a) <formula notation="TeX">\Phi_0</formula> is small (we'll see later how to relax this condition)</p>
<p>b) Amalgamated sums indexed by <formula notation="TeX">I</formula> with <formula notation="TeX">\mathrm{card}\, I \leqslant
\mathrm{card}\, \Phi_0</formula> <del><gap reason="illegible"/></del> <supplied resp="#pass">or rather,
<formula notation="TeX">\mathrm{card}\, \Phi_0 \times c</formula>, where <formula notation="TeX">c</formula> is
<formula notation="TeX">\sup \mathrm{card}(\mathrm{Hom}(A, X) \times \mathrm{Hom}(B, Y))</formula></supplied> exist in
<formula notation="TeX">M</formula>, <del>and</del></p>
<p>c) <formula notation="TeX">\Phi</formula> stable by <supplied resp="#pass">compositions, and by</supplied> cobase extensions, and by
filtering direct limits indexed by a set of cardinality
<formula notation="TeX">\leqslant \mathrm{card}\, \Phi_0</formula> <del><gap reason="illegible"/></del> <supplied resp="#pass">rather
<formula notation="TeX">\leqslant c</formula></supplied> <supplied resp="#pass">for <formula notation="TeX">\alpha : A \to B</formula> in <formula notation="TeX">\Phi_0</formula></supplied>.
<note type="editorial" resp="#pass">insertions et renvois très serrés en bout de lignes b) et c) ; leur
place exacte est incertaine.</note></p>
<p><note type="authorial" place="margin"><unclear>do</unclear> <unclear>with</unclear> the <gap reason="illegible"/> <gap reason="illegible"/></note></p>
<p>We then are making an transfinite induction to define <formula notation="TeX">X_\alpha(f)</formula> and</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  X \arrow[r, "i_\alpha(f)"] \arrow[d, "f"'] &amp; X_\alpha(f) \arrow[dl, "\Sigma_\alpha(f)"] \\
  Y &amp;
\end{tikzcd}</formula></figure></p>
<p><formula notation="TeX">i_\alpha(f) \in \Phi</formula>, with <formula notation="TeX">\alpha</formula> any ordinal <formula notation="TeX">&lt; \alpha_0</formula> (<formula notation="TeX">\alpha_0</formula>
<del>first</del> <supplied resp="#pass"><unclear>suitable</unclear></supplied> ordinal <del>(<gap reason="illegible"/>)</del> to be
fixed later) <del>define later in terms of <gap reason="illegible"/></del>:
<formula notation="TeX" rend="display">\begin{cases}
    \Sigma_{\alpha+1}(f) = \Sigma_1(\Sigma_\alpha(f)), \quad
    X_{\alpha+1}(f) = \text{source } \Sigma_{\alpha+1}(f), \\
    i_{\alpha+1}(f) = \text{composition }
    X \xrightarrow{i_\alpha(f)} X_\alpha(f)
    \xrightarrow{i_1(\Sigma_\alpha(f))} X_{\alpha+1}(f) \\[1ex]
    \Sigma_\alpha(f) = \varinjlim_{\alpha' &lt; \alpha} \Sigma_{\alpha'}(f)
    \quad \text{if } \alpha \text{ is a limiting ordinal.}
  \end{cases}</formula>
<note type="editorial" resp="#pass">en regard de la première ligne, un schéma :
<formula notation="TeX">f : X \to Y</formula>, <formula notation="TeX">\Sigma_\alpha(f) : X_\alpha(f) \to Y</formula>,
<formula notation="TeX">\Sigma_{\alpha+1}(f) = \Sigma_1(\Sigma_\alpha(f)) : X_{\alpha+1}(f) \to Y</formula>.</note></p>
<p><del>NB</del> We assume that <formula notation="TeX">\Phi</formula> is stable too by the filtering direct
limits <del>of</del> <del>cardinality <formula notation="TeX">\leqslant</formula></del> which occur in the second
transfinite induction step.</p>
<p>Let <formula notation="TeX">\pi</formula> be a cardinal such that <del>all objects of <formula notation="TeX">\Phi_0</formula></del>
<supplied resp="#pass">for any <formula notation="TeX">g \in \Phi_0</formula>, source and target of <formula notation="TeX">g</formula></supplied> are
<formula notation="TeX">\pi</formula>-accessible — i.e. <formula notation="TeX">\mathrm{Hom}(A, -) : M \to \text{Sets}</formula> commutes
to filtering direct limits which are <del>great wr</del> « large with resp. 
to <formula notation="TeX">\pi</formula> ». We may take <formula notation="TeX">\pi = \sup_{g \in \Phi_0} \pi_g</formula>, where</p>
<pb n="35" facs="https://grothendieck.umontpellier.fr/105.pdf#page=36"/><p><note type="editorial" resp="#pass">p. 14 de l'auteur.</note>
<formula notation="TeX">\pi_g</formula> is the smallest cardinal with source and target of <formula notation="TeX">g</formula> are
<formula notation="TeX">\pi</formula>-accessible.</p>
<p><hi rend="italic">Example</hi> If the objects occurring as source and targets of <formula notation="TeX">g</formula>'s in
<formula notation="TeX">\Phi_0</formula> are « of finite presentation », i.e. <formula notation="TeX">\mathrm{Hom}(A, -)</formula> commutes
with any filtering direct limit, we get <formula notation="TeX">\pi = \uncertain{0}</formula>. In this case
we stop the induction with <formula notation="TeX">\alpha_0 =</formula> first infinite ordinal,
<del>the first</del> <del><unclear>we mean</unclear></del>. In case the objects <formula notation="TeX">A</formula>,
<formula notation="TeX">B</formula> are not of finite presentation (but they are accessible) — we take the
smallest ordinal such that <formula notation="TeX">\mathrm{Hom}(A, ?)</formula> commutes <unclear>with</unclear>
direct limits indexed by <del>ordi</del> ordered set <del>great</del>
<unclear>large</unclear> w.r.t. <formula notation="TeX">\pi</formula>. <supplied resp="#pass">Thus,</supplied> let <formula notation="TeX">\alpha_0</formula> be the first
ordinal such the interval
<formula notation="TeX">I_{\alpha_0} = \{ \text{all ordinals } \alpha \text{ with } \alpha &lt;
\alpha_0 \}</formula> be <del>great</del> larger w.r.t. <formula notation="TeX">\pi</formula>. We take the
factorization</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  X \arrow[r, "i_{\alpha_0}(f) = i(f)"] \arrow[d] &amp; X_{\alpha_0}(f) = \underline{X}(f) \arrow[dl, "\Sigma_{\alpha_0}(f) = p(f)"] \\
  Y &amp;
\end{tikzcd}</formula></figure></p>
<p><note type="editorial" resp="#pass">le « <formula notation="TeX">\pi = 0</formula> » est tracé d'un rond épais ; on ne décide pas s'il
s'agit de <formula notation="TeX">0</formula>, de <formula notation="TeX">\omega</formula> ou d'autre chose. Dans le diagramme, un
<formula notation="TeX">\Sigma</formula> est surchargé en <formula notation="TeX">\underline{X}</formula>.</note></p>
<p>and we get that <formula notation="TeX">i(f) \in \Phi</formula>, <formula notation="TeX">p(f) \in \Psi</formula>, provided we make the
following assumptions:</p>
<p>d) The <del>objects</del> source and target objects of the arrows
<formula notation="TeX">g \in \Phi_0</formula> are <hi rend="italic">accessible</hi> (ok if <formula notation="TeX">M</formula> a topos etc. —) and, if
<formula notation="TeX">\pi_0</formula> is the cardinality of the smallest ordinal <gap reason="illegible"/> such that for any
such <formula notation="TeX">A</formula>, <formula notation="TeX">\mathrm{Hom}(A, -)</formula> commutes to the <del><gap reason="illegible"/></del> direct limits
of type <formula notation="TeX">I_{\alpha_0}</formula>, <del>we assume</del> and <del><formula notation="TeX">\pi = \sup(\pi_0</formula></del>
<formula notation="TeX">\pi \geqslant \sup(\pi_0, \mathrm{card}\, \Phi_0)</formula> <supplied resp="#pass">rather, <formula notation="TeX">c</formula></supplied>, we
assume that for any filtering direct systems with ordered set <formula notation="TeX">I</formula> of
cardinality <formula notation="TeX">\leqslant \pi</formula>, and transitions maps in <formula notation="TeX">\Phi</formula>, the direct
limit exists and <del><gap reason="illegible"/></del> <formula notation="TeX">Z_i \to Z</formula> are equally in <formula notation="TeX">\Phi</formula>.</p>
<p>Then we get, not only factorization <formula notation="TeX">f = pi</formula>, with <formula notation="TeX">i \in \Phi</formula>,
<formula notation="TeX">p \in \Psi</formula>, but even factorization <formula notation="TeX">\underline{X}(f)</formula>
<hi rend="italic">functorial</hi> with respect to variable <formula notation="TeX">f</formula>.
<note type="editorial" resp="#pass">les deux dernières lignes sont marquées d'un double trait en marge.</note></p>
<pb n="37" facs="https://grothendieck.umontpellier.fr/105.pdf#page=38"/><p><note type="editorial" resp="#pass">p. 15 de l'auteur.</note>
<hi rend="italic"><gap reason="illegible"/></hi> Assume <del><gap reason="illegible"/></del></p>
<p>a) <formula notation="TeX">\Phi_0</formula> is small, source and target of any <formula notation="TeX">g \in \Phi_0</formula> are
accessible</p>
<p>b) <formula notation="TeX">M</formula> stable by filtering direct limits, <del>and by amalgamated</del>
<del><gap reason="illegible"/></del></p>
<p>ⓒ <del>Any</del> <supplied resp="#pass">For any</supplied> <del>amalgamated</del> diagram
<formula notation="TeX">A \xrightarrow{u} X</formula>, <formula notation="TeX">\alpha : A \to B</formula>, with <formula notation="TeX">\alpha \in \Phi_0</formula>, the
amalgamated sum exists</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  A \arrow[r, "u"] \arrow[d, "\alpha"'] &amp; X \arrow[d, "\alpha'"] \\
  B \arrow[r, "u'"'] &amp; X'
\end{tikzcd}</formula></figure></p>
<p>and <formula notation="TeX">\alpha' \in \Phi</formula>.
   Also c') <formula notation="TeX">\Phi</formula> stable under compositions</p>
<p>ⓓ <formula notation="TeX">\Phi</formula> « stable by <supplied resp="#pass">filtering</supplied> direct limits ».
<note type="authorial" place="margin">It is enough to know it w.r.t. ordered sets <formula notation="TeX">I</formula> where sup of any
two elements exists</note></p>
<p>Then <formula notation="TeX">(\Phi, \Psi)</formula> satisfy the factorization condition, and <del>more</del>
even, there exists a functor <formula notation="TeX">\Sigma</formula></p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  \underline{\mathrm{Fl}}(M) \arrow[rr, "\Sigma"] \arrow[dr, "t"'] &amp; &amp; \underline{\mathrm{Fl}}(M) \arrow[dl, "t"] \\
  &amp; M &amp;
\end{tikzcd}</formula></figure></p>
<p>and a functorial morphism <del><gap reason="illegible"/></del> in <formula notation="TeX">[\mathrm{Cat}]_{/M}</formula>
<supplied resp="#pass">possibly « large » categories over <formula notation="TeX">M</formula></supplied>
<formula notation="TeX" rend="display">\struck{\ill{}}\ \mathrm{id}_{\underline{\mathrm{Fl}}(M)} \to \Sigma</formula>
with <formula notation="TeX">i(f) \in \Phi</formula>, <formula notation="TeX">p(f) \in \Psi</formula>.</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  X \arrow[r, "i(f)"] \arrow[d] &amp; \underline{X}(f) \arrow[dl, "p(f)"] \\
  Y &amp;
\end{tikzcd}</formula></figure></p>
<p><hi rend="italic">Example</hi> Assume that <formula notation="TeX">M</formula> is stable by amalgamated sums. Take
<formula notation="TeX">\Phi = \overline{\Phi}_0 = \Psi^*</formula>. Then c) <del>and d)</del> is trivially
satisfied. What about d)? <unclear>OK</unclear> <supplied resp="#pass"><unclear>for compositions</unclear></supplied>.
To get <del>extension of</del> <supplied resp="#pass">the dotted <formula notation="TeX">\varphi</formula></supplied>, we make
<unclear>Zorn</unclear> <del><gap reason="illegible"/></del> <unclear>induction</unclear> on pairs
<formula notation="TeX">(J \subset I,\ u_J : A_J \to X)</formula> which make the diagram</p>
<p><figure type="diagram"><formula notation="tikz-cd">\begin{tikzcd}
  A_{i_0} \arrow[r] \arrow[d, "u_0"'] \arrow[rr, bend left=30] &amp; A_J \arrow[r] \arrow[dl, "u_J"] &amp; B \arrow[d] \\
  X \arrow[rr, "f"'] &amp; &amp; Y
\end{tikzcd}</formula></figure></p>
<p>commutative, with <unclear>obvious</unclear> order relation. <del>This is
clearly</del></p>
<p><note type="editorial" resp="#pass">à gauche, le schéma qui pose le problème :
<formula notation="TeX">A_{i_0} \to A_i \to B = \varinjlim A_i</formula>, <formula notation="TeX">u_0 : A_{i_0} \to X</formula>,
<formula notation="TeX">v : B \to Y</formula>, <formula notation="TeX">f : X \to Y</formula>, et la flèche cherchée <formula notation="TeX">\varphi : B \to X</formula> en
pointillé, marquée « induction ». La paire de la récurrence est écrite
<formula notation="TeX">(J \subset I, u_J : \varinjlim_J A_j \to X)</formula>, avec une surcharge.</note>
<formula notation="TeX" rend="display">\mathrm{Hom}(B, X) \to \mathrm{Hom}(g_i, f) \quad \text{surjective}, \qquad
  \mathrm{Hom}(g, f) = \varprojlim \mathrm{Hom}(g_i, f)</formula></p>
<pb n="39" facs="https://grothendieck.umontpellier.fr/105.pdf#page=40"/><p><note type="editorial" resp="#pass">p. 16 de l'auteur.</note>
<hi rend="italic">Lemma</hi> Let <formula notation="TeX">\Phi \subset \mathrm{Fl}(M)</formula> be left Q-saturated (i.e. 
<formula notation="TeX">\Phi = \Psi^*</formula> for some <formula notation="TeX">\Psi</formula>). Then <del><formula notation="TeX">\Phi</formula> is stable by
compositions,</del></p>
<p>a) <formula notation="TeX">\Phi</formula> contains iso</p>
<p>b) <formula notation="TeX">\Phi</formula> stable <del>by</del> under composition and cobase changes
(<unclear>including</unclear> <gap reason="illegible"/>)</p>
<p>c) <formula notation="TeX">\Phi</formula> stable <del>by</del> <supplied resp="#pass">under</supplied> <del>direct</del> arbitrary
amalgamated sums</p>
<p>d) <formula notation="TeX">\Phi</formula> stable <del>by direct limits, indexed by any well ordered set
i.e.</del> <supplied resp="#pass">under ordinal direct systems, i.e.</supplied> <del>if we have any
directed ordered set</del> if we have any well ordered set <formula notation="TeX">I</formula> and
<del>system</del> direct system <formula notation="TeX">(A_i)_{i \in I}</formula> with
<formula notation="TeX">g_{ij} : A_i \to A_j</formula> in <formula notation="TeX">\Phi</formula>, and
<formula notation="TeX">A_{i_0} = \varinjlim_{j &lt; i_0} A_j</formula> if <formula notation="TeX">i_0 \in I</formula> is a limit, then
<formula notation="TeX">\forall i_0 \in I</formula>, <formula notation="TeX">A_{i_0} \xrightarrow{g_{i_0}} B = \varinjlim A_i</formula> is
in <formula notation="TeX">\Phi</formula>.
<note type="authorial" place="margin"><hi rend="italic">NB</hi> a), b), d) <formula notation="TeX">\Rightarrow</formula> c)</note></p>
<p><del>The only</del></p>
<p>Thus we get,</p>
<p><hi rend="italic">Theorem</hi> Let <formula notation="TeX">M</formula> be a category, stable by small direct limits, and
(<unclear>weakly</unclear>) accessible. Then</p>
<p>① Let <formula notation="TeX">\Phi_0 \subset \mathrm{Fl}(M)</formula> <del><gap reason="illegible"/></del><formula notation="TeX">^*</formula>, and
<formula notation="TeX">\Phi_0 \subset \Phi \subset \overline{\Phi}_0 \overset{\text{def}}{=}
\Psi^*</formula> (with <formula notation="TeX">\Psi = \Phi_{0*}</formula>). If <formula notation="TeX">\Phi</formula> <del>stable and</del> satisfies
a) b) c) d)<formula notation="TeX">^*</formula>, then the <formula notation="TeX">(\Phi, \Psi)</formula> satisfies factorization condition.
(Hence, if <formula notation="TeX">\Phi</formula> stable by direct factors, <formula notation="TeX">\Phi = \overline{\Phi}_0</formula>.)</p>
<p>② (In order that <formula notation="TeX">\Phi</formula> <supplied resp="#pass">(some data <formula notation="TeX">\Phi_0</formula>, <formula notation="TeX">\Phi</formula>)</supplied>
<unclear>be saturated</unclear>, <formula notation="TeX">\Phi = \overline{\Phi}_0</formula>, it is n.s. that
<formula notation="TeX">\Phi</formula> satisfy conditions a) b) c) d) and e) stability by direct factors.
In this case, factorization holds for the Q-orthogonal pair
<formula notation="TeX">(\Phi, \Psi)</formula>.</p>
<p><note type="authorial" place="margin">We have to assume <formula notation="TeX">\Phi_0</formula> small (<gap reason="illegible"/>). We may <gap reason="illegible"/> <gap reason="illegible"/>
(<unclear>which results</unclear> from a) b) d)) <unclear>if</unclear> <formula notation="TeX">\Phi_0</formula> <gap reason="illegible"/>.
<unclear>Alternatively</unclear> a) b<formula notation="TeX">'</formula>) c) d), where b<formula notation="TeX">'</formula>) is stability under
cobase <unclear>changes</unclear> (without composition).</note>
<note type="editorial" resp="#pass">note oblique dans la marge gauche, en regard de ① et ② ; les
astérisques renvoient à cette note.</note></p>
<p><hi rend="italic">NB.</hi> In 2), <del>besides</del> there was the preliminary assumption of
existence of <formula notation="TeX">\Phi_0 \subset \Phi</formula> s.th. <formula notation="TeX">\Phi_0</formula> and <formula notation="TeX">\Phi</formula> <gap reason="illegible"/> the
same left Q-saturation, with <formula notation="TeX">\Phi_0</formula> <hi rend="italic">small</hi>. Next step is to try to
get rid of this.</p>
</div>
      </div>
    </body>
  </text>
</TEI>
