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.
Reduction of orbits to the standard domain
Statement
Let and . (a) Every is -equivalent to a point of : among the points of the orbit some point has maximal imaginary part; after applying a power of one has , and then necessarily . (b) For fixed and there are only finitely many pairs with .
Facts & Assumptions
Given: , so , and the action of with for the bottom row of ; , (The modular group and its action on the upper half-plane).
A nonempty subset of that is bounded above has a greatest element and one that is bounded below has a least element; in particular the integers in a bounded interval form a finite set (A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element). Every real has an integer part with (Integer part: for every real there is exactly one integer with ).
If then (Basic properties of the absolute value).
Proof
Fix and suppose . Since and , [F1] gives , that is ; by [F2] only finitely many integers satisfy this. For each such , [F1] gives , so , and [F2] leaves only finitely many integers . Hence only finitely many pairs satisfy .
The set is nonempty (the identity has value ) and every element is positive. Applying 1.1 with shows that the elements of are among the finitely many numbers attached to pairs with , together with values ; hence has a least element , realized by some . Since , the point of the orbit has maximal imaginary part : for every with bottom row one has , so . Choose with , possible by taking [F2]; then satisfies (translation does not change the imaginary part) and . If , then and by [F1] and [F3], contradicting the maximality of . Hence , and is the required -equivalent point.
Depends on
- The modular group and its action on the upper half-plane
- A nonempty set of integers bounded above has a greatest element, and a nonempty set of integers bounded below has a least element
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- Basic properties of the absolute value
- A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum
- Real and imaginary parts, complex conjugation, and modulus
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
Used by
Dependency tree · two levels
64 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, Modular Functions and Modular Forms (v1.31, 2017) (standard reference, not scraped)
- D. Zagier, Elliptic Modular Forms and Their Applications, in The 1-2-3 of Modular Forms (Universitext, Springer, 2008) (standard reference, not scraped)
- C. T. McMullen, Advanced Complex Analysis, Math 213a course notes (Harvard, 2010) (standard reference, not scraped)