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.
Good reduction of an abelian variety over a Dedekind scheme
Definition
Let be a Dedekind scheme (Dedekind domains) with function field , and let be an abelian variety over (Abelian varieties over a field). One says that has good reduction over if there exists an abelian scheme (Abelian schemes over a base) together with an isomorphism of -schemes; such an is an abelian scheme model of over . For a discrete valuation ring with fraction field (Discrete valuation rings) this is the local notion at its closed point, and has potential good reduction if there is a finite extension such that has good reduction over the normalization of in .
For a closed point , the reduction of at is , which is an abelian variety over the residue field of dimension . Good reduction is a property of the pair ; the definition asserts no existence statement, and in particular no claim is made that every abelian variety has good reduction.
Depends on
Used by
- Good reduction supplies a Neron model Corollary
- Not every abelian variety over a Dedekind function field extends to an abelian scheme Counterexample
- An elliptic curve with good reduction and an elliptic curve with bad reduction Example
- Good reduction is stable under base change of the base Lemma
- Good reduction, coherent base change, and unramified torsion Theorem
- The Neron-Ogg-Shafarevich criterion in residue characteristic prime to l Theorem
Dependency tree · two levels
20 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
- J. S. Milne, Abelian Varieties, v2.00 (2008), Chapter I sections 3, 5, 8, 11, 17 (good reduction) (standard reference, not scraped)
- S. Bosch, W. Lutkebohmert, M. Raynaud, Neron Models (1990), 1.2/8 and Chapter 7 (standard reference, not scraped)