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.
consists exactly of rationals and inverts precisely the primes and
Example
Inside , Among positive prime integers, exactly and become units in this ring.
Facts & Assumptions
Given: The principal localisation of at and its canonical map into .
The principal localisation at consists of fractions (Principal localisation ).
The field is canonically ( is canonically isomorphic to ).
For an integer prime , implies or (For an integer : is prime if and only if, for all integers and , implies or ).
A map that sends the chosen denominators to units extends uniquely through the localisation (Universal property of localisation: maps that invert factor uniquely through ).
A fraction is zero exactly when some denominator annihilates (Equality, vanishing, and the kernel of the localisation map).
Verification
The inclusion sends to a unit, so [F4] gives a map with . If its image is zero, multiplication by the nonzero element in the field gives , and then [F5] makes ; hence the map is injective. Its image is exactly the set displayed in [F1].
The elements and are units because and .
If a positive prime is a unit, then for some , so . The case is impossible because . For , [F3] applied repeatedly to gives or , and primality with positivity forces or .
Depends on
- Principal localisation $R_f=\{1,f,f^2,\ldots\}^{-1}R$
- Universal property of localisation: maps that invert $S$ factor uniquely through $S^{-1}R$
- Equality, vanishing, and the kernel of the localisation map
- $\operatorname{Frac}(\mathbb Z)$ is canonically isomorphic to $\mathbb Q$
- Prime and composite integers: $p$ is prime when $p > 1$ and its only positive divisors are $1$ and $p$
- For an integer $p > 1$: $p$ is prime if and only if, for all integers $a$ and $b$, $p \mid ab$ implies $p \mid a$ or $p \mid b$
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 75 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- The Stacks Project, Section 10.9: Localization (standard reference, not scraped)