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.
Global approximation of finitely many square classes
Statement
Let be a finite set of places of , and for each let be a prescribed square class. Then there exists whose image in is for every , and whose valuation is even at every prime except possibly one extra odd prime.
Facts & Assumptions
Given: A finite set of places and prescribed local square classes for .
Weak approximation simultaneously approximates finitely many rational places (Weak approximation for rational places).
Dirichlet's theorem provides infinitely many primes in any reduced arithmetic progression (Dirichlet's theorem on primes in arithmetic progressions).
Proof
Choose representatives of the classes . By [L1], there exists sufficiently close to every that is a square in for each . Thus already has the required local square classes on .
Only finitely many primes outside occur to odd valuation in ; let be that set and put , with when . Choose an odd prime such that is a square in every completion with . This is a finite list of sign and congruence conditions, so [L2] supplies such a prime. Now set For each , the factor is a local square, so and define the same square class in . For , the extra factor changes the odd valuation of to an even one; for the valuation was already even and stays even; and at the new valuation is , which is odd because . Thus has the prescribed local square classes on and has even valuation at every prime outside except possibly the one extra odd prime .
Depends on
Used by
Dependency tree · two levels
8 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
- Andrew V. Sutherland, 18.782 Lecture 11, Theorem 11.14 (standard reference, not scraped)
- Sam Raskin, Introduction to the Arithmetic Theory of Quadratic Forms, section 4.7 (standard reference, not scraped)