<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="default.xsl"?>
<fr:tree
toc="true"
numbered="true"
show-heading="true"
show-metadata="true"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>3248</fr:anchor><fr:addr
type="user">fga3.iii</fr:addr><fr:route>fga3.iii.xml</fr:route><fr:title
text="Quotient preschemes">Quotient preschemes</fr:title><fr:taxon>FGA</fr:taxon><fr:authors /><fr:number>3.III</fr:number></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2005</fr:anchor><fr:addr
type="user">fga3.iii-original-citation</fr:addr><fr:route>fga3.iii-original-citation.xml</fr:route><fr:taxon>Original</fr:taxon><fr:authors /><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>A. Grothendieck.
    "Technique de descente et théorèmes d'existence en géométrie algébrique, III: Préschemas quotients".
    <fr:em>Séminaire Bourbaki</fr:em> <fr:strong>13</fr:strong> (1960–61), Talk no. 212.
    <fr:link
type="external"
href="http://www.numdam.org/book-part/SB_1960-1961__6__99_0/"><fr:code>http://www.numdam.org/book-part/SB_1960-1961__6__99_0/</fr:code></fr:link></fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2006</fr:anchor><fr:addr
type="user">fga3.iii-introduction</fr:addr><fr:route>fga3.iii-introduction.xml</fr:route><fr:title
text="Introduction">Introduction</fr:title><fr:authors /><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1600</fr:anchor><fr:addr
type="user">fga3.iii-introduction-remark</fr:addr><fr:route>fga3.iii-introduction-remark.xml</fr:route><fr:taxon>Remark</fr:taxon><fr:authors /><fr:parent>fga3.iii-introduction</fr:parent></fr:frontmatter><fr:mainmatter><fr:p><fr:em>[Comp.]</fr:em>
    We note that the application (of the theory developed here) in <fr:ref
addr="fga3.v"
href="fga3.v.xml"
taxon="FGA"
number="3.V" /> ("Picard schemes: Existence theorems") can equally be replaced by a suitable use of Hilbert schemes (cf. <fr:em>Séminaire Mumford–Tate</fr:em>, Harvard University (1961–62)).
    As mentioned in <fr:ref
addr="fga3.iii-8"
href="fga3.iii-8.xml"
number="8" />, the most important gap in the theory presented here is the lack of an existence criterion for quotients by a non-proper equivalence relation, such as the equivalence relations coming from certain actions of the projective group.
    An important theorem in this direction has been obtained by Mumford [@Mum1961].
    For a refinement of his result, and various applications the the theory, see <fr:em>Séminaire Mumford–Tate</fr:em>, Harvard University (1961–62).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>The problems discussed in the current talk differ from those discussed in the two previous ones, in that we try to represent certain covariant, no longer contravariant, functors of varying schemes.
  The procedure of passing to the quotient is, however, essential in many questions of construction in algebraic geometry, including those from <fr:ref
addr="fga3.i"
href="fga3.i.xml"
taxon="FGA"
number="3.I" /> and <fr:ref
addr="fga3.ii"
href="fga3.ii.xml"
taxon="FGA"
number="3.II" />.
  Indeed, the question of <fr:em>effectiveness of a descent data</fr:em> on a <fr:tex
display="inline"><![CDATA[T]]></fr:tex>-prescheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, with respect to a faithfully flat and quasi-compact morphism <fr:tex
display="inline"><![CDATA[T\to  S]]></fr:tex>, is equivalent to the question of existence of a quotient of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> (satisfying reasonable properties that we examine below) by the flat equivalence relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> defined by the descent data;
  the questions raised in <fr:link
type="local"
href="fga3.i-a.2.c.xml"
addr="fga3.i-a.2.c"
title="Generalities, and descent by faithfully flat morphisms › Preliminaries on categories › Exact diagrams and strict epimorphisms, descent morphisms, and examples › ">FGA 3.I, §A.2.c</fr:link> can probably be answered at the same time as the questions posed in <fr:ref
addr="fga3.iii-2"
href="fga3.iii-2.xml"
number="2" /> of this current talk.
  Similarly, the <fr:em>Picard scheme</fr:em> (for the definition, see <fr:link
type="local"
href="fga3.ii-c.3.xml"
addr="fga3.ii-c.3"
title="The existence theorem and the formal theory of modules › Applications to some particular cases › Picard schemes">FGA 3.II, §C.3</fr:link>) of an <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-scheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex> can be defined in many ways, such as as a quotient of certain other schemes (with positive divisors, or immersions into a projective) by flat equivalence relations, with the definition and construction of these auxiliary schemes being also more simple: they are basically schemes of the type <fr:tex
display="inline"><![CDATA[\operatorname {Hom}_S(X,Y)]]></fr:tex>, and variants defined in <fr:link
type="local"
href="fga3.ii-c.2.xml"
addr="fga3.ii-c.2"
title="The existence theorem and the formal theory of modules › Applications to some particular cases › The schemes {{Hom}}_S(X,Y), _{X/S}Z, {{Aut}}(X), etc.">FGA 3.II, §C.2</fr:link>, and their construction will be the subject of the following talk (under suitable hypotheses of projectivity).
  Thus, combining the results of the current talk with those of the following, we will obtain the construction of Picard schemes, under suitable hypotheses.</fr:p><fr:p>The problem of passing to the quotient in preschemes again offers unresolved questions.
  The most important is mentioned in <fr:ref
addr="fga3.iii-8"
href="fga3.iii-8.xml"
number="8" />.
  It currently remains as the only obstacle to the construction of <fr:em>schemes of modules over the integers for curves of arbitrary degree</fr:em>, <fr:em>polarised abelian varieties</fr:em>, etc.
  That is to say, its solution deserves the efforts of specialists of algebraic groups.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2007</fr:anchor><fr:addr
type="user">fga3.iii-1</fr:addr><fr:route>fga3.iii-1.xml</fr:route><fr:title
text="Equivalence relations, effective equivalence relations">Equivalence relations, effective equivalence relations</fr:title><fr:authors /><fr:number>1</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> be a category, and <fr:tex
display="inline"><![CDATA[X]]></fr:tex> an object of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>.
  
  A pair of morphisms
  <fr:tex
display="block"><![CDATA[     p_1,p_2\colon  R\rightrightarrows  X,   ]]></fr:tex>
  is said to be an "<fr:em>equivalence pair</fr:em>" in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, with <fr:em>target</fr:em> <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and <fr:em>source</fr:em> <fr:tex
display="inline"><![CDATA[R]]></fr:tex>, if, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, the corresponding maps
  <fr:tex
display="block"><![CDATA[     p_1(T),p_2(T)\colon  R(T)\rightrightarrows  X(T)   ]]></fr:tex>
  (where we set <fr:tex
display="inline"><![CDATA[Y(T)=\operatorname {Hom}(T,Y)]]></fr:tex> for any object <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>) define a map
  <fr:tex
display="block"><![CDATA[     R(T)\to  X(T)\times  X(T)   ]]></fr:tex>
  that induces a bijection from <fr:tex
display="inline"><![CDATA[R(T)]]></fr:tex> to the graph of an equivalence relation on the set <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex>.
  We introduce an evident equivalence relation on equivalence pairs with target <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, and call an equivalence class an <fr:em>equivalence <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-relation</fr:em> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, or simply an equivalence relation if no confusion may arise.</fr:p><fr:p>If <fr:tex
display="inline"><![CDATA[X\times  X]]></fr:tex> exists, then the data of an equivalence relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is equivalent to the data of a sub-object <fr:tex
display="inline"><![CDATA[R]]></fr:tex> of <fr:tex
display="inline"><![CDATA[X\times  X]]></fr:tex> such that, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, the subset of <fr:tex
display="inline"><![CDATA[(X\times  X)(T)=X(T)\times  X(T)]]></fr:tex> that corresponds to <fr:tex
display="inline"><![CDATA[R(T)]]></fr:tex> is the graph of an equivalence relation on <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex>.
  Denoting the morphisms from <fr:tex
display="inline"><![CDATA[R]]></fr:tex> to <fr:tex
display="inline"><![CDATA[X]]></fr:tex> induced by the projections <fr:tex
display="inline"><![CDATA[\mathrm {pr}_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[\mathrm {pr}_2]]></fr:tex> by <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex> (respectively), the above condition says that <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is an equivalence pair.
  We can also express the axioms of a set-theoretical equivalence relation for the <fr:tex
display="inline"><![CDATA[R(T)]]></fr:tex> in the <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex> diagrammatically in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> (under the assumption that both <fr:tex
display="inline"><![CDATA[X\times  X]]></fr:tex> and the fibre product <fr:tex
display="inline"><![CDATA[(R,p_2)\times _X(R,p_1)]]></fr:tex> exist), following the general principle of <fr:link
type="local"
href="fga3.ii-a.1.xml"
addr="fga3.ii-a.1"
title="The existence theorem and the formal theory of modules › Representable and pro-representable functors › Representable functors">FGA 3.II, §A.1</fr:link>.
  We will not need this.</fr:p><fr:p>Every time that we have a pair of morphisms <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> with the same source <fr:tex
display="inline"><![CDATA[R]]></fr:tex> and the same target <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, we can define the <fr:em>cokernel</fr:em> of the pair as an object <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> that represents the contravariant (in <fr:tex
display="inline"><![CDATA[Z]]></fr:tex>) functor
  <fr:tex
display="block"><![CDATA[     \operatorname {Hom}_{p_1,p_2}(X,Z)   ]]></fr:tex>
  which denotes the set of morphisms <fr:tex
display="inline"><![CDATA[u]]></fr:tex> from <fr:tex
display="inline"><![CDATA[X]]></fr:tex> to <fr:tex
display="inline"><![CDATA[Z]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[up_1=up_2]]></fr:tex>.
  If <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> exists, then it is determined up to unique isomorphism.
  
  We will denote it by <fr:tex
display="inline"><![CDATA[Y/(p_1,p_2)]]></fr:tex>, or, by an abuse of notation, <fr:tex
display="inline"><![CDATA[Y/R]]></fr:tex>, with the latter mostly being used when <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is an equivalence pair: it is then common to identify, in notation, the equivalence relation defined by the pair with the one defined by <fr:tex
display="inline"><![CDATA[R]]></fr:tex>.
  Note that, if we consider <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> as a quotient of <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, then it depends only on the equivalence relation defined by the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex></fr:p><fr:p>We now start with a morphism
  <fr:tex
display="block"><![CDATA[     f\colon  X\to  Y   ]]></fr:tex>
  which allows us to consider <fr:tex
display="inline"><![CDATA[X]]></fr:tex> as an "object over <fr:tex
display="inline"><![CDATA[Y]]></fr:tex>", and we suppose that the fibre product
  <fr:tex
display="block"><![CDATA[     \mathcal {R}(f)     = X\times _Y X   ]]></fr:tex>
  exists.
  Let <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex> be its projections.
  Then <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is an equivalence pair, and is said to be <fr:em>associated</fr:em> with the morphism <fr:tex
display="inline"><![CDATA[f]]></fr:tex>.
  It thus defines an equivalence relation, which is said to be <fr:em>associated</fr:em> with the morphism <fr:tex
display="inline"><![CDATA[f]]></fr:tex>.</fr:p><fr:p>We say that a pair of morphisms <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> with target <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, and source <fr:tex
display="inline"><![CDATA[R]]></fr:tex>, is an <fr:em>effective equivalence pair</fr:em> if

  
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
    
 <html:li
style="list-style-type: &quot;i. &quot;">
      the cokernel <fr:tex
display="inline"><![CDATA[Y=X/(p_1,p_2)]]></fr:tex> exists ;
    </html:li>

    
 <html:li
style="list-style-type: &quot;ii. &quot;">
      the fibre product <fr:tex
display="inline"><![CDATA[X\times _Y X]]></fr:tex> exists ; and
    </html:li>

    
 <html:li
style="list-style-type: &quot;iii. &quot;">
      the morphism <fr:tex
display="inline"><![CDATA[R\to  X\times _Y X]]></fr:tex> with components <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex> is an isomorphism.
    </html:li>

  </html:ol>


  Then the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is indeed an equivalence pair.
  We also say that the equivalence relation that it defines is an <fr:em>effective equivalence relation</fr:em>.</fr:p><fr:p>We say that a morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is an <fr:em>effective epimorphism</fr:em> if

  
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
    
 <html:li
style="list-style-type: &quot;i. &quot;">
      the fibre product <fr:tex
display="inline"><![CDATA[R=X\times _Y X]]></fr:tex> exists ;
    </html:li>

    
 <html:li
style="list-style-type: &quot;ii. &quot;">
      the quotient <fr:tex
display="inline"><![CDATA[X/(p_1,p_2)]]></fr:tex> exists, where <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex> are the projections from <fr:tex
display="inline"><![CDATA[R]]></fr:tex> to <fr:tex
display="inline"><![CDATA[X]]></fr:tex> ; and
    </html:li>

    
 <html:li
style="list-style-type: &quot;iii. &quot;">
      the morphism <fr:tex
display="inline"><![CDATA[X/(p_1,p_2)\to  Y]]></fr:tex> induced by <fr:tex
display="inline"><![CDATA[f]]></fr:tex> is an isomorphism.
    </html:li>

  </html:ol>


  Then <fr:tex
display="inline"><![CDATA[f]]></fr:tex> is indeed an epimorphism, and even a strict epimorphism (cf.<fr:link
type="local"
href="fga3.i-a.2.c.xml"
addr="fga3.i-a.2.c"
title="Generalities, and descent by faithfully flat morphisms › Preliminaries on categories › Exact diagrams and strict epimorphisms, descent morphisms, and examples › ">FGA 3.I, §A.2.c</fr:link>), with the converse being true if the fibre product <fr:tex
display="inline"><![CDATA[X\times _Y X]]></fr:tex> exists.
  We also say that the quotient object of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> defined by the epimorphism <fr:tex
display="inline"><![CDATA[f]]></fr:tex> is an <fr:em>effective quotient</fr:em> of <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.</fr:p><fr:p>The above definitions imply the following "<fr:em>Galois correspondence</fr:em>":</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1598</fr:anchor><fr:addr
type="user">fga3.iii-1-proposition-1.1</fr:addr><fr:route>fga3.iii-1-proposition-1.1.xml</fr:route><fr:taxon>Proposition</fr:taxon><fr:authors /><fr:number>1.1</fr:number><fr:parent>fga3.iii-1</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>There is a bijective correspondence, respecting the natural orders, between the set of effective equivalence relations <fr:tex
display="inline"><![CDATA[R]]></fr:tex> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and the set of effective quotients <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> of <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, with such an <fr:tex
display="inline"><![CDATA[R]]></fr:tex> corresponding to the effective quotient <fr:tex
display="inline"><![CDATA[X/R]]></fr:tex>, and such a <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> corresponding to the effective equivalence relation defined by the canonical projection <fr:tex
display="inline"><![CDATA[X\to  Y]]></fr:tex> (which is defined by the fibre product <fr:tex
display="inline"><![CDATA[X\times _Y X]]></fr:tex> endowed with its two projections).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>In very nice categories (sets, sheaves of sets, etc.), every quotient is effective, and every equivalence relation is effective.
  This is no longer true in categories such as the category of preschemes over a given prescheme <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, not even if <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is the spectrum of field, nor even if we restrict to finite schemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
  The question of effectiveness, and even (in the case of non-finite preschemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>) the question of existence of quotients, more often than not turn out to be delicate.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2008</fr:anchor><fr:addr
type="user">fga3.iii-2</fr:addr><fr:route>fga3.iii-2.xml</fr:route><fr:title
text="Example: finite preschemes over S">Example: finite preschemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex></fr:title><fr:authors /><fr:number>2</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> be the category of finite preschemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, which is assumed to be locally Noetherian.
  Then <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> is equivalent to the opposite category of the category of coherent sheaves of commutative algebras on <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, or, if <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is affine of ring <fr:tex
display="inline"><![CDATA[A]]></fr:tex>, then it is equivalent to the opposite category of the category of finite <fr:tex
display="inline"><![CDATA[A]]></fr:tex>-algebras over <fr:tex
display="inline"><![CDATA[A]]></fr:tex> (i.e. those that are modules of finite type over <fr:tex
display="inline"><![CDATA[A]]></fr:tex>).
  We thus immediately conclude that, in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, finite projective limits and finite inductive limits exist.
  This is well known (without any finiteness hypotheses) for the former;
  the fibre product of preschemes <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> corresponds to the tensor product <fr:tex
display="inline"><![CDATA[B\otimes _A C]]></fr:tex> of corresponding algebras, and the kernel of two morphisms <fr:tex
display="inline"><![CDATA[X\rightrightarrows  Y]]></fr:tex>, defined by two <fr:tex
display="inline"><![CDATA[A]]></fr:tex>-algebra homomorphisms <fr:tex
display="inline"><![CDATA[u,v\colon  C\rightrightarrows  B]]></fr:tex>, corresponds to the quotient of <fr:tex
display="inline"><![CDATA[B]]></fr:tex> by the ideal generated by the <fr:tex
display="inline"><![CDATA[u(v)-v(c)]]></fr:tex>, etc.
  For finite inductive limits, it suffices to consider, on one hand, finite sums, which correspond to the ordinary product of <fr:tex
display="inline"><![CDATA[A]]></fr:tex>-algebras, and, on the other hand, cokernels of pairs of morphisms <fr:tex
display="inline"><![CDATA[X\rightrightarrows  Y]]></fr:tex>, which correspond (as we can immediately see) to the sub-ring of <fr:tex
display="inline"><![CDATA[C]]></fr:tex> given by elements where the homomorphisms <fr:tex
display="inline"><![CDATA[u,v\colon  C\rightrightarrows  B]]></fr:tex> agree (with this sub-ring being finite over <fr:tex
display="inline"><![CDATA[A]]></fr:tex> thanks to the Noetherian hypothesis).
  We also note that we can show, using the Noetherian hypothesis, that finite inductive limits, and, in particular, quotients, thus constructed in the category <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> of finite preschemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> are, in fact, quotients in the category of <fr:em>all</fr:em> preschemes.</fr:p><fr:p>As we mentioned in <fr:ref
addr="fga3.i"
href="fga3.i.xml"
taxon="FGA"
number="3.I" />, <fr:em>there are non-effective epimorphisms in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex></fr:em> (or even non-strict, which is the same, since fibre products exist).
  <fr:em>I do not know if equivalence relations are still effective</fr:em> if we have no flatness hypothesis.
  I have only obtained, in this direction, very partial, positive, results, that are vital for the proof of the fundamental theorem of the formal theory of modules (cf. <fr:link
type="local"
href="fga3.ii-b-theorem-1.xml"
addr="fga3.ii-b-theorem-1">FGA 3.II, §B, Theorem 1</fr:link>).
  We note that it is easy, in the given problem, to reduce to the case where <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is the spectrum of a local Artinian ring, with an algebraically closed residue field.
  But even if <fr:tex
display="inline"><![CDATA[A]]></fr:tex> is a field, the answer is not known.</fr:p><fr:p>We can also consider the case of a prescheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> that is no longer assumed to be finite over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, but by considering an equivalence relation <fr:tex
display="inline"><![CDATA[R]]></fr:tex> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[p_1\colon  R\to  X]]></fr:tex> is a finite morphism.
  We then say that <fr:tex
display="inline"><![CDATA[R]]></fr:tex> is a <fr:em>finite equivalence relation</fr:em>.
  Supposing, for simplicity, that <fr:tex
display="inline"><![CDATA[S]]></fr:tex> and <fr:tex
display="inline"><![CDATA[X]]></fr:tex> are affine (which implies that <fr:tex
display="inline"><![CDATA[R]]></fr:tex> is affine, so that the situation is reduced to one of pure commutative algebra), <fr:em>we do not know, even in this case, if there exists a quotient <fr:tex
display="inline"><![CDATA[X/R=Y]]></fr:tex>, and if the canonical morphism <fr:tex
display="inline"><![CDATA[X\to  Y]]></fr:tex> is finite</fr:em>.
  (The most simple case is that where we suppose that <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is the spectrum of a field <fr:tex
display="inline"><![CDATA[k]]></fr:tex>, and where <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is the spectrum of <fr:tex
display="inline"><![CDATA[k[t]]]></fr:tex>, i.e. the affine line).
  Of course, if the two problems above turn out to be true, then we can conclude that, in the situation described, <fr:tex
display="inline"><![CDATA[R]]></fr:tex> is effective.
  Note that the problem of <fr:em>existence</fr:em> of a quotient <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> and of the <fr:em>finiteness</fr:em> of <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> are stated in exactly the same terms if, instead of an equivalence graph in <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, we only have an equivalence pregraph in <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, in the sense of <fr:ref
addr="fga3.iii-4"
href="fga3.iii-4.xml"
number="4" />.</fr:p><fr:p>The question of passing to the quotient by a more or less arbitrary finite equivalence relation arises in the construction of preschemes by "gluing" given preschemes <fr:tex
display="inline"><![CDATA[X_i]]></fr:tex> along certain closed sub-preschemes;
  the gluing law is expressed precisely by a finite equivalence relation on the prescheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex> given by the sum of the <fr:tex
display="inline"><![CDATA[X_i]]></fr:tex>.
  We also expect that the solutions of the problems stated here, as well as of their many variations, will be a preliminary condition for the clarification of a general technique for non-projective constructions, in the direction introduced in <fr:ref
addr="fga3.ii"
href="fga3.ii.xml"
taxon="FGA"
number="3.II" />.</fr:p><fr:p>The only general positive fact known to the author is the following:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1765</fr:anchor><fr:addr
type="user">fga3.iii-2-proposition-2.1</fr:addr><fr:route>fga3.iii-2-proposition-2.1.xml</fr:route><fr:taxon>Proposition</fr:taxon><fr:authors /><fr:number>2.1</fr:number><fr:parent>fga3.iii-2</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be a locally Noetherian prescheme, <fr:tex
display="inline"><![CDATA[s]]></fr:tex> a point of <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[\Omega ]]></fr:tex> an algebraically closed extension of <fr:tex
display="inline"><![CDATA[k(s)]]></fr:tex>.
    
    Consider the corresponding "fibre functor" <fr:tex
display="inline"><![CDATA[F]]></fr:tex>, that associates, to any <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-scheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex> that is finite over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, the set of points of <fr:tex
display="inline"><![CDATA[X/S]]></fr:tex> with values in <fr:tex
display="inline"><![CDATA[\Omega ]]></fr:tex>.
    This functor (which is trivially left exact) is <fr:em>right exact</fr:em>, i.e. it commutes with finite inductive limits, and, in particular, with the cokernel of pairs of morphisms.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>By using this result for all the "geometric points" of <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, we thus deduce that the "quotient" category <fr:tex
display="inline"><![CDATA[\mathcal {C}']]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, given by arguing "modulo surjective radicial morphisms" (i.e. by formally adjoining inverses for such morphisms), is a "geometric" category, i.e. it satisfies the same "finite nature" properties as the category of sets.
  In particular, every equivalence relation is effective.
  This implies that, if <fr:tex
display="inline"><![CDATA[R]]></fr:tex> is an equivalence relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, where <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is finite over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, then the canonical morphism <fr:tex
display="inline"><![CDATA[R\to  X\times _Y X]]></fr:tex> (where <fr:tex
display="inline"><![CDATA[Y=X/R]]></fr:tex>) is <fr:em>radicial and surjective</fr:em> (and, in fact, a surjective closed immersion, since it is a monomorphism).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2009</fr:anchor><fr:addr
type="user">fga3.iii-3</fr:addr><fr:route>fga3.iii-3.xml</fr:route><fr:title
text="The case of a group with operators">The case of a group with operators</fr:title><fr:authors /><fr:number>3</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>We now suppose that <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> is an arbitrary category.
  Let <fr:tex
display="inline"><![CDATA[G]]></fr:tex> and <fr:tex
display="inline"><![CDATA[X]]></fr:tex> be objects of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, and suppose that <fr:tex
display="inline"><![CDATA[G]]></fr:tex> is a <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-group with operators on the object <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
  This implies (cf. <fr:link
type="local"
href="fga3.ii-a.1.xml"
addr="fga3.ii-a.1"
title="The existence theorem and the formal theory of modules › Representable and pro-representable functors › Representable functors">FGA 3.II, §A.1</fr:link>) that, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, we have a group structure on <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex>, and the structure of an operator domain on <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex> acting on <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex>, such that, for variable <fr:tex
display="inline"><![CDATA[T]]></fr:tex>, the structures in question "vary functorially" in <fr:tex
display="inline"><![CDATA[T]]></fr:tex>.
  If the products <fr:tex
display="inline"><![CDATA[G\times  G]]></fr:tex> and <fr:tex
display="inline"><![CDATA[G\times  X]]></fr:tex> exist in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, then such a structure can also be defined as a pair of morphisms
  <fr:tex
display="block"><![CDATA[     \begin {gathered}       G\times  G\to  G     \\\pi \colon  G\times  X\to  X     \end {gathered}   ]]></fr:tex>
  subject to the condition that, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, the corresponding composition laws for the sets <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex> and <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex> make <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex> into a group acting on <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex>.
  Translating this axiom into the commutativity of certain diagrams in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> is easy, but tedious, and, in fact, perfectly useless in all cases known to me.</fr:p><fr:p>Suppose that <fr:tex
display="inline"><![CDATA[G\times  X]]></fr:tex> exists, and consider the two morphisms
  <fr:tex
display="block"><![CDATA[     p_1,p_2\colon  G\times  X\rightrightarrows  X   ]]></fr:tex>
  
  with
  <fr:tex
display="block"><![CDATA[     \begin {aligned}       p_1 &= \mathrm {pr}_1     \\p_2 &= \pi .     \end {aligned}   ]]></fr:tex>
  We immediately note that the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is an equivalence pair if, and only if, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, the map
  <fr:tex
display="block"><![CDATA[     G(T)\times  X(T)     \sim  (G\times  X)(T) \to  X(T)\times  X(T)   ]]></fr:tex>
  defined by this pair is injective, i.e. if the group <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex> acts <fr:em>freely</fr:em> on the set <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex>, i.e. if <fr:tex
display="inline"><![CDATA[g\in  G(T)]]></fr:tex>, <fr:tex
display="inline"><![CDATA[x\in  X(T)]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[g\cdot  x=x]]></fr:tex>, then <fr:tex
display="inline"><![CDATA[g]]></fr:tex> is the identity element of the group <fr:tex
display="inline"><![CDATA[G(T)]]></fr:tex>.
  We then say that <fr:tex
display="inline"><![CDATA[G]]></fr:tex> <fr:em>acts freely</fr:em> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> (or that <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is a <fr:em>principal <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-space under <fr:tex
display="inline"><![CDATA[G]]></fr:tex></fr:em>).
  The equivalence relation associated to the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex> is then called the <fr:em>equivalence relation defined by the group <fr:tex
display="inline"><![CDATA[G]]></fr:tex></fr:em> acting freely on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
  If <fr:tex
display="inline"><![CDATA[X\times  X]]></fr:tex> also exists, and we consider the morphism
  <fr:tex
display="block"><![CDATA[     p\colon  G\times  X\to  X\times  X   ]]></fr:tex>
  defined by the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex>, then the condition that <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acts freely implies that <fr:tex
display="inline"><![CDATA[p]]></fr:tex> is a <fr:em>monomorphism</fr:em>.</fr:p><fr:p>Of course, even if <fr:tex
display="inline"><![CDATA[G]]></fr:tex> dose not act freely on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, we still wish to have existence criteria for a quotient of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> by <fr:tex
display="inline"><![CDATA[G]]></fr:tex>, i.e. for the cokernel of the above pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex>.</fr:p><fr:p>The cokernel in question will often be denoted by <fr:tex
display="inline"><![CDATA[X/G]]></fr:tex>, or by <fr:tex
display="inline"><![CDATA[X\backslash  G]]></fr:tex> if <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acts on the left (with the previous notation being reserved for when <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acts on the right).
  We note that, even if the "image" of <fr:tex
display="inline"><![CDATA[G\times  X]]></fr:tex> under <fr:tex
display="inline"><![CDATA[p]]></fr:tex> exists (this image being defined, for example, as the smallest sub-object of <fr:tex
display="inline"><![CDATA[X\times  X]]></fr:tex> through which we can factor <fr:tex
display="inline"><![CDATA[p]]></fr:tex>), say, <fr:tex
display="inline"><![CDATA[R]]></fr:tex>, then this is usually not an equivalence relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
  If we then try to pass directly to the quotient under <fr:tex
display="inline"><![CDATA[R]]></fr:tex> (or, more precisely, under the pair of morphisms from <fr:tex
display="inline"><![CDATA[R]]></fr:tex> to <fr:tex
display="inline"><![CDATA[X]]></fr:tex> induced by the two projections <fr:tex
display="inline"><![CDATA[\mathrm {pr}_i]]></fr:tex>), then we lose the particular characteristics of the original pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex>.
  It is thus important to find a generalisation of the notion of equivalence relations, appealing directly to the pair defined by a <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-group with operators.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2010</fr:anchor><fr:addr
type="user">fga3.iii-4</fr:addr><fr:route>fga3.iii-4.xml</fr:route><fr:title
text="Equivalence pre-relations">Equivalence pre-relations</fr:title><fr:authors /><fr:number>4</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Recall that a <fr:em>groupoid</fr:em> is defined to be a category where all the morphisms are isomorphisms.
  
  A category should be defined as consisting of two base sets, <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and <fr:tex
display="inline"><![CDATA[R]]></fr:tex>, with the former being the set of <fr:em>objects</fr:em> and the latter the set of <fr:em>arrows</fr:em>, endowed with the following structures:

  
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
    
 <html:li
style="list-style-type: &quot;i. &quot;">
      a pair of maps
      <fr:tex
display="block"><![CDATA[         p_1,p_2\colon  R\rightrightarrows  X       ]]></fr:tex>
      called the <fr:em>source map</fr:em> and the <fr:em>target map</fr:em> ;
    </html:li>

    
 <html:li
style="list-style-type: &quot;ii. &quot;">
      a map
      <fr:tex
display="block"><![CDATA[         \pi \colon (R,p_2)\times _X(R,p_1) \to  R       ]]></fr:tex>
      called the <fr:em>composition map</fr:em>.
    </html:li>

  </html:ol>


  These data should satisfy well-known axioms, which we will not repeat here, and which can be expressed in terms of the commutativity of certain diagrams along with the existence of a (necessarily unique) map <fr:tex
display="inline"><![CDATA[D\colon  X\to  R]]></fr:tex> that makes two other diagrams commute, where <fr:tex
display="inline"><![CDATA[D]]></fr:tex> corresponds to passing from an object to the corresponding identity map, and satisfies
  <fr:tex
display="block"><![CDATA[     p_1\circ  D = p_2\circ  D = \operatorname {id}_X.   ]]></fr:tex>
  To say that a category is a groupoid then, implies the existence of a (necessarily unique) map
  <fr:tex
display="block"><![CDATA[     s\colon  R\to  R   ]]></fr:tex>
  called the <fr:em>symmetry</fr:em> of <fr:tex
display="inline"><![CDATA[R]]></fr:tex>, that sends every arrow to an inverse arrow, which can be expressed in terms of the commutativity of four other diagrams, built from <fr:tex
display="inline"><![CDATA[s]]></fr:tex>, <fr:tex
display="inline"><![CDATA[\Delta ]]></fr:tex>, and the above data, and of which the first two can be written as
  <fr:tex
display="block"><![CDATA[     \begin {aligned}       p_1\circ  s &= p_2     \\p_2\circ  s &= p_1.     \end {aligned}   ]]></fr:tex></fr:p><fr:p>Having recalled these notions, the general definitions in <fr:link
type="local"
href="fga3.ii-a.1.xml"
addr="fga3.ii-a.1"
title="The existence theorem and the formal theory of modules › Representable and pro-representable functors › Representable functors">FGA 3.II, §A.1</fr:link> show, in particular, what we should mean by "the structure of a <fr:em><fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-category</fr:em>" (resp. <fr:em><fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-groupoid</fr:em>) on a pair of objects <fr:tex
display="inline"><![CDATA[(X,R)]]></fr:tex> of an arbitrary category <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>:
  it is, by definition, the data, for every object <fr:tex
display="inline"><![CDATA[T]]></fr:tex> in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>, of the structure of a category (resp. groupoid) in the set-theoretic sense, whose set of objects is <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex>, and set of arrows is <fr:tex
display="inline"><![CDATA[R(T)]]></fr:tex>, with these structures "varying functorially" in <fr:tex
display="inline"><![CDATA[T]]></fr:tex>.
  This thus implies the definition of two morphisms
  <fr:tex
display="block"><![CDATA[     p_1,p_2\colon  R\rightrightarrows  X   ]]></fr:tex>
  
  called the <fr:em>source morphism</fr:em> and the <fr:em>target morphism</fr:em>, and, if the fibre product in question exists, a morphism
  <fr:tex
display="block"><![CDATA[     \pi \colon  (R,p_2)\times _X(R,p_1) \to  R   ]]></fr:tex>
  called the <fr:em>composition morphism</fr:em>;
  these three morphisms then suffice to determine the structure of a category (resp. groupoid) on <fr:tex
display="inline"><![CDATA[(X,R)]]></fr:tex>, with the condition to place on them being the following: for every <fr:tex
display="inline"><![CDATA[T]]></fr:tex>, the three corresponding morphisms for <fr:tex
display="inline"><![CDATA[X(T)]]></fr:tex> and <fr:tex
display="inline"><![CDATA[R(T)]]></fr:tex> define the structure of a category (resp. groupoid) on the pair of sets <fr:tex
display="inline"><![CDATA[(X(T),R(T))]]></fr:tex>.
  If necessary, this can be expressed in terms of the commutativity of certain diagrams, implying a well-determined morphism
  <fr:tex
display="block"><![CDATA[     D\colon  X\to  R   ]]></fr:tex>
  and, in the case of groupoids, a well-determined morphism
  <fr:tex
display="block"><![CDATA[     s\colon  R\to  R   ]]></fr:tex>
  where the diagrams are as in the "set-theoretic" case.
  This tedious interpretation of the axioms is thankfully useless in practice, with the only theoretical interest in the possibility of being able to express the data and the axioms using morphisms and equalities of morphisms between certain fibre products being the following: if we have a left-exact functor <fr:tex
display="inline"><![CDATA[F\colon \mathcal {C}\to \mathcal {C}']]></fr:tex> (i.e. a functor that commutes with finite products and fibre products), then it sends <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-categories (resp. <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-groupoids) to a <fr:tex
display="inline"><![CDATA[\mathcal {C}']]></fr:tex>-categories (resp. <fr:tex
display="inline"><![CDATA[\mathcal {C}']]></fr:tex>-groupoids) (under the condition that finite products and fibre products exist in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>).</fr:p><fr:p>It is important, in practice, to know how to understand the morphisms <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex>, <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex>, <fr:tex
display="inline"><![CDATA[\pi ]]></fr:tex>, <fr:tex
display="inline"><![CDATA[D]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[s]]></fr:tex> as <fr:em>simplicial operations</fr:em> in a suitable semi-simplicial or simplicial objects of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> (or, at least when fibre products exist in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>).
  To fix terminology, we introduce the category <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> of <fr:em>simplex types</fr:em> as the category whose objects are finite sets of the form
  <fr:tex
display="block"><![CDATA[     \Delta _n     = [0,n]   ]]></fr:tex>
  for <fr:tex
display="inline"><![CDATA[n\in \mathbb {Z}]]></fr:tex>, where <fr:tex
display="inline"><![CDATA[[0,n]]]></fr:tex> denotes the interval of integers from <fr:tex
display="inline"><![CDATA[0]]></fr:tex> to <fr:tex
display="inline"><![CDATA[n]]></fr:tex> (inclusive), and whose morphisms are <fr:em>arbitrary maps</fr:em> between these finite sets.
  We note that the category <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> is equivalent to the category of <fr:em>non-empty</fr:em> finite sets, where we take the morphisms to be maps between finite sets.
  In <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex>, the sum of a <fr:em>non-empty</fr:em> finite family of objects clearly exists, as does the amalgamated sum of two objects over a third (the dual operation to the fibre product).
  We denote by <fr:tex
display="inline"><![CDATA[\mathcal {S}']]></fr:tex> the subcategory of <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> that has the same objects, but where the morphisms are <fr:em>increasing maps</fr:em> between the <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex>.
  This category is equivalent to the category of non-empty finite totally ordered sets.
  
  In this category, the sum of two objects never exists, and the amalgamated sum of two objects <fr:tex
display="inline"><![CDATA[A]]></fr:tex> and <fr:tex
display="inline"><![CDATA[B]]></fr:tex> over a third <fr:tex
display="inline"><![CDATA[C]]></fr:tex> does not exist in general (take, for example, <fr:tex
display="inline"><![CDATA[C=\Delta _0]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[A=B=\Delta _1]]></fr:tex>, with the two structure maps <fr:tex
display="inline"><![CDATA[u\colon  C\to  A]]></fr:tex> and <fr:tex
display="inline"><![CDATA[v\colon  C\to  B]]></fr:tex> being the equal).
  However, in certain cases, the amalgamated sum <fr:em>does</fr:em> exist;
  consider
  <fr:tex
display="block"><![CDATA[     \begin {gathered}       A = \Delta _m       \qquad  B = \Delta _n       \qquad  C = \Delta _0     \\u(0) = m       \qquad  v(0) = 0     \end {gathered}   ]]></fr:tex>
  which is such that
  <fr:tex
display="block"><![CDATA[     A\coprod _C B     = \Delta _{m+n}.   ]]></fr:tex></fr:p><fr:p>A <fr:em>simplicial object</fr:em> (resp. <fr:em>semi-simplicial object</fr:em>) in a category <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> is defined to be a contravariant functor <fr:tex
display="inline"><![CDATA[K]]></fr:tex> from <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\mathcal {S}']]></fr:tex>) to <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>.
  A simplicial object thus defines a semi-simplicial object by restriction, but the former differs from the latter essentially by the presence of <fr:em>symmetry operations</fr:em> in the <fr:tex
display="inline"><![CDATA[K_n=K(\Delta _n)]]></fr:tex>, which correspond to the images under the functor <fr:tex
display="inline"><![CDATA[K]]></fr:tex> of the elements of the symmetric group on <fr:tex
display="inline"><![CDATA[n+1]]></fr:tex> elements (considered as the automorphism group of <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex> in <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex>).</fr:p><fr:p>With the above, for all <fr:tex
display="inline"><![CDATA[n]]></fr:tex>, let <fr:tex
display="inline"><![CDATA[\Delta '_n]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\Delta ''_n]]></fr:tex>) be the finite category whose set of objects is <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex>, and whose set of arrows is defined by the "chaotic order" relation (resp. the natural total order relation) on <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex> (i.e. the set of arrows is the graph of the order relation).
  It is clear that <fr:tex
display="inline"><![CDATA[\Delta '_n]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\Delta ''_n]]></fr:tex>) depends functorially on the object <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\mathcal {S}']]></fr:tex>).
  So if <fr:tex
display="inline"><![CDATA[Z]]></fr:tex> is a category, then <fr:tex
display="inline"><![CDATA[\operatorname {Hom}(\Delta '_n,Z)]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\operatorname {Hom}(\Delta ''_n,Z)]]></fr:tex>) is, for varying <fr:tex
display="inline"><![CDATA[\Delta _n]]></fr:tex>, a functor from the category <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[\mathcal {S}']]></fr:tex>) to the category of sets, i.e. a <fr:em>simplicial set</fr:em> (resp. <fr:em>semi-simplicial set</fr:em>), which is said to be <fr:em>associated to the category <fr:tex
display="inline"><![CDATA[Z]]></fr:tex></fr:em>, and denoted by <fr:tex
display="inline"><![CDATA[Z']]></fr:tex> (resp. <fr:tex
display="inline"><![CDATA[Z'']]></fr:tex>).
  We also have an obvious natural homomorphism from the semi-simplicial set associated to <fr:tex
display="inline"><![CDATA[Z']]></fr:tex> to <fr:tex
display="inline"><![CDATA[Z'']]></fr:tex>, and this is an isomorphism if and only if <fr:tex
display="inline"><![CDATA[Z]]></fr:tex> is a groupoid.
  Then:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1863</fr:anchor><fr:addr
type="user">fga3.iii-4-proposition-4.1</fr:addr><fr:route>fga3.iii-4-proposition-4.1.xml</fr:route><fr:taxon>Proposition</fr:taxon><fr:authors /><fr:number>4.1</fr:number><fr:parent>fga3.iii-4</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The functor <fr:tex
display="inline"><![CDATA[Z\mapsto  Z'']]></fr:tex> from the category of categories to the category of semi-simplicial sets is fully faithful, and defines an equivalence between the category of <fr:em>categories</fr:em> and the category of semi-simplicial sets, i.e. contravariant functors <fr:tex
display="inline"><![CDATA[K]]></fr:tex> from <fr:tex
display="inline"><![CDATA[\mathcal {S}']]></fr:tex> to <fr:tex
display="inline"><![CDATA[\mathtt {Set}]]></fr:tex> <fr:em>that send amalgamated sums <fr:tex
display="inline"><![CDATA[A\coprod _C B]]></fr:tex> (of the type described above) to fibre products of sets</fr:em>.</fr:p><fr:p>Similarly, the functor <fr:tex
display="inline"><![CDATA[Z\mapsto  Z']]></fr:tex> from the category of groupoids to the category of simplicial sets is fully faithful, and defines an equivalence between the category of <fr:em>groupoids</fr:em> and the category of simplicial sets, i.e. contravariant functors <fr:tex
display="inline"><![CDATA[K]]></fr:tex> from <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex> to <fr:tex
display="inline"><![CDATA[\mathtt {Set}]]></fr:tex> <fr:em>that send amalgamated sums to fibre products</fr:em>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>We can thus consider categories as specific examples of semi-simplicial sets, and groupoids as specific examples of simplicial sets, with, of course, the condition that we argue "up to isomorphism", as is rigorous when we interpret certain structures in terms of others.
  The usual procedure of reduction to the set-theoretic case then implies:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1864</fr:anchor><fr:addr
type="user">fga3.iii-4-corollary-4.2</fr:addr><fr:route>fga3.iii-4-corollary-4.2.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>4.2</fr:number><fr:parent>fga3.iii-4</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The above claim remains true when we replace categories, groupoids, and simplicial sets with <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-categories, <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-groupoids, and <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-simplicial objects (respectively), <fr:em>provided that</fr:em> fibre products exist in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>The semi-simplicial object <fr:tex
display="inline"><![CDATA[K]]></fr:tex> in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> associated to a category <fr:tex
display="inline"><![CDATA[(X,R,\ldots )]]></fr:tex> in <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> can be made explicit by considering the component <fr:tex
display="inline"><![CDATA[K_n=K(\Delta _n)]]></fr:tex> of <fr:tex
display="inline"><![CDATA[K]]></fr:tex> as being the <fr:tex
display="inline"><![CDATA[(n+1)]]></fr:tex>-th fibre product of <fr:tex
display="inline"><![CDATA[(R,p_1)]]></fr:tex> over <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, or, even better, by the inductive formula
  <fr:tex
display="block"><![CDATA[     \begin {aligned}       K_0 &= R     \\K_n &= (K_{n-1},p_n^{(n-1)})\times _X(R,p_1)     \end {aligned}   ]]></fr:tex>
  where the <fr:tex
display="inline"><![CDATA[p_i^{(n-1)}]]></fr:tex> (for <fr:tex
display="inline"><![CDATA[0<i<n-1]]></fr:tex>) are the natural projections from <fr:tex
display="inline"><![CDATA[K_{n-1}]]></fr:tex> to <fr:tex
display="inline"><![CDATA[X]]></fr:tex> (which can also be defined inductively).
  In this way, <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex>, <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex>, <fr:tex
display="inline"><![CDATA[\pi ]]></fr:tex>, <fr:tex
display="inline"><![CDATA[D]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[s]]></fr:tex> can be understood as simplicial operations that correspond to morphisms in <fr:tex
display="inline"><![CDATA[\mathcal {S}]]></fr:tex>, namely: the <fr:tex
display="inline"><![CDATA[0]]></fr:tex> face of <fr:tex
display="inline"><![CDATA[\Delta _1]]></fr:tex>, the <fr:tex
display="inline"><![CDATA[1]]></fr:tex> face of <fr:tex
display="inline"><![CDATA[\Delta _1]]></fr:tex>, the <fr:tex
display="inline"><![CDATA[(0,2)]]></fr:tex> face of <fr:tex
display="inline"><![CDATA[\Delta _2]]></fr:tex>, the degeneracy <fr:tex
display="inline"><![CDATA[\Delta _1\to \Delta _0]]></fr:tex>, and the symmetry of <fr:tex
display="inline"><![CDATA[\Delta _1]]></fr:tex> (respectively).
  Every other semi-simplicial (resp. simplicial) operation can be formally obtained from the four (resp. five) aforementioned operations by composition and fibre products.</fr:p><fr:p>We now define an <fr:em>equivalence pre-relation</fr:em> on an object <fr:tex
display="inline"><![CDATA[X]]></fr:tex> of a category to be the data of a groupoid whose object of objects is <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
  Such a data gives, amongst other things, an object <fr:tex
display="inline"><![CDATA[R]]></fr:tex> along with two morphisms
  <fr:tex
display="block"><![CDATA[     p_1,p_2\colon  R\rightrightarrows  X.   ]]></fr:tex>
  But we note that only these data alone do not determine the structure in question, contrary to what happens for equivalence pairs.
  In this talk, we are interested in this notion with the aim of obtaining criteria for the possibility of passing to the quotient, i.e. for being able to form the cokernel of the pair <fr:tex
display="inline"><![CDATA[(p_1,p_2)]]></fr:tex>.
  The statement of this problem thus makes no reference to the additional data inherent to a groupoid.
  
  In the proof of the results that will follow, we will, however, make use of this additional data, and, in particular, of the simplicial operations (including the symmetry operations) up to dimension <fr:tex
display="inline"><![CDATA[3]]></fr:tex> (the fourth fibre power of <fr:tex
display="inline"><![CDATA[R]]></fr:tex> over <fr:tex
display="inline"><![CDATA[X]]></fr:tex> will appear).</fr:p><fr:p>An equivalence relation on an object <fr:tex
display="inline"><![CDATA[X]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> defines an equivalence pre-relation: it suffices to show this in the set-theoretic case, and we then associate, to an equivalence relation on a set <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, the groupoid whose set of objects is <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, and whose set of arrows is the graph set of the equivalence relation.</fr:p><fr:p>A <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-monoid <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acting on an object <fr:tex
display="inline"><![CDATA[X]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex> defines a <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-category whose basic objects are <fr:tex
display="inline"><![CDATA[R=G\times  X]]></fr:tex> and <fr:tex
display="inline"><![CDATA[X]]></fr:tex> (under the condition that <fr:tex
display="inline"><![CDATA[G\times  X]]></fr:tex> exists), and that is a <fr:tex
display="inline"><![CDATA[\mathcal {C}]]></fr:tex>-groupoid if and only if <fr:tex
display="inline"><![CDATA[G]]></fr:tex> is a group.
  It again suffices to prove this in the set-theoretic case.
  We then define the composition of arrows <fr:tex
display="inline"><![CDATA[(g,a)]]></fr:tex> and <fr:tex
display="inline"><![CDATA[(g',g\cdot  a)]]></fr:tex> as being
  <fr:tex
display="block"><![CDATA[     (g',g\cdot  a) \circ  (g,a)     = (g'g,a)   ]]></fr:tex>
  i.e. if <fr:tex
display="inline"><![CDATA[a,b\in  X]]></fr:tex> then <fr:tex
display="inline"><![CDATA[\operatorname {Hom}(a,b)]]></fr:tex> is, by definition, the transporter of <fr:tex
display="inline"><![CDATA[a]]></fr:tex> to <fr:tex
display="inline"><![CDATA[b]]></fr:tex>, and morphisms compose thanks to the composition of elements of <fr:tex
display="inline"><![CDATA[G]]></fr:tex>.</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1865</fr:anchor><fr:addr
type="user">fga3.iii-4-remark</fr:addr><fr:route>fga3.iii-4-remark.xml</fr:route><fr:taxon>Remark</fr:taxon><fr:authors /><fr:parent>fga3.iii-4</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>We can avoid the logical difficulties that arise in a statement such as <fr:ref
addr="fga3.iii-4-proposition-4.1"
href="fga3.iii-4-proposition-4.1.xml"
taxon="Proposition"
number="4.1" /> by implicitly assuming that all the objects in question can be found in a fixed "universe" (that is itself a set).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2011</fr:anchor><fr:addr
type="user">fga3.iii-5</fr:addr><fr:route>fga3.iii-5.xml</fr:route><fr:title
text="Quotient by a finite and flat equivalence relation">Quotient by a finite and flat equivalence relation</fr:title><fr:authors /><fr:number>5</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1874</fr:anchor><fr:addr
type="user">fga3.iii-5-theorem-5.1</fr:addr><fr:route>fga3.iii-5-theorem-5.1.xml</fr:route><fr:taxon>Theorem</fr:taxon><fr:authors /><fr:number>5.1</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[X=\operatorname {Spec}(B)]]></fr:tex> be an affine scheme, <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> an equivalence pre-relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, whose component <fr:tex
display="inline"><![CDATA[R_1]]></fr:tex> is affine: say, <fr:tex
display="inline"><![CDATA[R_1=\operatorname {Spec}(C)]]></fr:tex>.
    We suppose that the first projection <fr:tex
display="inline"><![CDATA[p_1\colon  R_1\to  X]]></fr:tex> is a finite and locally free morphism, i.e. that the corresponding homomorphism of rings <fr:tex
display="inline"><![CDATA[p'_1\colon  B\to  C]]></fr:tex> makes <fr:tex
display="inline"><![CDATA[C]]></fr:tex> a projective <fr:tex
display="inline"><![CDATA[B]]></fr:tex>-module of finite type.
    Let <fr:tex
display="inline"><![CDATA[A]]></fr:tex> be the subring of <fr:tex
display="inline"><![CDATA[B]]></fr:tex> given by the kernel of the pair of homomorphisms <fr:tex
display="inline"><![CDATA[p'_1,p'_2\colon  B\rightrightarrows  C]]></fr:tex> (i.e. the set of elements <fr:tex
display="inline"><![CDATA[b]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[p'_1(b)=p'_2(b)]]></fr:tex>).
    Let <fr:tex
display="inline"><![CDATA[Y=\operatorname {Spec}(A)]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> the morphism defined by the embedding of <fr:tex
display="inline"><![CDATA[A]]></fr:tex> into <fr:tex
display="inline"><![CDATA[B]]></fr:tex>.
    
    Under these conditions:

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;i. &quot;">
        <fr:tex
display="inline"><![CDATA[B]]></fr:tex> is integral over <fr:tex
display="inline"><![CDATA[A]]></fr:tex>, i.e. <fr:tex
display="inline"><![CDATA[f]]></fr:tex> is an integral morphism.
      </html:li>


      
 <html:li
style="list-style-type: &quot;ii. &quot;">
        The morphism <fr:tex
display="inline"><![CDATA[f]]></fr:tex> is surjective, and its fibres are the set-theoretic equivalence classes <fr:tex
display="inline"><![CDATA[p_2(p_1^{-1}(x))]]></fr:tex> in <fr:tex
display="inline"><![CDATA[X]]></fr:tex> modulo <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, and the topology of <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is the quotient of that of <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
      </html:li>


      
 <html:li
style="list-style-type: &quot;iii. &quot;">
        <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is the quotient of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> by <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> in the category of preschemes.
      </html:li>


      
 <html:li
style="list-style-type: &quot;iv. &quot;">
        If <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence <fr:em>relation</fr:em>, then the morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is finite and locally free (i.e. <fr:tex
display="inline"><![CDATA[B]]></fr:tex> is a projective <fr:tex
display="inline"><![CDATA[A]]></fr:tex>-module of finite type), and the equivalence relation is effective, i.e. <fr:tex
display="inline"><![CDATA[R_1\to  X\times _Y X]]></fr:tex> is an isomorphism.
      </html:li>

    </html:ol></fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>This theorem generalises the well-known theorem concerning the case of a finite group <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acting by automorphisms on the ring <fr:tex
display="inline"><![CDATA[B]]></fr:tex>, and with ring <fr:tex
display="inline"><![CDATA[A]]></fr:tex> of invariants, and the proof is analogous to the known proof.
  We can make (iii) more precise as follows:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1880</fr:anchor><fr:addr
type="user">fga3.iii-5-corollary-5.2</fr:addr><fr:route>fga3.iii-5-corollary-5.2.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>5.2</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The canonical morphism <fr:tex
display="inline"><![CDATA[R_1\to  X\times _Y X]]></fr:tex> is <fr:em>surjective</fr:em>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>Let <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> continue to be a "finite and locally free" equivalence pre-relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, but with <fr:tex
display="inline"><![CDATA[X]]></fr:tex> now being an arbitrary prescheme.
  Suppose that we can find a prescheme <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> and a morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[fp_1=fp_2]]></fr:tex>, and further such that the sequence
  <fr:tex
display="block"><![CDATA[     \mathcal {O}_Y \to  f_*(\mathcal {O}_X) \rightrightarrows  g_*(\mathcal {O}_R)   ]]></fr:tex>
  of homomorphisms of sheaves of rings on <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is exact (where <fr:tex
display="inline"><![CDATA[g=fp_i]]></fr:tex>).
  It then follows from the theorem that we have conclusions (i) to (iv) analogous to those of the theorem, and, in particular, by (iii), <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is the quotient of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> by <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, and thus determined up to unique isomorphism.
  Under these conditions, we say that the equivalence pre-relation <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is <fr:em>admissible</fr:em>.
  With this definition:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1881</fr:anchor><fr:addr
type="user">fga3.iii-5-theorem-5.3</fr:addr><fr:route>fga3.iii-5-theorem-5.3.xml</fr:route><fr:taxon>Theorem</fr:taxon><fr:authors /><fr:number>5.3</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[X]]></fr:tex> be a prescheme, and <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> an equivalence pre-relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[p_1\colon  R_1\to  X]]></fr:tex> is a finite and locally free morphism.
    For <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> to be admissible, it is necessary and sufficient that every set-theoretic equivalence class <fr:tex
display="inline"><![CDATA[p_2(p_1^{-1}(x))]]></fr:tex> in <fr:tex
display="inline"><![CDATA[X]]></fr:tex> modulo <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> be contained in an affine open subset (a condition that is always satisfied if every finite subset of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is contained in an affine open subset, for example if <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is quasi-projective over an affine scheme).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>We can in fact easily show that every equivalence class modulo <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> in <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is then contained in an affine open subset that is <fr:em>stable</fr:em> under <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, and we construct the quotient <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> by gluing the pieces obtained by applying <fr:ref
addr="fga3.iii-5-theorem-5.1"
href="fga3.iii-5-theorem-5.1.xml"
taxon="Theorem"
number="5.1" />.</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1882</fr:anchor><fr:addr
type="user">fga3.iii-5-corollary-5.4</fr:addr><fr:route>fga3.iii-5-corollary-5.4.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>5.4</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Suppose that this condition is satisfied, and, further, that <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence relation.
    Then the equivalence relation is question is effective, i.e. <fr:tex
display="inline"><![CDATA[R_1\to  X\times _Y X]]></fr:tex> is an isomorphism, and <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is a finite and locally free morphism.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>We then immediately conclude, by descent, the following:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1883</fr:anchor><fr:addr
type="user">fga3.iii-5-corollary-5.5</fr:addr><fr:route>fga3.iii-5-corollary-5.5.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>5.5</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Under the conditions of <fr:ref
addr="fga3.iii-5-corollary-5.4"
href="fga3.iii-5-corollary-5.4.xml"
taxon="Corollary"
number="5.4" />, for <fr:tex
display="inline"><![CDATA[X]]></fr:tex> to be everywhere of rank <fr:tex
display="inline"><![CDATA[n]]></fr:tex> over <fr:tex
display="inline"><![CDATA[Y]]></fr:tex>, it is necessary and sufficient that <fr:tex
display="inline"><![CDATA[(R_1,p_1)]]></fr:tex> be everywhere of rank <fr:tex
display="inline"><![CDATA[n]]></fr:tex> over <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
    If <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and <fr:tex
display="inline"><![CDATA[R_1]]></fr:tex> are <fr:tex
display="inline"><![CDATA[Z]]></fr:tex>-preschemes, and <fr:tex
display="inline"><![CDATA[p_1]]></fr:tex> and <fr:tex
display="inline"><![CDATA[p_2]]></fr:tex> are <fr:tex
display="inline"><![CDATA[Z]]></fr:tex>-morphisms (and thus <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> a <fr:tex
display="inline"><![CDATA[Z]]></fr:tex>-prescheme), then <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is flat over <fr:tex
display="inline"><![CDATA[Z]]></fr:tex> if and only if <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is flat over <fr:tex
display="inline"><![CDATA[Z]]></fr:tex>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>In summary:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1884</fr:anchor><fr:addr
type="user">fga3.iii-5-scholium</fr:addr><fr:route>fga3.iii-5-scholium.xml</fr:route><fr:taxon>Scholium</fr:taxon><fr:authors /><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The data of a finite, locally free, and surjective morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> of preschemes is equivalent to the data of a prescheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex> endowed with an equivalence relation <fr:tex
display="inline"><![CDATA[R]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[p_1\colon  R\to  X]]></fr:tex> is finite and locally free, and such that every class <fr:tex
display="inline"><![CDATA[p_2(p_1^{-1}(x))]]></fr:tex> is contained in an affine open subset.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1885</fr:anchor><fr:addr
type="user">fga3.iii-5-remarks-5.6</fr:addr><fr:route>fga3.iii-5-remarks-5.6.xml</fr:route><fr:taxon>Remarks</fr:taxon><fr:authors /><fr:number>5.6</fr:number><fr:parent>fga3.iii-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:ol><fr:li>We have not needed to make any Noetherian hypothesis.</fr:li>

    <fr:li>This idea of passing to the quotient contains, as a particular case, the "inseparable descent" of Cartier, which corresponds to the determination of finite and locally free morphisms <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[f_*(\mathcal {O}_X)]]></fr:tex> admits a <fr:tex
display="inline"><![CDATA[p]]></fr:tex>-basis with respect to <fr:tex
display="inline"><![CDATA[\mathcal {O}_Y]]></fr:tex> (where <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is a given prescheme whose sheaf <fr:tex
display="inline"><![CDATA[\mathcal {O}_X]]></fr:tex> is annihilated by the prime number <fr:tex
display="inline"><![CDATA[p>0]]></fr:tex>).
      We note that this result can also be easily expressed without any regularity hypothesis on the local rings, and without supposing that <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is an algebraic scheme over a field.
      The theory of Jacobson–Bourbaki is obtained by taking <fr:tex
display="inline"><![CDATA[X]]></fr:tex> to be the spectrum of a field of characteristic <fr:tex
display="inline"><![CDATA[p]]></fr:tex>.</fr:li>

    <fr:li>Gabriel had already obtained a particular case of <fr:ref
addr="fga3.iii-5-theorem-5.3"
href="fga3.iii-5-theorem-5.3.xml"
taxon="Theorem"
number="5.3" /> in the theory of passing to the quotient for finite commutative groups over a field <fr:tex
display="inline"><![CDATA[k]]></fr:tex>.
      (Compare with <fr:ref
addr="fga3.iii-7-corollary-7.4"
href="fga3.iii-7-corollary-7.4.xml"
taxon="Corollary"
number="7.4" />).</fr:li></fr:ol></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2012</fr:anchor><fr:addr
type="user">fga3.iii-6</fr:addr><fr:route>fga3.iii-6.xml</fr:route><fr:title
text="Quotient by a proper and flat equivalence relation">Quotient by a proper and flat equivalence relation</fr:title><fr:authors /><fr:number>6</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1915</fr:anchor><fr:addr
type="user">fga3.iii-6-theorem-6.1</fr:addr><fr:route>fga3.iii-6-theorem-6.1.xml</fr:route><fr:taxon>Theorem</fr:taxon><fr:authors /><fr:number>6.1</fr:number><fr:parent>fga3.iii-6</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be a <fr:em>locally Noetherian</fr:em> prescheme, <fr:tex
display="inline"><![CDATA[X]]></fr:tex> a <fr:em>quasi-projective</fr:em> <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-scheme, and <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> an equivalence pre-relation on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>, such that:

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;a. &quot;">
        <fr:tex
display="inline"><![CDATA[p_1\colon  R_1\to  X]]></fr:tex> is proper and flat; and
      </html:li>


      
 <html:li
style="list-style-type: &quot;b. &quot;">
        <fr:tex
display="inline"><![CDATA[R_1\to  X\times _S X]]></fr:tex> is a finite morphism (or, equivalently, by (a), a morphism with finite fibres, which is a condition that is automatically satisfied if <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence relation).
      </html:li>

    </html:ol>


    Under these conditions:

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;i. &quot;">
        <fr:tex
display="inline"><![CDATA[Y=X/\mathcal {R}]]></fr:tex> exists, and (if <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is Noetherian) is quasi-projective over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
         (<fr:em>[Trans.] <fr:em>[Comp.]</fr:em> The fact that <fr:tex
display="inline"><![CDATA[Y=X/\mathcal {R}]]></fr:tex> is quasi-projective over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> has only been proven, for now, in the case where <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence relation.</fr:em>)
      </html:li>


      
 <html:li
style="list-style-type: &quot;ii. &quot;">
        The canonical morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is surjective, proper, and open, and its fibres are the equivalence classes <fr:tex
display="inline"><![CDATA[p_2(p_1^{-1}(x))]]></fr:tex> in <fr:tex
display="inline"><![CDATA[X]]></fr:tex> modulo <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, and so <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> can be identified with the topological quotient space of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> by the set-theoretic equivalence relation defined by <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>.
        Finally, <fr:tex
display="inline"><![CDATA[R_1\to  X\times _Y X]]></fr:tex> is surjective.
      </html:li>


      
 <html:li
style="list-style-type: &quot;iii. &quot;">
        If <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence relation, then the equivalence relation in question is effective, i.e. <fr:tex
display="inline"><![CDATA[R_1\to  X\times _Y X]]></fr:tex> is an isomorphism, and, further, <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is flat (and thus faithfully flat).
      </html:li>

    </html:ol></fr:p>
  
    
    <fr:tree
toc="false"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1908</fr:anchor><fr:addr
type="machine">#261</fr:addr><fr:route>unstable-261.xml</fr:route><fr:taxon>Proof</fr:taxon><fr:authors /><fr:parent>fga3.iii-6-theorem-6.1</fr:parent></fr:frontmatter><fr:mainmatter>
    <fr:p>For the proof, we can reduce to <fr:ref
addr="fga3.iii-5-theorem-5.1"
href="fga3.iii-5-theorem-5.1.xml"
taxon="Theorem"
number="5.1" /> by considering suitable quasi-sections of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> for <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, with the proof being analogous to the construction of algebraic quotient groups in the <fr:em>Séminaire Chevalley</fr:em>.</fr:p>
  </fr:mainmatter><fr:backmatter /></fr:tree>
  
</fr:mainmatter><fr:backmatter /></fr:tree><fr:p>In summary:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1916</fr:anchor><fr:addr
type="user">fga3.iii-6-scholium</fr:addr><fr:route>fga3.iii-6-scholium.xml</fr:route><fr:taxon>Scholium</fr:taxon><fr:authors /><fr:parent>fga3.iii-6</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[X]]></fr:tex> be quasi-projective over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, with <fr:tex
display="inline"><![CDATA[S]]></fr:tex> locally Noetherian.
    Then the data of a proper, faithfully flat, and surjective morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> from <fr:tex
display="inline"><![CDATA[X]]></fr:tex> to an <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-prescheme <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is equivalent to the data of an equivalence relation <fr:tex
display="inline"><![CDATA[R]]></fr:tex> on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[p_1\colon  R\to  X]]></fr:tex> is proper and flat.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>The same method gives the following result:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1917</fr:anchor><fr:addr
type="user">fga3.iii-6-theorem-6.2</fr:addr><fr:route>fga3.iii-6-theorem-6.2.xml</fr:route><fr:taxon>Theorem</fr:taxon><fr:authors /><fr:number>6.2</fr:number><fr:parent>fga3.iii-6</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be a Noetherian prescheme, <fr:tex
display="inline"><![CDATA[X]]></fr:tex> a prescheme of finite type over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> an equivalence pre-relation on the <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-prescheme <fr:tex
display="inline"><![CDATA[X]]></fr:tex>.
    Suppose that

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;a. &quot;">
        <fr:tex
display="inline"><![CDATA[p_1\colon  R_1\to  X]]></fr:tex> is flat and of finite type; and
      </html:li>

      
 <html:li
style="list-style-type: &quot;b. &quot;">
        the morphism <fr:tex
display="inline"><![CDATA[R_1\to  X\times _S X]]></fr:tex> is quasi-finite (i.e. has finite fibres).
      </html:li>

    </html:ol>


    Then there exists a <fr:em>dense</fr:em> open subset <fr:tex
display="inline"><![CDATA[U]]></fr:tex> of <fr:tex
display="inline"><![CDATA[X]]></fr:tex> that is <fr:em>saturated</fr:em> for <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex>, such that:

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;i. &quot;">
        If <fr:tex
display="inline"><![CDATA[\mathcal {R}_U]]></fr:tex> is the equivalence pre-relation induced by <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> on <fr:tex
display="inline"><![CDATA[U]]></fr:tex>, then <fr:tex
display="inline"><![CDATA[U/\mathcal {R}_U]]></fr:tex> exists, and is of finite type over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
      </html:li>


      
 <html:li
style="list-style-type: &quot;ii. &quot;">
        The canonical morphism <fr:tex
display="inline"><![CDATA[U\to  U/\mathcal {R}_U]]></fr:tex> is surjective and open, and its fibres are the set-theoretic equivalence classes for <fr:tex
display="inline"><![CDATA[\mathcal {R}_U]]></fr:tex> (and thus <fr:tex
display="inline"><![CDATA[U/\mathcal {R}_U]]></fr:tex> is a topological quotient space of <fr:tex
display="inline"><![CDATA[U]]></fr:tex> by the set-theoretic equivalence relation defined by <fr:tex
display="inline"><![CDATA[\mathcal {R}_U]]></fr:tex>).
        Finally, the morphism <fr:tex
display="inline"><![CDATA[(\mathcal {R}_U)_1\to  U\times _{U/\mathcal {R}_U}U]]></fr:tex> is surjective.
      </html:li>


      
 <html:li
style="list-style-type: &quot;iii. &quot;">
        If <fr:tex
display="inline"><![CDATA[\mathcal {R}]]></fr:tex> comes from an equivalence relation, then we can suppose that <fr:tex
display="inline"><![CDATA[U\to  U/\mathcal {R}_U]]></fr:tex> is faithfully flat and that <fr:tex
display="inline"><![CDATA[\mathcal {R}_U]]></fr:tex> is effective.
      </html:li>

    </html:ol></fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>This is a result of an essentially "birational" nature.</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1925</fr:anchor><fr:addr
type="user">fga3.iii-6-remarks-6.3</fr:addr><fr:route>fga3.iii-6-remarks-6.3.xml</fr:route><fr:taxon>Remarks</fr:taxon><fr:authors /><fr:number>6.3</fr:number><fr:parent>fga3.iii-6</fr:parent></fr:frontmatter><fr:mainmatter><fr:ol><fr:li>I do not know if, in <fr:ref
addr="fga3.iii-6-theorem-6.1"
href="fga3.iii-6-theorem-6.1.xml"
taxon="Theorem"
number="6.1" /> and <fr:ref
addr="fga3.iii-6-theorem-6.2"
href="fga3.iii-6-theorem-6.2.xml"
taxon="Theorem"
number="6.2" />, hypothesis (b) is useless.
      In practice, it obliges us, in the passage to the quotient by groups, to restrict to he case where the stabilisers are all finite groups.</fr:li>

    <fr:li>We can ask if there are results analogous to <fr:ref
addr="fga3.iii-6-theorem-6.1"
href="fga3.iii-6-theorem-6.1.xml"
taxon="Theorem"
number="6.1" /> and <fr:ref
addr="fga3.iii-6-theorem-6.2"
href="fga3.iii-6-theorem-6.2.xml"
taxon="Theorem"
number="6.2" /> without any flatness hypothesis.
      I have no counter example in this direction.
      However, even keeping the flatness hypothesis, and restricting to equivalence relations such that <fr:tex
display="inline"><![CDATA[p_1\colon  R\to  X]]></fr:tex> is flat and quasi-finite (but not finite), and with <fr:tex
display="inline"><![CDATA[X]]></fr:tex> affine, it can still be the case that <fr:tex
display="inline"><![CDATA[R]]></fr:tex> is not effective: take the equivalence relations induced on the affine open subsets covering the Nagata variety (or a group with two elements acting in a "non-admissible" way).</fr:li></fr:ol></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2013</fr:anchor><fr:addr
type="user">fga3.iii-7</fr:addr><fr:route>fga3.iii-7.xml</fr:route><fr:title
text="Applications">Applications</fr:title><fr:authors /><fr:number>7</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>As we said in the introduction, the most important application of <fr:ref
addr="fga3.iii-6-theorem-6.1"
href="fga3.iii-6-theorem-6.1.xml"
taxon="Theorem"
number="6.1" /> is the construction of Picard schemes, as well as solutions to various other problems of "modules", to which we will later return.</fr:p><fr:p>We obtain a simple proof of the following result of Shimura:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1936</fr:anchor><fr:addr
type="user">fga3.iii-7-proposition-7.1</fr:addr><fr:route>fga3.iii-7-proposition-7.1.xml</fr:route><fr:taxon>Proposition</fr:taxon><fr:authors /><fr:number>7.1</fr:number><fr:parent>fga3.iii-7</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[A]]></fr:tex> be an abelian scheme defined over a discrete valuation ring <fr:tex
display="inline"><![CDATA[V]]></fr:tex> with field of fractions <fr:tex
display="inline"><![CDATA[K]]></fr:tex>.
    Then every abelian scheme <fr:tex
display="inline"><![CDATA[B']]></fr:tex> over <fr:tex
display="inline"><![CDATA[K]]></fr:tex> that is isogenous to a quotient of <fr:tex
display="inline"><![CDATA[A\otimes _V K]]></fr:tex> "simplifies well for <fr:tex
display="inline"><![CDATA[V]]></fr:tex>", i.e. is isomorphic to some <fr:tex
display="inline"><![CDATA[B\otimes _V A]]></fr:tex>, where <fr:tex
display="inline"><![CDATA[B]]></fr:tex> is an abelian scheme over <fr:tex
display="inline"><![CDATA[V]]></fr:tex> (essentially unique, we recall).</fr:p>
  
    
    <fr:tree
toc="false"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1934</fr:anchor><fr:addr
type="machine">#260</fr:addr><fr:route>unstable-260.xml</fr:route><fr:taxon>Proof</fr:taxon><fr:authors /><fr:parent>fga3.iii-7-proposition-7.1</fr:parent></fr:frontmatter><fr:mainmatter>
    <fr:p>We can suppose that <fr:tex
display="inline"><![CDATA[B']]></fr:tex> is the quotient of <fr:tex
display="inline"><![CDATA[A_K]]></fr:tex> by a subscheme in groups <fr:tex
display="inline"><![CDATA[C']]></fr:tex>.
      (N.B. <fr:tex
display="inline"><![CDATA[C']]></fr:tex> will not, in general, be "reduced", i.e. its local rings will have nilpotent elements).
      Consider the closed subscheme <fr:tex
display="inline"><![CDATA[C]]></fr:tex> of <fr:tex
display="inline"><![CDATA[A]]></fr:tex> given by "the closure" of <fr:tex
display="inline"><![CDATA[C']]></fr:tex>, i.e. the smallest closed subscheme of <fr:tex
display="inline"><![CDATA[A]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[C_K]]></fr:tex> contains <fr:tex
display="inline"><![CDATA[C']]></fr:tex>.
      Then <fr:tex
display="inline"><![CDATA[C_K=C']]></fr:tex>, and, since <fr:tex
display="inline"><![CDATA[V]]></fr:tex> is a discrete valuation ring, we easily deduce that <fr:tex
display="inline"><![CDATA[C]]></fr:tex> is a subscheme in groups of <fr:tex
display="inline"><![CDATA[A]]></fr:tex> over <fr:tex
display="inline"><![CDATA[V]]></fr:tex>.
      Since <fr:tex
display="inline"><![CDATA[A]]></fr:tex> is proper over <fr:tex
display="inline"><![CDATA[\operatorname {Spec}(V)=S]]></fr:tex>, so too is <fr:tex
display="inline"><![CDATA[C]]></fr:tex>.
      Further, <fr:tex
display="inline"><![CDATA[A]]></fr:tex> is projective over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
      
      We can thus apply <fr:ref
addr="fga3.iii-6-theorem-6.1"
href="fga3.iii-6-theorem-6.1.xml"
taxon="Theorem"
number="6.1" /> in order to construct <fr:tex
display="inline"><![CDATA[A/C=B]]></fr:tex>, which is the desired <fr:tex
display="inline"><![CDATA[B]]></fr:tex>.</fr:p>
  </fr:mainmatter><fr:backmatter /></fr:tree>
  
</fr:mainmatter><fr:backmatter /></fr:tree><fr:p>Finally, essentially known arguments allow us to extract from <fr:ref
addr="fga3.iii-6-theorem-6.2"
href="fga3.iii-6-theorem-6.2.xml"
taxon="Theorem"
number="6.2" /> the following result:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1937</fr:anchor><fr:addr
type="user">fga3.iii-7-theorem-7.2</fr:addr><fr:route>fga3.iii-7-theorem-7.2.xml</fr:route><fr:taxon>Theorem</fr:taxon><fr:authors /><fr:number>7.2</fr:number><fr:parent>fga3.iii-7</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be the spectrum of an Artinian ring, <fr:tex
display="inline"><![CDATA[F]]></fr:tex> and <fr:tex
display="inline"><![CDATA[G]]></fr:tex> group schemes of finite type over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, and <fr:tex
display="inline"><![CDATA[u\colon  F\to  G]]></fr:tex> a homomorphism of group schemes over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
    Suppose that

    
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
      
 <html:li
style="list-style-type: &quot;i. &quot;">
        <fr:tex
display="inline"><![CDATA[F]]></fr:tex> is flat over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>; and
      </html:li>

      
 <html:li
style="list-style-type: &quot;ii. &quot;">
        the kernel of <fr:tex
display="inline"><![CDATA[u]]></fr:tex> is finite.
      </html:li>

    </html:ol>


    Under these conditions, the quotient scheme <fr:tex
display="inline"><![CDATA[G/F]]></fr:tex> exists, and the canonical morphism <fr:tex
display="inline"><![CDATA[G\to  G/F]]></fr:tex> is surjective and open, and its fibres are the set-theoretic equivalence classes defined by the right action of <fr:tex
display="inline"><![CDATA[F]]></fr:tex> on <fr:tex
display="inline"><![CDATA[G]]></fr:tex>.
    Finally, if <fr:tex
display="inline"><![CDATA[u]]></fr:tex> is a monomorphism, then the morphism <fr:tex
display="inline"><![CDATA[G\to  G/F]]></fr:tex> is flat, and the morphism <fr:tex
display="inline"><![CDATA[G\times  F\to  G\times _{(G/F)}G]]></fr:tex> is an isomorphism, or, in other words, <fr:tex
display="inline"><![CDATA[G]]></fr:tex> is a principal homogeneous space over <fr:tex
display="inline"><![CDATA[G/F]]></fr:tex>, with structure group <fr:tex
display="inline"><![CDATA[F]]></fr:tex> (acting on the right), or rather <fr:tex
display="inline"><![CDATA[F\times _S(G/F)]]></fr:tex> considered as a group scheme over <fr:tex
display="inline"><![CDATA[G/F]]></fr:tex> (cf. <fr:link
type="local"
href="fga3.i-b.6.xml"
addr="fga3.i-b.6"
title="Generalities, and descent by faithfully flat morphisms › Descent by faithfully flat morphisms › Application to local triviality and isotriviality criteria">FGA 3.I, §B.6</fr:link>).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1941</fr:anchor><fr:addr
type="user">fga3.iii-7-corollary-7.3</fr:addr><fr:route>fga3.iii-7-corollary-7.3.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>7.3</fr:number><fr:parent>fga3.iii-7</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Under these conditions, for <fr:tex
display="inline"><![CDATA[G]]></fr:tex> to be flat over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, it is necessary and sufficient that <fr:tex
display="inline"><![CDATA[G/F]]></fr:tex> be flat over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
    If this condition is satisfied, then the passage to the quotient by <fr:tex
display="inline"><![CDATA[F]]></fr:tex> commutes with every extension of the base <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, and if <fr:tex
display="inline"><![CDATA[F]]></fr:tex> is an invariant subgroup of <fr:tex
display="inline"><![CDATA[G]]></fr:tex>, then <fr:tex
display="inline"><![CDATA[G/F]]></fr:tex> can be endowed with the structure of a <fr:em>quotient group</fr:em> of <fr:tex
display="inline"><![CDATA[G]]></fr:tex> by <fr:tex
display="inline"><![CDATA[F]]></fr:tex>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>The situation is particularly simple if <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is the spectrum of a field, since then every <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-prescheme is automatically flat over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
  We find:</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1942</fr:anchor><fr:addr
type="user">fga3.iii-7-corollary-7.4</fr:addr><fr:route>fga3.iii-7-corollary-7.4.xml</fr:route><fr:taxon>Corollary</fr:taxon><fr:authors /><fr:number>7.4</fr:number><fr:parent>fga3.iii-7</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Let <fr:tex
display="inline"><![CDATA[F]]></fr:tex> and <fr:tex
display="inline"><![CDATA[G]]></fr:tex> be group schemes of finite type over a field <fr:tex
display="inline"><![CDATA[k]]></fr:tex>, and let <fr:tex
display="inline"><![CDATA[u\colon  F\to  G]]></fr:tex> be a homomorphism of <fr:tex
display="inline"><![CDATA[k]]></fr:tex>-groups.
    Then <fr:tex
display="inline"><![CDATA[u]]></fr:tex> factors as <fr:tex
display="inline"><![CDATA[F\to  F'\to  G]]></fr:tex>, where <fr:tex
display="inline"><![CDATA[F\to  F']]></fr:tex> is a homomorphism given by passing to the quotient by the closed subgroup <fr:tex
display="inline"><![CDATA[\operatorname {Ker} u]]></fr:tex> of <fr:tex
display="inline"><![CDATA[F]]></fr:tex>, and where <fr:tex
display="inline"><![CDATA[F'\to  G]]></fr:tex> is a group homomorphism that is a closed immersion.
    The quotient <fr:tex
display="inline"><![CDATA[G/F=G/F']]></fr:tex> exists.
    The usual formalism (as in the Noether theorems) holds amongst algebraic groups over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>This result allows us to treat the passage to the quotient in a uniform way for algebraic (in the classical sense, i.e. irreducible over <fr:tex
display="inline"><![CDATA[k]]></fr:tex> and simple over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>) groups, and the passage to the quotient by "infinitesimal" subgroups considered by Cartier.
  
  It is advantageous to consider the "hyperalgebras" introduced by Cartier, following from the work of Dieudonné on formal groups, as groups in the category of formal schemes over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>, and, if necessary (if they correspond to hyperalgebras of finite rank over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>), as algebraic groups that are finite over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2014</fr:anchor><fr:addr
type="user">fga3.iii-8</fr:addr><fr:route>fga3.iii-8.xml</fr:route><fr:title
text="A conjecture">A conjecture</fr:title><fr:authors /><fr:number>8</fr:number><fr:parent>fga3.iii</fr:parent></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1962</fr:anchor><fr:addr
type="user">fga3.iii-8-remark-i</fr:addr><fr:route>fga3.iii-8-remark-i.xml</fr:route><fr:taxon>Remark</fr:taxon><fr:authors /><fr:parent>fga3.iii-8</fr:parent></fr:frontmatter><fr:mainmatter><fr:p><fr:em>[Comp.]</fr:em>
    It now appears that the conjectures in this section are false, even for non-singular varieties over a field of characteristic <fr:tex
display="inline"><![CDATA[0]]></fr:tex>, both for the existence and the quasi-projectivity of the quotient, and even when <fr:tex
display="inline"><![CDATA[G]]></fr:tex> acts with a closed graph.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>The conjecture in question concerns the need of knowing how to pass to the quotient by the projective group acting on certain subschemes of "Hilbert schemes" (with these "Hilbert schemes" replacing, in the theory of schemes, Chow varieties).</fr:p><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be a prescheme, and <fr:tex
display="inline"><![CDATA[n]]></fr:tex> an integer.
  To every prescheme <fr:tex
display="inline"><![CDATA[S']]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, we associate the group <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n,\Gamma (S',\mathcal {O}_{S'}))]]></fr:tex> of invertible <fr:tex
display="inline"><![CDATA[(n\times  n)]]></fr:tex> matrices with values in the ring of sections of <fr:tex
display="inline"><![CDATA[\mathcal {O}_{S'}]]></fr:tex>.
  We thus obtain a contravariant functor in <fr:tex
display="inline"><![CDATA[S']]></fr:tex>, which can can easily show to be representable, and so the functor corresponds to a group scheme over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> (which is further affine over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>) which we denote by <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n)_s]]></fr:tex>.
  Its construction is compatible with change of base, so that, in reality, everything comes from a group scheme over <fr:tex
display="inline"><![CDATA[\mathbb {Z}]]></fr:tex>, denoted by <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n)]]></fr:tex>.
  The group <fr:tex
display="inline"><![CDATA[\operatorname {GL}(1)]]></fr:tex>, called the <fr:em>multiplicative group</fr:em>, and often denoted by <fr:tex
display="inline"><![CDATA[\operatorname {G_m}]]></fr:tex>, corresponds to the functor <fr:tex
display="inline"><![CDATA[S\mapsto \Gamma (S,\mathcal {O}_S)^*]]></fr:tex>, with the latter being the group of "units" over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
  We have an evident homomorphism <fr:tex
display="inline"><![CDATA[\operatorname {GL}(1)\to \operatorname {GL}(n)]]></fr:tex>, and we can easily construct the quotient group, denoted by <fr:tex
display="inline"><![CDATA[\operatorname {GP}(n-1)]]></fr:tex>, and called the <fr:em>projective group of degree <fr:tex
display="inline"><![CDATA[(n-1)]]></fr:tex> over <fr:tex
display="inline"><![CDATA[\mathbb {Z}]]></fr:tex></fr:em>.
  It represents the functor that sends <fr:tex
display="inline"><![CDATA[S]]></fr:tex> to the group of sections of the sheaf <fr:tex
display="inline"><![CDATA[\operatorname {\mathscr {G}\kern  -2pt\mathscr {L}}(n)_S/\operatorname {\mathscr {G}\kern  -2pt\mathscr {L}}(1)_S]]></fr:tex>, where <fr:tex
display="inline"><![CDATA[\operatorname {\mathscr {G}\kern  -2pt\mathscr {L}}(n)_S]]></fr:tex> denotes the sheaf of germs of sections of <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n)_S]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
  (Note that sections of <fr:tex
display="inline"><![CDATA[\operatorname {GP}(n-1)_S]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> do not, in general, come from sections of <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n)_S]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>!)
  Note that we can prove that <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n-1)]]></fr:tex> equally represents the functor <fr:tex
display="inline"><![CDATA[S\mapsto \operatorname {Aut}_S(\mathbb {P}_S^{n-1})]]></fr:tex> (where <fr:tex
display="inline"><![CDATA[\mathbb {P}_S^{n-1}]]></fr:tex> is the projective-type scheme of relative dimension <fr:tex
display="inline"><![CDATA[(n-1)]]></fr:tex> over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>), at least when <fr:tex
display="inline"><![CDATA[S]]></fr:tex> is Noetherian.
  It is in this way that it appears in the theory of modules.</fr:p><fr:p>Let <fr:tex
display="inline"><![CDATA[S]]></fr:tex> be a Noetherian scheme, which we can, if we want, suppose to be affine, and let <fr:tex
display="inline"><![CDATA[X]]></fr:tex> be a quasi-projective <fr:tex
display="inline"><![CDATA[S]]></fr:tex>-prescheme endowed with an invertible sheaf <fr:tex
display="inline"><![CDATA[\mathscr {L}]]></fr:tex> that is very ample with respect to <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.
  
  Suppose that the group <fr:tex
display="inline"><![CDATA[G=\operatorname {GP}(n)_S]]></fr:tex> acts on <fr:tex
display="inline"><![CDATA[X]]></fr:tex> and <fr:tex
display="inline"><![CDATA[\mathscr {L}]]></fr:tex> simultaneously (in a way that is compatible with its action on <fr:tex
display="inline"><![CDATA[X]]></fr:tex>), and that it acts <fr:em>freely</fr:em> on <fr:tex
display="inline"><![CDATA[S]]></fr:tex>.</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1963</fr:anchor><fr:addr
type="user">fga3.iii-8-conjecture-8.1</fr:addr><fr:route>fga3.iii-8-conjecture-8.1.xml</fr:route><fr:taxon>Conjecture</fr:taxon><fr:authors /><fr:number>8.1</fr:number><fr:parent>fga3.iii-8</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>Under the above conditions:

    <fr:ol><fr:li>The equivalence relation defined by <fr:tex
display="inline"><![CDATA[G]]></fr:tex> is effective, the quotient <fr:tex
display="inline"><![CDATA[Y=X/G]]></fr:tex> is of finite type over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, and the canonical morphism <fr:tex
display="inline"><![CDATA[f\colon  X\to  Y]]></fr:tex> is flat and surjective (and thus <fr:tex
display="inline"><![CDATA[X]]></fr:tex> becomes a homogeneous principal bundle on <fr:tex
display="inline"><![CDATA[Y]]></fr:tex>, with group <fr:tex
display="inline"><![CDATA[G\times _S Y=\operatorname {GP}(n)_Y]]></fr:tex>).</fr:li>

      <fr:li>Let <fr:tex
display="inline"><![CDATA[\mathscr {L}']]></fr:tex> be the invertible sheaf on <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> induced from <fr:tex
display="inline"><![CDATA[\mathscr {L}]]></fr:tex> by "faithfully flat descent" under <fr:tex
display="inline"><![CDATA[f]]></fr:tex> (cf. <fr:link
type="local"
href="fga3.i-b.1-theorem-1.xml"
addr="fga3.i-b.1-theorem-1">FGA 3.I, §B, Theorem 1</fr:link>).
        Then <fr:tex
display="inline"><![CDATA[\mathscr {L}']]></fr:tex> is "pre-ample" on <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> with respect to <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, i.e. there exists an integer <fr:tex
display="inline"><![CDATA[m]]></fr:tex> and a quasi-finite morphism from <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> to some suitable projective-type scheme <fr:tex
display="inline"><![CDATA[\mathbb {P}_S^N]]></fr:tex> such that <fr:tex
display="inline"><![CDATA[(\mathscr {L}')^{\otimes  m}]]></fr:tex> is isomorphic to the inverse image of <fr:tex
display="inline"><![CDATA[\mathcal {O}_{\mathbb {P}_S^N}(1)]]></fr:tex>.</fr:li></fr:ol></fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:p>We note that, even if <fr:tex
display="inline"><![CDATA[X]]></fr:tex> is separated over <fr:tex
display="inline"><![CDATA[S]]></fr:tex>, then it can be the case that <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is not separated over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> (a situation that arises in not-at-all-pathological "module problems").
  If (1) is satisfied, then <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is separated if and only if the equivalence relation defined by <fr:tex
display="inline"><![CDATA[G]]></fr:tex> has a closed graph, i.e. if <fr:tex
display="inline"><![CDATA[G\times  X\to  X\times  X]]></fr:tex> has a closed image (and is thus a closed immersion).
  If <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> is separated, then <fr:tex
display="inline"><![CDATA[\mathscr {L}']]></fr:tex> is pre-ample on <fr:tex
display="inline"><![CDATA[Y]]></fr:tex> with respect to <fr:tex
display="inline"><![CDATA[S]]></fr:tex> if and only if it is ample, i.e. if a suitable tensor power defines a projective immersion.
  In the module problems mentioned in the introduction, we can show that the equivalence relation to which we arrive does indeed have a closed graph.</fr:p><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1964</fr:anchor><fr:addr
type="user">fga3.iii-8-remarks-8.2</fr:addr><fr:route>fga3.iii-8-remarks-8.2.xml</fr:route><fr:taxon>Remarks</fr:taxon><fr:authors /><fr:number>8.2</fr:number><fr:parent>fga3.iii-8</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>We have assumed that <fr:tex
display="inline"><![CDATA[G=\operatorname {GP}(n)_S]]></fr:tex> to give a concrete example, and because it is currently the most important case in practice.
    The reasonable hypothesis to make on <fr:tex
display="inline"><![CDATA[G]]></fr:tex> seems rather to be that <fr:tex
display="inline"><![CDATA[G]]></fr:tex> be one of the "forms" on <fr:tex
display="inline"><![CDATA[S]]></fr:tex> of a Tohokû group (whose construction over the integers has also been made by Chevalley).
    The only positive fact that is known to me concerning the above conjecture is the following:
    <fr:em>Let <fr:tex
display="inline"><![CDATA[X]]></fr:tex> be an affine scheme over a field <fr:tex
display="inline"><![CDATA[k]]></fr:tex> of characteristic <fr:tex
display="inline"><![CDATA[0]]></fr:tex>, on which the group <fr:tex
display="inline"><![CDATA[\operatorname {GL}(n)_k]]></fr:tex> or <fr:tex
display="inline"><![CDATA[\operatorname {GP}(n-1)_k]]></fr:tex> acts freely. Then the equivalence relation defined by <fr:tex
display="inline"><![CDATA[G]]></fr:tex> is effective, the quotient <fr:tex
display="inline"><![CDATA[X/G]]></fr:tex> is affine, and the morphism <fr:tex
display="inline"><![CDATA[X\to  X/G]]></fr:tex> is flat and surjective.</fr:em>
    The proof uses the following fact (that, for now, has only been proven in characteristic <fr:tex
display="inline"><![CDATA[0]]></fr:tex>):
    if we let <fr:tex
display="inline"><![CDATA[G]]></fr:tex> act on the affine ring <fr:tex
display="inline"><![CDATA[A]]></fr:tex> of <fr:tex
display="inline"><![CDATA[G]]></fr:tex>, considered as a vector space over <fr:tex
display="inline"><![CDATA[k]]></fr:tex>, then the trivial representation of <fr:tex
display="inline"><![CDATA[G]]></fr:tex> only appears once (in a composition series of a vector subspace of finite dimension over <fr:tex
display="inline"><![CDATA[k]]></fr:tex> that is stable under <fr:tex
display="inline"><![CDATA[G]]></fr:tex>).
    
    It seems possible that a systematic use of the theory of linear representations of <fr:tex
display="inline"><![CDATA[G]]></fr:tex> would give a proof of the conjecture, or at least when we work over a base field.
    When we are no longer working over a base field, the author knows nothing.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>1965</fr:anchor><fr:addr
type="user">fga3.iii-8-remark-ii</fr:addr><fr:route>fga3.iii-8-remark-ii.xml</fr:route><fr:taxon>Remark</fr:taxon><fr:authors /><fr:parent>fga3.iii-8</fr:parent></fr:frontmatter><fr:mainmatter><fr:p><fr:em>[Comp.]</fr:em>
    As we note at the end of the next talk, the above conjecture is decidedly false.
    The "positive fact" mentioned in the above remark seems to have been proven simultaneously by various authors (Nagata, Rosenlicht, Grothendieck, ...).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter><fr:tree
toc="false"
numbered="false"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:title
text="Backlinks">Backlinks</fr:title><fr:authors /></fr:frontmatter><fr:mainmatter><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="true"
expanded="false"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>3249</fr:anchor><fr:addr
type="user">fga3.v-5-remarks-5.1</fr:addr><fr:route>fga3.v-5-remarks-5.1.xml</fr:route><fr:taxon>Remarks</fr:taxon><fr:authors /><fr:number>5.1</fr:number><fr:parent>fga3.v-5</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The method that we followed is essentially that of Matsusaka for the projective construction of Picard varieties.
    The result that we invoke from <fr:ref
addr="fga3.iii"
href="fga3.iii.xml"
taxon="FGA"
number="3.III" /> that allows us to pass to the effective quotient can also easily be deduced from the existence theorem for Hilbert schemes (cf. for example [Mumford–Tate seminar, 1962]).
    (Classically, these quotients are constructed by using Chow coordinates).
    Note that the formation of the open <fr:tex
display="inline"><![CDATA[\underline {\operatorname {Pic}}_{X/S}^+]]></fr:tex> of <fr:tex
display="inline"><![CDATA[\underline {\operatorname {Pic}}_{X/S}]]></fr:tex> and its decomposition into opens <fr:tex
display="inline"><![CDATA[{\underline {\operatorname {Pic}}_{X/S}^+}^Q]]></fr:tex> that are quasi-projcetive over <fr:tex
display="inline"><![CDATA[S]]></fr:tex> following the Hilbert polynomials for the <fr:em>divisors</fr:em> that define the invertible modules in question, is compatible with base change (which allows us to apply the technique of descent).</fr:p></fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="true"
expanded="false"
root="true"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>3250</fr:anchor><fr:addr
type="user">index</fr:addr><fr:route>index.xml</fr:route><fr:title
text="Grothendieck's &quot;Foundations of Algebraic Geometry&quot; (FGA)">Grothendieck's "Foundations of Algebraic Geometry" (FGA)</fr:title><fr:authors /></fr:frontmatter><fr:mainmatter><fr:p><fr:strong><fr:link
type="external"
href="./fga.pdf">Click for PDF version</fr:link></fr:strong></fr:p><fr:tree
toc="true"
numbered="true"
show-heading="true"
show-metadata="false"
expanded="true"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>2889</fr:anchor><fr:addr
type="user">translators-note</fr:addr><fr:route>translators-note.xml</fr:route><fr:title
text="Note from the translator">Note from the translator</fr:title><fr:authors /><fr:parent>index</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>This is an English translation of <fr:strong>Alexander Grothendieck</fr:strong>'s "Fondements de la Géometrie Algébrique".
    The original (French) notes have been scanned and uploaded by the Grothendieck Circle <fr:link
type="external"
href="https://webusers.imj-prg.fr/~leila.schneps/grothendieckcircle/FGA.pdf">here</fr:link>, though you can also find the individual talks, as well as the errata, on <fr:link
type="external"
href="http://www.numdam.org/actas/SB/">Numdam</fr:link>.</fr:p><fr:p>The translator (<fr:link
type="external"
href="https://thosgood.com">Tim Hosgood</fr:link>) takes full responsibility for any errors introduced, and claims no rights to any of the mathematical content herein.
    Any notes by the translator are in italics and prefixed with "[Trans.]".</fr:p><fr:p>You can view the entire source code of this translation (and contribute or submit corrections) in the <fr:link
type="external"
href="https://github.com/thosgood/fga">GitHub repository</fr:link>.
    Corrections and comments welcome.</fr:p><fr:p>The translator would like to sincerely thank Steve Hnizdur for catching many typos and mistakes, as well as <fr:link
type="external"
href="https://www.jonmsterling.com/index.xml">Jon Sterling</fr:link> for helping with the technical support in getting this translation ported to run on <fr:link
type="external"
href="https://www.jonmsterling.com/jms-005P.xml">Forester</fr:link>.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree>
 <html:ol
xmlns:html="http://www.w3.org/1999/xhtml">
  
 <html:li
style="list-style-type: &quot; &quot;">
    <fr:link
type="local"
href="fga-foreword.xml"
addr="fga-foreword"
title="Foreword"><fr:strong>Foreword</fr:strong></fr:link>
  </html:li>

  
 <html:li
style="list-style-type: &quot;FGA 1. &quot;">
    <fr:link
type="local"
href="fga1.xml"
addr="fga1"
title="Duality theorems for coherent algebraic sheaves"><fr:strong>Duality theorems for coherent algebraic sheaves</fr:strong></fr:link>
  </html:li>

  
 <html:li
style="list-style-type: &quot;FGA 2. &quot;">
    <fr:link
type="local"
href="fga2.xml"
addr="fga2"
title="Formal geometry and algebraic geometry"><fr:strong>Formal geometry and algebraic geometry</fr:strong></fr:link>
  </html:li>

  
 <html:li
style="list-style-type: &quot;FGA 3. &quot;">
    <fr:strong>Technique of descent and existence theorems in algebraic geometry</fr:strong>
    
 <html:ol>
      
 <html:li
style="list-style-type: &quot;FGA 3.I. &quot;">
        <fr:link
type="local"
href="fga3.i.xml"
addr="fga3.i"
title="Generalities, and descent by faithfully flat morphisms"><fr:strong>Generalities, and descent by faithfully flat morphisms</fr:strong></fr:link>
      </html:li>

      
 <html:li
style="list-style-type: &quot;FGA 3.II. &quot;">
        <fr:link
type="local"
href="fga3.ii.xml"
addr="fga3.ii"
title="The existence theorem and the formal theory of modules"><fr:strong>The existence theorem and the formal theory of modules</fr:strong></fr:link>
      </html:li>

      
 <html:li
style="list-style-type: &quot;FGA 3.III. &quot;">
        <fr:link
type="local"
href="fga3.iii.xml"
addr="fga3.iii"
title="Quotient preschemes"><fr:strong>Quotient preschemes</fr:strong></fr:link>
      </html:li>

      
 <html:li
style="list-style-type: &quot;FGA 3.IV. &quot;">
        <fr:link
type="local"
href="fga3.iv.xml"
addr="fga3.iv"
title="Hilbert schemes"><fr:strong>Hilbert schemes</fr:strong></fr:link>
      </html:li>

      
 <html:li
style="list-style-type: &quot;FGA 3.V. &quot;">
        <fr:link
type="local"
href="fga3.v.xml"
addr="fga3.v"
title="Picard schemes: Existence theorems"><fr:strong>Picard schemes: Existence theorems</fr:strong></fr:link>
      </html:li>

      
 <html:li
style="list-style-type: &quot;FGA 3.VI. &quot;">
        <fr:link
type="local"
href="fga3.vi.xml"
addr="fga3.vi"
title="Picard schemes: General properties"><fr:strong>Picard schemes: General properties</fr:strong></fr:link>
      </html:li>

    </html:ol>

  </html:li>

  
 <html:li
style="list-style-type: &quot; &quot;">
    <fr:link
type="local"
href="fga-bibliography.xml"
addr="fga-bibliography"
title="Complete list of references"><fr:strong>Bibliography</fr:strong></fr:link>
  </html:li>

</html:ol>
</fr:mainmatter><fr:backmatter /></fr:tree><fr:tree
toc="true"
numbered="false"
show-heading="true"
show-metadata="true"
expanded="false"
root="false"
xmlns:fr="http://www.jonmsterling.com/jms-005P.xml"><fr:frontmatter><fr:anchor>3251</fr:anchor><fr:addr
type="user">fga3.iv-introduction</fr:addr><fr:route>fga3.iv-introduction.xml</fr:route><fr:title
text="Hilbert schemes › Introduction"><fr:link
type="local"
href="fga3.iv.xml"
addr="fga3.iv"
title="Hilbert schemes">Hilbert schemes</fr:link> › Introduction</fr:title><fr:authors /><fr:parent>fga3.iv</fr:parent></fr:frontmatter><fr:mainmatter><fr:p>The techniques described in <fr:ref
addr="fga3.i"
href="fga3.i.xml"
taxon="FGA"
number="3.I" /> and <fr:ref
addr="fga3.ii"
href="fga3.ii.xml"
taxon="FGA"
number="3.II" /> were, for the most part, independent of any projective hypotheses on the schemes in question.
  Unfortunately, they have not as of yet allowed us to solve the existence problems posed in <fr:ref
addr="fga3.ii"
href="fga3.ii.xml"
taxon="FGA"
number="3.II" />.
  In the current article, and the following, we will solve these problems by imposing projective hypotheses.
  The techniques used are typically projective, and practically make no use of any results from <fr:ref
addr="fga3.i"
href="fga3.i.xml"
taxon="FGA"
number="3.I" /> and <fr:ref
addr="fga3.ii"
href="fga3.ii.xml"
taxon="FGA"
number="3.II" />.
  Here we will construct "Hilbert schemes", which are meant to replace the use of Chow coordinates, as was mentioned in <fr:link
type="local"
href="fga3.ii-c.2.xml"
addr="fga3.ii-c.2"
title="The existence theorem and the formal theory of modules › Applications to some particular cases › The schemes {{Hom}}_S(X,Y), _{X/S}Z, {{Aut}}(X), etc.">FGA 3.II, §C.2</fr:link>.
  In the next article, the theory of passing to the quotient in schemes, developed in <fr:ref
addr="fga3.iii"
href="fga3.iii.xml"
taxon="FGA"
number="3.III" />, combined with the theory of Hilbert schemes, will allow us, for example, to construct Picard schemes (defined in <fr:link
type="local"
href="fga3.ii-c.3.xml"
addr="fga3.ii-c.3"
title="The existence theorem and the formal theory of modules › Applications to some particular cases › Picard schemes">FGA 3.II, §C.3</fr:link>) under rather general conditions.</fr:p><fr:p>In summary, we can say that we now have a more or less satisfying technique of projective constructions, apart from the fact that we are still missing a theory of passing to the quotient by groups such as the projective group, acting "without fixed points" (cf. <fr:link
type="external"
href="#fga3.iii-8">FGA 3.III, §8</fr:link>).
  The situation even seems slightly better in analytic geometry (if we restrict to the study of "projective" analytic spaces over a given analytic space), since, for analytic spaces, the difficulty of passing to the quotient by a group that acts nicely disappears.
  Either way, in algebraic geometry, as well as in analytic geometry, it remains to develop a construction technique that works without any projective hypotheses.</fr:p></fr:mainmatter><fr:backmatter /></fr:tree></fr:mainmatter><fr:backmatter /></fr:tree></fr:backmatter></fr:tree>