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.
A canonical reduced basis for a complex lattice
Example
Call a ratio reduced when
and let be the set of reduced ratios. Every full complex lattice admits an oriented basis with , this reduced ratio is uniquely determined by , and the number of oriented bases of realizing it is two in general, four when , and six when . The lattices and realize the exceptional ratios and .
Facts & Assumptions
Given: A full complex lattice with real-linearly independent, and .
are real-linearly independent, the pair is an oriented basis when , two oriented bases of one lattice differ by a matrix in , and all lattice-theoretic structure depends on the set alone (Complex lattice and quotient torus).
Every has unique real coordinates ; , , and (Real and imaginary parts, complex conjugation, and modulus).
For all : , , exactly when , and ; conjugation is an involutive real-field automorphism (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
For every real there is exactly one integer with , hence an integer with , namely (Integer part: for every real there is exactly one integer with ).
Verification
Real-linear independence of gives , so after exchanging the two vectors if necessary one has and is an oriented basis of ; every oriented basis of is with integers satisfying , and conversely every such tuple yields an oriented basis, the coefficients being unique because are real-linearly independent.
Writing with and , the form equals and also times a square plus , so and ; hence with for all real .
A matrix fixes exactly when ; if this equation and give , , so . If , the discriminant is negative, so the trace lies in ; writing with , the fixed point equation reads , so and .
For the basis of step 1.1 the ratio is with , and .
For trace , , so step 1.3 gives and . At a reduced fixed point, and , whence . Thus , forcing the integer , then and . Now and , giving precisely , where ; both fix directly.
For trace : replacing by changes the sign of and leaves the fixed points unchanged, so take ; then and , so with and one has , and the constraints and give and , hence and . For the determinant condition gives and , which lies in only for , giving and ; for it gives , , which lies in only for , giving again and . Together with their negatives and these six matrices form the stabiliser of , and both displayed matrices are checked directly to fix .
Only finitely many values satisfy : by steps 2.1 and 1.2 that condition implies , hence , which has only finitely many integer solutions . The value depends only on ; the determinant equation may have infinitely many solutions .
For uniqueness let and suppose with ; replacing by , which also lies in and expresses through in the same form, we may assume , and then step 2.1 gives ; moreover , because .
Fix an oriented basis of with reduced ratio . By step 1.1 the oriented bases of are exactly the with , and by step 2.1 such a basis again has ratio exactly when lies in the stabiliser ; the assignment is injective, so the oriented bases of with reduced ratio are in bijection with .
Some oriented basis of has maximal imaginary part of its ratio: the set of values over contains (take ), so it meets , and by step 3.1 the values in that interval form a nonempty finite set; its maximum is attained at some matrix and dominates every value, because a value outside the interval is .
If , then forces and ; both and lie in , so , hence .
If , then replacing by leaves unchanged, so we may assume ; by step 3.2, , so and therefore .
Let realize the maximum of step 4.1, with ratio . Replacing by changes the ratio to without changing its imaginary part or orientation. Choose ; if the resulting real part is , add one more copy of . Thus we may suppose , still with maximal imaginary part.
With the bound of step 3.2 reads , hence , and we distinguish three cases. If , then gives , contradicting . If , then ; the determinant condition gives and , and forces , or , , in both cases . If , then gives , so ; then and give and , so , , and with one computes , which forces and . Hence in every case of .
If , then is an oriented basis of whose ratio has , contradicting maximality; hence .
The ratio now has positive imaginary part, and . It is reduced unless and . In that case the oriented basis has ratio , with real part in , modulus and the same positive imaginary part, hence lies in .
Steps 4.2 and 5.2 prove that two reduced ratios related by a basis change are equal; with step 7.1 this gives existence and uniqueness of the reduced ratio of , and shows it is realized by at least one oriented basis.
By steps 1.3, 2.2 and 2.3 the stabiliser of is , of order four, when , the six-element set when , and , of order two, for every other reduced ; by step 3.3 these are exactly the numbers of oriented bases of with reduced ratio . Finally has the reduced oriented basis with ratio , and has the reduced oriented basis with ratio , so the exceptional cases occur.
The reduction uses the basis changes and . Positive definiteness of makes the relevant denominator pairs finite; step 5.2 handles the boundary of the modular fundamental domain.
Depends on
- Complex lattice and quotient torus
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- 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
Nothing in the library uses this result yet.
Dependency tree · two levels
26 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, Ch. 3, pp. 41-47 (standard reference, not scraped)
- C. T. McMullen, Advanced Complex Analysis, Math 213a course notes, Ch. 5 §5.1, pp. 79-90 (standard reference, not scraped)
- NIST Digital Library of Mathematical Functions, §23.2, equations 23.2.1-23.2.17 (standard reference, not scraped)