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.
The rational algebraic integers are exactly the integers
Statement
A rational number is an algebraic integer if and only if it is an integer. See Integral elements over a commutative ring and algebraic integers.
Facts & Assumptions
Given: The hypotheses and objects in the Statement.
Let be a homomorphism of commutative rings. An element is integral over when it is a root of a monic polynomial in . The extension is integral when every element is integral. An algebraic integer is a complex number integral over . (Integral elements over a commutative ring and algebraic integers).
Let with . If a reduced rational number , where , , and , is a root of , then . (Rational root theorem).
with the operations of def-rat-operations is a field: a commutative ring with in which every nonzero element has a multiplicative inverse. (The rationals form a field).
The map is injective and preserves addition, multiplication, and order. Composing with lem-nat-embeds-int embeds in ; we write for throughout. (The integers embed in the rationals).
Proof
We write a rational algebraic integer in lowest terms with .
It is a root of a monic integer polynomial, so the rational-root theorem makes , hence .
Conversely every integer satisfies the monic polynomial .
Both are admitted and neither is exceptional. The polynomial of step 3.1 is monic with integer coefficients for every integer , giving at and for ; and in step 2.1 the lowest-terms representation covers as , where the denominator is already . This proves the stated claim.
Depends on
Used by
- √2 and (1+√5)/2 are algebraic integers, while 1/2 is not Example
- An algebraic-integer average of roots of unity is either 0 or a common root of unity Lemma
- A conjugacy class of prime-power size forces a proper nontrivial normal subgroup Theorem
- The degree of an irreducible complex character divides |G| Theorem
Dependency tree · two levels
18 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
- Eloisa Grifo, Commutative Algebra I, Section 1.4 (standard reference, not scraped)