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.
Minkowski Theory and Number Field Class Groups — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Artinian Rings and Length
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Dedekind Domains and Ideal Classes
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Fields and Cyclotomic Extensions
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Integral Extensions and Going Up
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Algebra Methods in Combinatorics
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Localisation of Modules and Support
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minkowski Theory and Number Field Class Groups
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Number Fields Rings of Integers and Discriminants
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- pi: the Equivalent Characterizations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Prime Ideal Decomposition Ramification and the Different
- Prime Spectra and Radicals
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Solvability by Radicals and Kummer Theory
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Products of Modules
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Field of Fractions and Localisation
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Real Gamma and Beta Functions
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Valuation Rings and Discrete Valuation Rings
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Volumes of Elementary Solids and Solids of Revolution
2 · Summary
The examples run the Minkowski bound as a computational tool. The Gaussian integers have trivial class group because ; the fields and have class group , exhibited through a ramified prime ideal of norm , or through the norm- and norm- ideals tied together by an element of norm ; and the quintic field of has trivial class group because no ideal of norm or exists.
The two final examples isolate the numerical and ramification content of the degree bound: the signature factor is always less than , forcing , and a field of degree greater than one cannot be unramified at every finite rational prime. The counterexample shows how mixing the scaled and unscaled embedding conventions changes the covolume and produces a false prediction from the equality criterion.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Minkowski bound for Gaussian integers
Example
Assume the Axiom of Choice. For the Minkowski constant is , so every class in has an integral representative of norm at most , hence of norm and equal to itself; the class group of the Gaussian integers is trivial and is a principal ideal domain.
Facts & Assumptions
Given: The Axiom of Choice and the imaginary quadratic field with and discriminant .
For the squarefree integer , which is , the quadratic-field formulas give and (Integers in a quadratic field, Discriminant of a quadratic field).
Signature: is the number of field embeddings fixing and is the number of complex-conjugate pairs among the nonreal field embeddings fixing , with (Archimedean embeddings and 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, so , and forces (The absolute norm of an integral ideal, A nonzero number-field ideal has finite quotient).
Gregory-Leibniz: with , hence (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).
Under the Axiom of Choice, the ring of integers of a number field is a Dedekind domain (Rings of integers are Dedekind domains).
Dedekind PID criterion: a Dedekind domain is a principal ideal domain if and only if its ideal class group is trivial (A Dedekind domain is a PID exactly when its class group is trivial).
Proof
By [F1], and . Every field embedding fixing sends to a root of , that is, to , and both of these are nonreal; so with by [F2].
Minkowski constant: by step 1.1 and [F1], ; by [F5] , so .
Every class of contains an integral ideal with by [F3] and step 2.1. By [F4] the norm is a positive integer, so and therefore , which is principal; hence every class is the principal class and is trivial.
By [F6] the Gaussian integers form a Dedekind domain, so the criterion [F7] applies and the triviality of the class group from step 3.1 makes a principal ideal domain.
In summary, has , is trivial, and is a principal ideal domain.
Remarks
This is the smallest case of the Minkowski bound: the signature contributes the factor rather than none, but the unique class bound still falls below the smallest norm of a nonzero nonunit ideal, so the bound certifies that the class group is trivial without any further computation. The passage from a trivial class group to the principal ideal domain property uses that is Dedekind, since a general domain with trivial class group need not be a PID.
Class group of Q(sqrt -5)
Example
Assume the Axiom of Choice. For the ideal class group is , generated by the class of the prime ideal . The concrete content is: , , the Minkowski constant satisfies , the ideal is the unique integral ideal of norm , it satisfies , and it is not principal because has no integer solution.
Facts & Assumptions
Given: The Axiom of Choice, with and discriminant , and the ideal .
For the squarefree integer , the quadratic-field formulas give and (Integers in a quadratic field, Discriminant of a quadratic field).
, from the Gregory-Leibniz partial sum through (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).
Minkowski bound: every class of contains an integral ideal with (Minkowski bound for ideal classes, The ideal class group).
For a nonzero integral ideal, ; for nonzero integral ideals ; and for , (The absolute norm of an integral ideal, Ideal norm is multiplicative, The norm of a principal integral ideal).
Field norm as a determinant: for the norm is the determinant of multiplication by on the two-dimensional -vector space (The norm and trace of a finite field extension). In the basis the matrix of multiplication by is , so .
If are nonzero integral ideals with finite, then : by the third isomorphism theorem for the additive groups, the group has order , hence is trivial.
The rule is a surjective ring homomorphism , because satisfies ; its kernel is , so and (The ideal generated by a subset and principal ideals).
Proof
By [F1], , , and the signature is with .
The rule is additive and multiplicative (the only nontrivial check is mapping to in ), is surjective, and its kernel consists of the with even, which are exactly the elements of the ideal : the kernel contains and , and conversely with even when is even. Hence and .
Minkowski constant: , since by [F2] and .
: the products of the generators and are , and , all multiples of , so ; by [F4] the norms are and , so [F6] gives .
Uniqueness of the norm- ideal: let be an integral ideal with . Then has two elements, so ; the composite sends to and to an element of the two-element ring with , so (as ); hence and lie in the kernel, the image of is , and ; with , [F6] yields .
is not principal: if , then and by [F4] and [F5] the equation would hold for . But gives , impossible, and gives ; so no such exists.
In the class group, is the identity class, while by step 2.4; hence has order exactly .
Every class has an integral representative with by [F3] and step 2.1, so its norm is or : norm forces , and norm forces by step 2.3.
Hence every class is either the principal class or , so is generated by the class of .
Class group of Q(sqrt 10)
Example
Assume the Axiom of Choice. For the ideal class group is , generated by the class of the prime ideal . The concrete content is: , , the signature is so that the Minkowski constant is , the ideals of norm and are exactly , and , the products , and are principal, and is not principal because has no integer solution.
Facts & Assumptions
Given: The Axiom of Choice, with and discriminant , and the element .
For the squarefree integer , which is not , the quadratic-field formulas give and (Integers in a quadratic field, Discriminant of a quadratic field).
Signature: is the number of field embeddings fixing and is the number of complex-conjugate pairs among the nonreal field embeddings fixing , with (Archimedean embeddings and 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 absolute norm is a finite positive integer; for nonzero integral ideals ; and for , (The absolute norm of an integral ideal, A nonzero number-field ideal has finite quotient, Ideal norm is multiplicative, The norm of a principal integral ideal).
Field norm as a determinant: for the norm is the determinant of multiplication by on the two-dimensional -vector space (The norm and trace of a finite field extension). In the basis the matrix of multiplication by is , so .
If are nonzero integral ideals with , then : the canonical surjection identifies the finite group with a quotient of the finite group of the same order, and Lagrange's theorem leaves only the trivial quotient (Lagrange's theorem: for every subgroup of a finite group ).
Product of ideals: for two-sided ideals , , and for a subset the ideal is the intersection of all ideals containing (The sum and product of two-sided ideals, The ideal generated by a subset and principal ideals).
Proof
By [F1], with . Every field embedding fixing sends to a root of , that is, to , and both of these are real; so with by [F2].
The map is a surjective ring homomorphism : it is additive, and maps to . Its kernel is , which equals the ideal : the products have even coefficient of , and conversely . Hence and by [F4].
Similarly is a surjective ring homomorphism : since , it sends to modulo . Its kernel is , which equals because when and conversely has congruent coefficients. So . Likewise is a surjective ring homomorphism with kernel , so .
: by [F7] the square is generated by the products of the generators , namely , and , so . All three generators are multiples of , giving ; conversely , so . Hence .
: by [F7] the product is generated by , , and , so . That second ideal contains and , hence contains , so it is and .
Minkowski constant: by step 1.1 and [F1], , because .
Uniqueness: let be an integral ideal with . Then has elements, so its additive group is generated by and it is isomorphic to ; the composite sends to an element with . For one has , so , hence and lie in the kernel and the image of is ; with , step 1.2 and [F6] give . For one has , so : if then and if then , so by step 1.3 and [F6] is or .
By [F7] the product is generated by the products , , and ; the identity exhibits in the product, so .
is not principal: if with , then by [F4] and [F5], , so . Reducing modulo gives , but the squares modulo are and neither nor occurs; this contradiction shows no such exists.
Inclusion and equal norms force equality: by [F5] and [F4], , while by steps 1.2 and 1.3; with from step 2.3, [F6] gives .
Principal products are the identity class: step 1.4 gives , and step 3.1 gives , so ; step 1.5 gives , so .
Hence by step 4.1 while by step 2.4, so has order exactly .
By [F3] and step 2.1 every class of contains an integral ideal with , and is a positive integer by [F4], so . If then is trivial, that is ; if then ; and if then is or , by step 2.2. By step 4.1 all of these ideals represent either the identity class or .
Therefore every class of is or , so is generated by the class of .
Remarks
The example is the real-quadratic counterpart of the computation for : the ramified prime gives with nonprincipal, the split prime gives two conjugate prime ideals whose product is , and the element of norm links the two, forcing . Since the Minkowski constant carries no factor and equals ; the bound leaves only the norms , and each of these norms has exactly the ideals listed.
Higher-degree class group by norm exclusions
Example
Assume the Axiom of Choice. Let be a root of and . Then , , the Minkowski constant satisfies , and is trivial, because no nonzero integral ideal of has norm or and every class has a representative of norm .
Facts & Assumptions
Given: The Axiom of Choice, the polynomial , and a root of with .
Reduction modulo a prime: if is primitive of positive degree, does not divide its leading coefficient, and the reduction is irreducible, then is irreducible in (Irreducibility after reduction modulo a prime implies irreducibility over when the leading coefficient survives).
Discriminant and resultant: for monic of degree , (For monic of degree , ), and in an algebra in which splits with roots one has and (The monic resultant from the symmetric coefficient expression of , The discriminant of a monic polynomial as the coefficient expression of ).
Vieta: if splits in a commutative algebra as , then (Vieta's formulas identify the coefficients of a split monic polynomial with elementary symmetric functions of its roots).
Power-basis discriminant: if is the degree- monic minimal polynomial of , then (Power-basis and polynomial discriminants).
If integral generates and its power-basis discriminant is squarefree, then (Squarefree power discriminant criterion).
exactly when its monic minimal polynomial over lies in (Minimal-polynomial criterion for algebraic integers).
For a nonzero integral ideal of norm with a rational prime: , and for a nonzero prime one has (The absolute norm of an integral ideal, The norm of a prime ideal).
Minkowski bound: every class of contains an integral ideal with (Minkowski bound for ideal classes, The ideal class group).
Gregory-Leibniz: the partial sum of through is with positive remainder, giving (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).
Proof
Reduction modulo 3: has values at , so it has no linear factor; division by the three monic irreducible quadratics leaves remainders for (where ), for (where ), and for (where ); hence has no factor of degree at most , and a degree- reducible polynomial would have one, so is irreducible over .
Discriminant: in write ; by [F2] and [F3], and . Since and (as ), we have and ; moreover . Hence .
By [F1] with the polynomial is irreducible over , so it is the minimal polynomial of , has degree , and by [F6].
No ideal of norm or : if , then is a commutative ring with elements, hence isomorphic to ; the composite with kills , so has a root mod by [F7]; but has values and has values at all elements of their prime fields, a contradiction.
The factorisation consists of distinct primes, so is squarefree; by [F2] and [F4] the power-basis discriminant of is , so [F5] gives and .
Signature: vanishes exactly at with ; since , and , using . The derivative is positive on , negative on , and positive on , so the local maximum and local minimum are both negative. Since as and as , there is exactly one real root and two conjugate pairs of nonreal roots, that is .
Minkowski constant: , using of [F9] and .
Every class of has an integral representative with by [F8] and step 4.1; the norm is a positive integer, so , and step 2.2 rules out and , leaving , i.e. ; hence every class is principal and is trivial.
Therefore , , , and is trivial.
Remarks
The example illustrates the standard norm-exclusion computation in degree : irreducibility modulo the small prime produces the field, the resultant computation of the discriminant certifies the ring of integers because is squarefree, and the small primes and are eliminated by checking that has no root modulo them. A root modulo is exactly what a nonzero ideal of norm would produce.
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.
No nontrivial everywhere unramified number field over Q
Example
Assume the Axiom of Choice. A finite number field cannot be unramified at every finite rational prime. Indeed, if were unramified at every rational prime, the ramification-discriminant criterion would leave a nonzero integer with no prime divisor, so ; but every field of degree has . The statement concerns finite primes only, and no archimedean convention is used.
Facts & Assumptions
Given: The Axiom of Choice, a number field with , so that , and the discriminant .
A rational prime ramifies in if and only if (Ramification is detected by the number-field discriminant).
Every finite number field with has a rational prime that ramifies in (Every nontrivial number field has a ramified finite prime).
is a nonzero signed integer (Number-field discriminant is well-defined and nonzero).
Every integer greater than has a prime divisor (Every integer has a prime divisor; indeed the least divisor of that exceeds is prime).
A prime is unramified in an extension when all its ramification indices are , and ramified otherwise; for the relevant primes of are the rational primes (Splitting and ramification terminology).
Proof
By [F4] the discriminant is a nonzero integer.
If is unramified at every rational prime, then no rational prime divides : for if , then [F1] makes ramified in , and [F6] exhibits a ramification index exceeding at , contrary to the hypothesis.
Conversely, if no rational prime divides , then : otherwise and [F5] would produce a rational prime dividing , hence dividing , and by step 1.1 leaves .
Equivalence: is unramified at every rational prime if and only if . Indeed, unramified everywhere gives no prime divisor of by step 2.1 and then by step 2.2; conversely, if then no rational prime divides , so no rational prime ramifies by [F1].
But , so [F3] gives , contradicting the equivalence in step 3.1; equivalently, [F2] directly produces a ramified rational prime.
Therefore no finite number field is unramified at every finite rational prime. The argument uses only finite primes: is the determinant of the trace pairing of an integral basis, the criterion [F1] concerns rational primes, and no archimedean place enters; correspondingly and itself has no ramified primes.
Remarks
The example is the contrapositive form of the ramification criterion: an integer discriminant with no prime divisor must be , and is impossible for a field of degree greater than one. The hypothesis is essential, since and has no ramified finite prime. The phrase "every finite rational prime" is deliberate: the criterion and the discriminant are statements about finite primes, and no claim about archimedean places is made or needed.
Mixing scaled and unscaled Minkowski covolumes fails
Statement refuted
For the unscaled Minkowski image of is , of covolume , and the -scaled image, obtained by multiplying both real coordinates of the unscaled embedding by , is the lattice , of covolume . The statement refuted is the claim that the unscaled covolume may serve as the covolume of the scaled lattice in the equality form of Minkowski's theorem. Assume the Axiom of Choice. The closed disc of radius has area and is compact, convex and centrally symmetric, so under that claim Minkowski's equality criterion would predict a nonzero point of in the disc; but every nonzero vector of has length . The correct covolume of the scaled lattice is , and with the threshold the true criterion makes no prediction. Mixing the two normalizations is therefore invalid.
Facts & Assumptions
Given: The Axiom of Choice, the field , its ring of integers , the unscaled Minkowski embedding , and the closed disc .
The Axiom of Choice implies the Axiom of Countable Choice (AC implies DC implies countable choice), the choice hypothesis of the area computation [F5], invoked in step 1.2; the equality-form Minkowski criterion [F6] is applied under the Axiom of Choice assumed in the statement.
For the quadratic-field formulas give and (Integers in a quadratic field, Discriminant of a quadratic field).
has signature , and the unscaled Minkowski embedding sends to the pair of the single complex embedding; hence (Unscaled Minkowski embedding).
For a nonzero integral ideal the unscaled image is a full lattice with ; applied to this gives (Covolume of an integral ideal lattice).
For a full lattice with -basis the covolume is ; the scaled lattice has basis , so its covolume is (Full Euclidean lattice and covolume).
The closed disc of radius has area (Polar coordinates decompose Lebesgue measure into r^{n-1} dr d sigma).
Minkowski convex-body theorem at equality: a compact convex centrally symmetric with contains a nonzero point of the full lattice (Minkowski convex-body theorem at equality).
The finite-remainder Gregory--Leibniz formula at has partial sum and positive remainder, so . At the partial sum is and the remainder is negative, so and (The Gregory-Leibniz series: pi over four equals 1-1/3+1/5-1/7+...).
Proof
By [F1] the field is with and , so and [F3] gives , while [F2] identifies the unscaled lattice itself as .
The disc is compact, convex and centrally symmetric, and by [F5], with the Countable Choice hypothesis supplied by [A1], its area is . By [F7], , so this area exceeds .
The scaled lattice is , the image of under the coordinatewise -scaling of ; by [F4] its covolume is .
Every nonzero has , so and ; hence .
If the unscaled covolume were used as the covolume of , then step 1.2 would verify all hypotheses of the equality-form criterion [F6] for and , and [F6] would produce a nonzero point of , contradicting step 3.1. This refutes the mixed-convention claim.
The correct criterion is not violated: by step 2.1 the true covolume of is , so the threshold is . By [F7], , so the hypothesis of [F6] fails and [F6] yields no lattice point in .
Remarks
The two normalizations differ by the factor in each complex coordinate: the unscaled convention has , while the scaled convention has covolume and -weighted complex coordinates. The numerical coincidence that lies between and is what makes the disc of radius a witness: it is large enough for the wrong threshold and too small for the right one.