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.
Irrational circle orbits are dense
Statement
For irrational , the subgroup is dense in the circle. For every and integer there is an integer with . These assertions are choice-free.
Facts & Assumptions
Circle distance is distance to the nearest integer. The circle, rotations and the doubling map.
N+1 points in N intervals contain a pair in one interval. The pigeonhole principle on .
Proof
Given: For irrational , the subgroup is dense in the circle. For every and integer there is an integer with . These assertions are choice-free.
For an integer , place , , in the N half-open intervals . Two indices i<j lie in one interval. Hence for q=j-i, and ; positivity follows from irrationality. Change q to -q if needed to obtain a subgroup point .
The subgroup contains , where ; the last term is interpreted modulo one if necessary. Consecutive gaps are beta and the remaining gap to 1 is at most beta. For every x in [0,1), taking gives . Since N can be arbitrarily large, every circle neighborhood meets the subgroup.
For fixed M>=1 let . Take N with and use the positive q from step 1.1 before changing its sign. That q exceeds M and has distance less than epsilon. For M=0 any q supplied there works after taking . Only finite minima and finite pigeonhole choices occur.
Depends on
Used by
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
- E–W Proposition 2.16 p.26 and Example 2.33 p.49 (standard reference, not scraped)