Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 (r1,r2) with n=r1+2r2>1 as Cn,r2=(4/π)r2n!/nn. Then Cn,r2<1, and consequently the inequality 1≤Cn,r2∣dK∣ that the class bound produces for a field of that signature forces ∣dK∣>1. The two cases of degree 2 are C2,0=1/2 and C2,1=2/π, and for n≥3 the bound r2≤n/2 reduces the constant to the auxiliary sequence Un=(4/π)n/2n!/nn<1.

Facts & Assumptions

Given: The Axiom of Choice and a signature (r1,r2) with n=r1+2r2>1, together with a number field K of that signature.

[F1]

Minkowski bound: every class of Cl⁡(OK) contains an integral ideal b with Nb≤MK=(4/π)r2n!nn∣dK∣ (Minkowski bound for ideal classes, The ideal class group).

[F2]

For a nonzero integral ideal b the norm Nb=∣OK/b∣ is a finite positive integer, hence Nb≥1 (The absolute norm of an integral ideal, A nonzero number-field ideal has finite quotient).

[F3]

Gregory-Leibniz with N=1 and N=2: π/4=1−1/3+R1 with R1=∫01x4/(1+x2) dx>0 and π/4=1−1/3+1/5+R2 with R2=−∫01x6/(1+x2) dx<0, so 8/3<π<52/15<4; in particular 2/π<1 and 4/π>1 (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).

[F4]

Bernoulli's inequality: (1+x)m≥1+mx for x≥−1 and natural m (Bernoulli's inequality (1+x)n≥1+nx).

[F5]

The preceding corollary: for n>1, ∣dK∣>1 (Nontrivial number fields have discriminant of absolute value greater than one).

Proof

1.1F3algebra

Degree two: C2,0=(4/π)0⋅2!/22=1/2<1, while C2,1=(4/π)⋅2!/22=2/π<1 by [F3].

1.2F3F4algebra

Auxiliary sequence: put Um:=(4/π)m/2m!/mm for m≥2. Then U2=2/π<1 by [F3]; for m≥2 Bernoulli's inequality [F4] with x=1/m gives (1+1/m)m≥2, so Um+1/Um=2π(mm+1)m≤1π<1 by [F3], and therefore Um≤U2(π)−(m−2)<1 for every m≥2.

2.1F3step 1.2givenalgebra

General signature: 4/π>1 by [F3], so Cn,r2=(4/π)r2n!/nn≤(4/π)n/2n!/nn=Un<1 by step 1.2 and the hypothesis r2≤n/2; thus Cn,r2<1 for every n>1.

3.1F1F2step 1.1step 2.1algebra

Class bound and conclusion: by [F1] the principal class contains an integral ideal b with Nb≤Cn,r2∣dK∣; by [F2] Nb is a positive integer, so 1≤Nb≤Cn,r2∣dK∣. Since 0<Cn,r2<1 by steps 1.1 and 2.1, dividing gives ∣dK∣≥1/Cn,r2>1, hence ∣dK∣>1.

4.1F5step 1.1step 2.1step 3.1∎

Summary: for every signature with n>1 the numerical constant Cn,r2 is less than 1, so the Minkowski inequality 1≤Cn,r2∣dK∣ forces ∣dK∣>1; the degree-two constants are C2,0=1/2 and C2,1=2/π. This records exactly where the signature factor (4/π)r2 enters and recovers the conclusion of [F5] from the class bound alone.

Remarks

The example isolates the arithmetic of the constant: the factor 4/π is larger than 1, so the worst case for a given degree is the maximal number r2≤n/2 of conjugate pairs, and at n=2 the two constants 1/2 and 2/π are already smaller than the smallest possible ideal norm. Only the elementary bounds 2<π<4 and Bernoulli's inequality are used; the value of the constant is never needed beyond strict comparison with 1. Signatures with n>1 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

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