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.
Thue's lemma on small nonzero representatives
Statement
Let be a prime and let with . Then there are nonzero integers with and .
Facts & Assumptions
Given: A prime and an integer with .
Every nonempty finite subset of has a maximum and a minimum (Every nonempty finite set of reals has a maximum and a minimum).
Every nonnegative real has a unique nonnegative square root whose square is (Square roots exist: a unique with ; the positives are ).
If finite sets are given, then (The product rule: , and ).
The quotient has elements for positive (For , every class in has one representative with , so ; while is in bijection with ).
If a map from a finite set to a finite set has , then some fibre contains more than one element (If then every has a fibre with more than elements, and for nonempty some fibre has at least elements).
If a prime divides , then or (Euclid's lemma: if is prime and then or ).
The congruence means that (Congruence modulo an integer: when , including the moduli and ).
Proof
The set is finite and contains , so [L1] gives its largest element .
One has : a strict inequality in the other direction would put in , while equality would factor the prime as with . Also , so by nonnegativity and [L2].
Put . Then [L3] gives by step 2.1 and [L4].
Apply [L5] to . Distinct pairs have the same image. With and , this says .
The coordinate bounds give .
If , then [F1] gives ; the bound forces , contrary to distinctness. If , then ; [L6] and give , and the same bound forces , again a contradiction.
Thus the integers from step 4.1 are both nonzero, satisfy , and obey the required strict bounds.
Depends on
- If $\lvert A\rvert > k\lvert B\rvert$ then every $f : A \to B$ has a fibre with more than $k$ elements, and for nonempty $B$ some fibre has at least $\lceil \lvert A\rvert / \lvert B\rvert\rceil$ elements
- The product rule: $\lvert A \times B\rvert = \lvert A\rvert\,\lvert B\rvert$, and $\big\lvert\prod_{i<m} A_i\big\rvert = \prod_{i<m}\lvert A_i\rvert$
- Every nonempty finite set of reals has a maximum and a minimum
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- Euclid's lemma: if $p$ is prime and $p \mid ab$ then $p \mid a$ or $p \mid b$
- Congruence modulo an integer: $a\equiv b\pmod n$ when $n\mid(a-b)$, including the moduli $0$ and $1$
Used by
Dependency tree · two levels
47 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
- P. Hackman, Elementary Number Theory, Chapter E, Theorem E.I.1 (standard reference, not scraped)