Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Groupoids in schemes, relations and etale equivalence relations

Definition

Fix a base scheme S (Schemes and morphisms over a base). A groupoid in S-schemes is a tuple (U,R,s,t,c,e,i) consisting of S-schemes U and R and morphisms of S-schemes s,t ⁣:R→U (source and target), c ⁣:R×s,U,tR→R (composition), e ⁣:U→R (identity) and i ⁣:R→R (inverse), subject to the usual identities of a small groupoid. Here c is defined on composable pairs (r1,r2) with s(r1)=t(r2) and c(r1,r2) is the composite "r2 first, then r1", with s(c(r1,r2))=s(r2) and t(c(r1,r2))=t(r1); the identities are s∘e=t∘e=idU,s∘c=s∘pr2,t∘c=t∘pr1, c∘(c×idR)=c∘(idR×c),c∘(idR,e∘s)=c∘(e∘t,idR)=idR, s∘i=t,t∘i=s,c∘(idR,i)=e∘t,c∘(i,idR)=e∘s, where the fibre products and projections are those of Fibre product of schemes and all morphisms are morphisms of S-schemes (Morphisms of schemes); associativity is stated on the triple fibre product R×s,U,tR×s,U,tR, where c×idR and idR×c are formed using the source/target identifications. A groupoid in S-schemes is precisely a groupoid object in the category of S-schemes in the sense of these diagrams, and its functor of points on the category of S-schemes is a groupoid-valued functor.

With j=(t,s) ⁣:R→U×SU, the groupoid is a relation when j is a monomorphism (Monomorphism and epimorphism by left and right cancellation); then j presents R as a subobject of U×SU, and the groupoid axioms exhibit a reflexive (e), symmetric (i) and transitive (c) set-theoretic relation on the points of U in the sense of Equivalence relation, equivalence class, and the quotient set A/∼. The groupoid is an equivalence relation on U over S when it is a relation, and an etale equivalence relation when in addition s and t are etale (Étale morphism of schemes).

Restriction is well defined as follows. Let g ⁣:U′→U be a morphism of S-schemes and form R′=R×U×SU(U′×SU′), the fibre product along j and g×g, with its two projections prR and prU′×U′; set t′=pr1∘prU′×U′ and s′=pr2∘prU′×U′. The map e′ sends u′ to (e(g(u′)),(u′,u′)), where (u′,u′) is the diagonal U′→U′×SU′; the map i′ sends (r,(u1′,u2′)) to (i(r),(u2′,u1′)); and c′ sends a composable pair ((r1,(u1′,u2′)),(r2,(u2′,u3′))) to (c(r1,r2),(u1′,u3′)). All three are defined by the universal property of the relevant fibre products, and the groupoid identities for (U′,R′,s′,t′,c′,e′,i′) follow from those for (U,R,s,t,c,e,i) after applying the universal property; this tuple is the restriction R∣U′ of the groupoid along g. If j is a monomorphism, then so is j′=(t′,s′), because a monomorphism is stable under base change in any category with fibre products: given two morphisms into the fibre product with equal composites to U′×SU′ and to R, the universal property of the fibre product makes them equal. Hence restricting an equivalence relation along an arbitrary morphism of S-schemes yields an equivalence relation. Restriction of the etale property needs g etale and is recorded separately in Restriction of an etale equivalence relation: its local flatness, finite-presentation and fibre arguments establish the required stability without a choice assumption.

Depends on

Used by

Dependency tree · two levels

23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources