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.
Signature constant rules out discriminant ±1
Example
Assume the Axiom of Choice. Write the Minkowski numerical constant of a signature with as . Then , and consequently the inequality that the class bound produces for a field of that signature forces . The two cases of degree are and , and for the bound reduces the constant to the auxiliary sequence .
Facts & Assumptions
Given: The Axiom of Choice and a signature with , together with a number field of that signature.
Minkowski bound: every class of contains an integral ideal with (Minkowski bound for ideal classes, The ideal class group).
For a nonzero integral ideal the norm is a finite positive integer, hence (The absolute norm of an integral ideal, A nonzero number-field ideal has finite quotient).
Gregory-Leibniz with and : with and with , so ; in particular and (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).
Bernoulli's inequality: for and natural (Bernoulli's inequality ).
The preceding corollary: for , (Nontrivial number fields have discriminant of absolute value greater than one).
Proof
Degree two: , while by [F3].
Auxiliary sequence: put for . Then by [F3]; for Bernoulli's inequality [F4] with gives , so by [F3], and therefore for every .
General signature: by [F3], so by step 1.2 and the hypothesis ; thus for every .
Class bound and conclusion: by [F1] the principal class contains an integral ideal with ; by [F2] is a positive integer, so . Since by steps 1.1 and 2.1, dividing gives , hence .
Summary: for every signature with the numerical constant is less than , so the Minkowski inequality forces ; the degree-two constants are and . This records exactly where the signature factor enters and recovers the conclusion of [F5] from the class bound alone.
Remarks
The example isolates the arithmetic of the constant: the factor is larger than , so the worst case for a given degree is the maximal number of conjugate pairs, and at the two constants and are already smaller than the smallest possible ideal norm. Only the elementary bounds and Bernoulli's inequality are used; the value of the constant is never needed beyond strict comparison with . Signatures with that are not realized by any number field cause no difficulty, since the statement is conditional on a field of the given signature existing.
Depends on
- Nontrivial number fields have discriminant of absolute value greater than one
- Minkowski bound for ideal classes
- The ideal class group
- The absolute norm of an integral ideal
- A nonzero number-field ideal has finite quotient
- Bernoulli's inequality $(1+x)^n \ge 1 + nx$
- The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
46 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, Algebraic Number Theory v3.08 (standard reference, not scraped)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)