Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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.

Formally etale morphism

Definition

A morphism of schemes f ⁣:X→S (Schemes and morphisms over a base) is formally etale if it is both formally smooth (Formally smooth morphism) and formally unramified (Formally unramified morphism).

Uniqueness of the local lifts. Explicitly, f is formally etale exactly when every commutative S-diagram with a square-zero thickening i ⁣:T0↪T admits lifts T→X extending the given T0→X Zariski locally on T, and any two such local lifts agree on the overlaps of their domains of definition: local existence is formal smoothness, and uniqueness is formal unramifiedness. Consequently the local lifts glue uniquely, by Morphisms of schemes are local on compatible open covers, to a single S-morphism T→X extending the given morphism from T0. Thus for a formally etale morphism every square-zero lifting problem has a unique lift, and the unique lift is obtained by gluing the local ones.

No finite-type, finite-presentation or flatness hypothesis is part of the definition: those enter the notion of an etale morphism of schemes, which is a formally etale morphism that is additionally locally of finite presentation (and flat); the comparison with that finite-presentation notion is made on a later page and is not claimed here.

Depends on

Used by

Dependency tree · two levels

10 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