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 smooth morphism

Definition

Let f ⁣:X→S be a morphism of schemes (Schemes and morphisms over a base) and let i ⁣:T0↪T be a square-zero thickening, namely a closed immersion (Closed immersions of schemes) whose ideal sheaf I=ker⁡(OT→i∗OT0) (Ideal sheaves) satisfies I2=0.

Formally smooth. The morphism f is formally smooth if for every commutative S-diagram

T0→ a X↓i↓fT→ b S

every point t∈T has an open neighbourhood U⊆T over which a lift exists: there is an S-morphism U→X extending a∣T0∩U. In other words, lifts exist Zariski locally on the test scheme T, and there is no uniqueness requirement.

Equivalent formulation. Since the lifting problem is local on T, it is equivalent to require that the sheaf-theoretic lifting problem Hom⁡S(T,X)→Hom⁡S(T0,X) be surjective locally on T; equivalently, by the universal property of the fibre product, the projection X×ST→T admits a section locally on T over the given morphism T0→X×ST. No finite-type, finite-presentation or flatness hypothesis is imposed, and no uniqueness of lifts is asserted; in particular a formally smooth morphism need not be an open immersion or a submersion in any topological sense, and "formally smooth" is not by itself the same condition as "the relative differentials are locally free" nor as "smooth of finite presentation", which is treated elsewhere.

Depends on

Used by

Dependency tree · two levels

7 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