Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedprecheck passjudge 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.

Geometric fibre functor and étale fundamental group

Definition

Assume AC. Let X be a connected scheme and fix a geometric basepoint xˉ:Spec⁡Ω→X, where Ω is algebraically closed. A finite étale cover is a finite étale morphism Y→X, allowing the empty cover. Denote by FEt⁡(X) its category, with all X-morphisms as arrows. Finiteness and étaleness have their scheme meanings (Finite morphisms of schemes, Étale morphism of schemes); in particular this is not the category of all étale morphisms.

The geometric fibre functor is Fxˉ:FEt⁡(X)⟶FinSet⁡,Fxˉ(Y)=Hom⁡X(Spec⁡Ω,Y). A morphism acts by composition. This is the point set of Y×XSpec⁡Ω, a disjoint union of finitely many copies of Spec⁡Ω (Existence of all scheme fibre products, Finite and finite type etale schemes over an algebraically closed field). Its cardinality is the rank of the locally free algebra of the cover (Finite étale algebras have finite locally free underlying modules).

Define π1et(X,xˉ)=Aut⁡(Fxˉ). Here an element is a family of permutations of all fibres, commuting with every arrow of FEt⁡(X); composition is componentwise (Natural transformation and its components). Give it the topology induced by its inclusion in the product of the finite discrete symmetric groups Sym⁡(Fxˉ(Y)). Equivalently a neighbourhood basis of the identity consists of the kernels of the actions on finitely many fibres. Its action on each fibre is continuous by this definition. Profinite reconstruction and classification are proved in the subsequent theorem, not assumed in this definition.

Size is handled by taking a small skeleton of FEt⁡(X), or by fixing a universe containing X. Such a skeleton exists: on a set of affine charts of X, finite algebras and their finite presentations, together with compatible ring maps on charts of the intersections, have a set of possible codes, and their glued covers exhaust the category up to isomorphism. AC (The Axiom of Choice) permits choosing representatives and is also inherited through the étale suppliers above. Replacing the skeleton transports the functor and its automorphisms by equivalence and gives the same topological group up to the canonical transport. All classification statements use finite sets with the discrete topology and continuous left actions.

Depends on

Used by

Dependency tree · two levels

46 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