Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedverified 2026-09-23 (gpt-6-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.

Reduced closed-point fibres and their dimension

Definition

For a morphism f:X→Y of classical varieties and a closed point y∈Y, let Xy=f−1(y) have its reduced closed-subvariety structure. Its dimension is the chain dimension, with dim⁡Xy=−∞ if the fibre is empty. On affine charts V⊆Y containing y and U⊆f−1(V), writing A=k[V] and B=k[U], the fibre chart has coordinate ring B/myB. Indeed the coordinate functions of f∣U:U→V pull back my to functions vanishing exactly at points over y; the relative radical-ideal/closed-set correspondence of Classical affine algebraic sets correspond to radical ideals, and irreducible sets to prime ideals gives the reduced coordinate ring. General morphisms have the locally ringed-space meaning of Classical algebraic prevarieties, regular maps, and varieties, and the affine morphism test of A morphism from an open subset of a classical affine variety to an affine variety applies to U→V.

Work over a fixed algebraically closed field k, with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points.

Depends on

Used by

Dependency tree · two levels

24 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