Absolute logarithmic Weil height Created 2026-09-24 Updated 2026-11-05
The Absolute logarithmic Weil height is the logarithm of the absolute multiplicative height of an algebraic number. If its primitive integer minimal polynomial is , thenThus it is the logarithm of the Mahler measure divided by the degree.
For a reduced rational , . It satisfies for nonzero and integral . Unlike a single absolute value, it records denominator complexity and the behavior of all conjugates, making it suitable for arithmetic bounds that should not depend on a chosen embedding.
Algebraic integer Created 2026-09-24 Updated 2026-10-13
An algebraic number is an algebraic integer if it is a polynomial root of a monic polynomial with integer coefficients:Equivalently, its algebraic minimal polynomial over has integer coefficients. The requirement that the leading coefficient be one matters: satisfies and is an algebraic number, but is not an algebraic integer. In fact the rational numbers that are algebraic integers are exactly the integers.[ref]
Some useful computed examples are:
- satisfies .
- satisfies .
- satisfies , although its displayed coefficients in the basis are not integers.
- has algebraic minimal polynomial , so it is not an algebraic integer even though it satisfies .
Algebraic integers are closed under addition, subtraction, and multiplication. Thus they provide an arithmetic ring, while division is allowed only when the result is again an algebraic integer. The algebraic integer module criterion explains this closure without having to find a new polynomial for every sum and product.
Algebraic number Created 2026-09-24 Updated 2026-11-05
An algebraic number is a complex number satisfying a nonzero polynomial equation with coefficients in the rational numbers, or equivalently with coefficients in the integers after clearing denominators. For instance, satisfies and satisfies . Every rational number is algebraic, since vanishes at it.[ref]
A Computational Introduction to Number Theory and Algebra by Victor Shoup. §16.6, algebraic and transcendental elements
The monic irreducible polynomial over that vanishes at an algebraic number is its minimal polynomial; its degree measures the number of independent rational coordinates needed in the simple field extension it generates. Thus has basis . An algebraic integer has the stronger requirement of satisfying a monic polynomial with coefficients in the integers: is algebraic but is not an algebraic integer.
Conjugate element (field theory) Created 2026-10-14 Updated 2026-10-31
The algebraic conjugates of an algebraic element over a field are the polynomial roots of its algebraic minimal polynomial over in an algebraic closure.
The algebraic conjugates of an algebraic number are the polynomial roots of its algebraic minimal polynomial, equivalently its images under field embeddings of its number field into an algebraic closure.
Countability of algebraic numbers Created 2026-09-24 Updated 2026-11-05
The polynomials over the integers form a countable set, because they are finite lists of integers. Every nonzero polynomial has finitely many polynomial roots, by the Lagrange root bound over a field. Each algebraic number is a polynomial root of one of these nonzero polynomials over the integers, so the algebraic numbers form a countable union of finite sets and are countable. They are infinite because they contain all integers. Excluding the zero polynomial is essential to the root-counting step.
Countability of integer polynomial rings 2026-10-14
For every fixed positive integer , the polynomial ring with integer coefficients in indeterminates is countably infinite. Polynomials of bounded total degree have only finitely many possible monomials, so they are encoded by a finite Cartesian power of the integers. Taking a countable union of countable sets over degree bounds proves countability; constant polynomials supply an infinite subset. Nonzero one-variable polynomials have finitely many real roots, so the real algebraic numbers form a countable set as well.
Diophantine approximation Created 2026-09-24 Updated 2026-11-05
Diophantine approximation asks how closely a real or complex quantity can be approximated by rational numbers or algebraic numbers of bounded arithmetic complexity. For a real , one compares with functions of the denominator .
For example, continued fraction convergents to give approximations . A nonzero integer norm of also supplies a lower bound, preventing arbitrarily exceptional accuracy. The Liouville approximation theorem extends this idea to algebraic numbers, while Roth's theorem sharpens the exponent for algebraic irrational inputs. Approximation quality can therefore distinguish algebraic from transcendental behavior, not merely give convenient decimal values.
Exponent bound for a binomial power equation Created 2026-10-14 Updated 2026-11-05
Fix positive integers and a nonzero integer . In positive integer solutions of with and , the exponent is bounded effectively in terms of .
When and the larger-variable power is sufficiently large, put . The equation makes nonzero and givesA Baker lower bound for a homogeneous linear form in logarithms gives : the algebraic numbers are the rationals and , the latter has height at most , and the coefficients are . Dividing by yields , which bounds . If the larger-variable power is bounded, so is . For , the equation gives the bound directly.
This is a bound on the exponent. Fixed exponents one or two can still admit infinitely many pairs ; for instance, is a negative Pell equation after exchanging variables. The Thue theorem must not be applied to this quadratic case. The constant solution , possible when , is excluded by .
Field of algebraic numbers Created 2026-10-31 Updated 2026-11-05
The complex algebraic numbers form a field, the algebraic closure of inside . To see closure under the field operations, if are algebraic numbers, the tower law makes a finite-dimensional field extension of . Every element of this extension is an algebraic element, because its successive powers are linearly dependent. In particular it contains , and when .
It is an infinite-degree algebraic extension. A primitive th root of unity has minimal polynomial of an algebraic element of degree for every prime , so the degrees of its finite subextensions are unbounded. Finally a complex root of a polynomial whose coefficients are algebraic numbers is itself algebraic over their finite-degree coefficient field and hence over , again by the tower law. Thus every such polynomial splits in this field, establishing the algebraic closure assertion.
General lower bound for a linear form in logarithms Created 2026-09-24 Updated 2026-11-05
Choose logarithms of nonzero algebraic numbers and algebraic numbers , and putLet be the naive polynomial height of the primitive algebraic minimal polynomial of . Choose and . There is an effectively computable , depending only on and the field extension degree of the number field generated by the data, such thatThe algebraic constant term is included here. Theorem 1.1 of the primary Philippon–Waldschmidt paper bounds below by , with and . Our assumption absorbs the extra term into . Increasing each by a fixed power depending only on meets their normalization , with the change absorbed into . Thus this is a corollary of their general algebraic-coefficient theorem, including , rather than an application of only the homogeneous integer-coefficient bound.[ref]
Height function Created 2026-10-03 Updated 2026-11-05
A height function measures arithmetic complexity rather than physical size. For a reduced rational number , its multiplicative height is , and its logarithmic height is . Thus is close to one in real size but has height .
For an algebraic number of degree , let its primitive irreducible integer polynomial have leading coefficient and complex roots . The Absolute logarithmic Weil height is . Bounding both height and degree leaves finitely many possibilities, making heights useful in Diophantine equations and finiteness arguments.
Irrational number Created 2026-09-24 Updated 2026-11-05
An irrational number is a real number that is not a rational number: it cannot be written as with integers and . Its decimal expansion is infinite and not eventually periodic. Both and are irrational, but their algebraic behavior differs: is an algebraic number, while is a transcendental number.
The irrationality of the square root of two supplies a basic example: a reduced fraction with square two would force both and to be even. Irrational numbers are needed to describe lengths such as the diagonal of a unit square, which rational coordinates alone cannot express.
Lindemann–Weierstrass theorem Created 2026-10-14 Updated 2026-11-05
For distinct algebraic numbers , the numbers are linearly independent over . Equivalently, exponentials of numbers linearly independent over are algebraically independent over . The special case of a nonzero algebraic exponent gives a transcendental exponential. In particular forces to be transcendental.
Linear form in logarithms of algebraic numbers Created 2026-09-24 Updated 2026-11-05
A linear form in logarithms of algebraic numbers combines chosen complex logarithms of nonzero algebraic numbers:The coefficients may be algebraic numbers; the homogeneous integer-coefficient case has and . Each logarithm branch must be fixed, because changing it adds a multiple of .
When all are positive real and real logarithms are used, the homogeneous form is the logarithm of . Thus a small nonzero linear form in logarithms of algebraic numbers expresses an unexpectedly close multiplicative relation. For instance,Baker's theorem proves qualitative nonvanishing and transcendence statements, while the general lower bound for a linear form in logarithms gives quantitative separation from zero. Comparing such a lower bound with a small upper bound supplied by a Diophantine equation can bound its exponents, as in the exponent bound for a binomial power equation.
Liouville constant 2026-11-05
The Liouville constant is the real numberIts decimal ones occur at factorial positions . The growing gaps make exceptionally well approximated by rational numbers. If is the truncation after terms, with , thenThe strict lower bound shows the truncations never equal .
For any fixed degree of an algebraic number , these errors eventually fall below every positive constant times . The Liouville approximation theorem forbids this for an irrational algebraic number of degree . A rational number is also impossible, since distinct fractions satisfy . Hence is a transcendental number. The construction turns deliberately sparse decimal digits into a proof of transcendence.
Liouville number Created 2026-09-24 Updated 2026-11-05
A Liouville number is a real irrational number such that, for every positive integer , there are integers with and . It admits rational approximations of arbitrarily high polynomial accuracy.
For example, is a Liouville number: truncating after leaves a tail smaller than a constant times , while the denominator is . The Liouville approximation theorem bounds how well a fixed algebraic number that is an irrational number can be approximated, proving that every Liouville number is transcendental. The converse fails: transcendence alone does not require such exceptional approximations.
Number field Created 2026-09-24 Updated 2026-10-13
A number field is a finite field extension of the rational numbers. Its degree of a field extension is its dimension as a vector space over . Every element is an algebraic number; the primitive element theorem also says that for some single algebraic number .
For example,The basis makes arithmetic explicit: use to reduce products. Every nonzero element has its inverse in the same field:The denominator cannot vanish unless , since is not a rational number. For instance, belongs to the number field, although it is not an algebraic integer.
A degree- number field has exactly distinct field embeddings into the complex numbers fixing , because every finite field extension in characteristic zero is a separable field extension. For these are the two real mapsBoth preserve addition and multiplication. Keeping both values, rather than just the positive choice of , is what makes the field norm and the Minkowski embedding of a number field useful.
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 1 Solution Created 2026-10-03 Updated 2026-10-14
We first give an auxiliary-integral proof, rather than deducing both requested results from a theorem only stated later. The following symmetric Hermite integral obstruction will do both jobs. Supposewhere and are integers, the distinct nonzero algebraic exponents form a Galois-stable set, and their weights are invariant under conjugation. Choose vanishing at those exponents, with , and a positive integer for which every is an algebraic integer. For a large prime number , letAt zero, derivatives below vanish; the derivative of order equals . All higher derivatives at zero are integers divisible by . At each , derivatives below vanish and all higher derivatives belong to in a Galois splitting field . Indeed their coefficients contain , divisible by for , and every is integral for . ConsequentlyGalois invariance makes the sum rational, and integrality makes it an integer. For prime numbers not dividing it is nonzero.
But , so integration along the straight segment to givesMultiply by the weights and use the assumed exponential relation. This expresses as the sum of these integrals. On the finitely many fixed segments, their absolute values are at most for a fixed : all polynomial and exponential factors have fixed bounds, and is linear in . Thus , contradicting its being a nonzero integer. The obstruction is proved.
If were algebraic, an integral polynomial relation would give with . Integer exponents and weights satisfy the obstruction, so is transcendental.
If were algebraic, put and let be its algebraic conjugates. Since , the product vanishes. Expand it and collect equal subset sums. The zero sums contribute a positive integer ; the nonzero sums give a Galois-stable list with positive integral multiplicities. This is precisely the prohibited relation. Hence is transcendental.
The general Lindemann–Weierstrass theorem states that exponentials of distinct algebraic numbers are linearly independent over . Suppose the sine quotient were algebraic, say . The denominator is nonzero: would give a forbidden relation between the exponentials of the distinct algebraic numbers . The quotient identity would giveThe four exponents are distinct under the stated nonzero and non-opposite assumptions, so this also contradicts linear independence. Therefore
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 4 ii Solution Created 2026-10-03 Updated 2026-10-14
In Siegel's original convention, an E-function is an entire series with coefficients in a fixed number field, satisfying a nonzero linear differential equation over , together with these arithmetic bounds: for every , all conjugates of have size , and some positive integer makes every , , an algebraic integer. A frequently used stricter convention replaces both bounds by . The original and strict growth definitions should not simply be declared equivalent; the exponential examples below satisfy the strict one.
For sums, work in the compositum of the coefficient fields. Coefficient conjugate bounds add. The product of the two common denominators clears both lists; using in each original denominator bound gives the required product bound. Finally all derivatives of lie in the sum of the two finite-dimensional derivative spaces over that rational function field, so they satisfy a nontrivial linear dependence, giving a differential equation for the sum. Thus sums are again E-functions, the addition closure of Siegel E-functions.
The Siegel–Shidlovsky theorem states that if a vector of E-functions satisfies with rational-function matrix over , then at every nonzero algebraic which is not a pole of ,In particular algebraically independent functions give algebraically independent values.
Take for algebraic numbers linearly independent over . Their coefficients are with exponential conjugate and denominator bounds, and . A polynomial relation among the functions expands into a relation among exponentials with distinct exponents and polynomial coefficients after clearing rational-function denominators; exponential-polynomial independence excludes it. At the theorem gives algebraic independence of the . For arbitrary distinct algebraic , choose a rational basis of their span and divide that basis by a common denominator. The are distinct Laurent monomials in the corresponding algebraically independent exponential values, so are linearly independent over . This recovers the general Lindemann–Weierstrass theorem. Its simplest instance uses just at nonzero algebraic .
Past exam of the mathematics course of the University of Cambridge 2001 iii Paper 20 5 Solution Created 2026-10-03 Updated 2026-10-14
Fix fundamental units and write . Rank zero already gives a finite unit group. Otherwise put . The logarithmic embedding in Dirichlet's theorem has a weighted sum-zero image and is injective on the free exponent lattice. Norm equivalence and that sum-zero condition give an archimedean embedding withThis is the small archimedean value of a large unit. From the equation, is exponentially close to one. Also by the arithmetic height inequalities for , so the fundamental-unit exponents of have size .
For large , take the small-branch logarithm of . With it is the nonzero formusing fixed logarithms and . The integer corrects the branch, and nonzero follows since would force . Its upper bound is . The assumed effective logarithmic-form estimate for the fixed algebraic numbers gives . Thus , effectively bounding . The finitely many embeddings and torsion choices give uniform constants. Therefore there are only finitely many unit solutions, and their exponents are effectively bounded.
For the Thue application, take an irreducible integral binary form of degree and . In a splitting field, write and put , which are algebraic integers. The integral factors satisfy . Each ideal therefore divides one fixed ideal, giving finitely many possibilities. Choose a generator for each principal possibility, so with units .
For three distinct roots,Division by the third term gives a fixed-coefficient unit equation in . Its solutions are finite, hence there are finitely many values of . This ratio determines the rational direction , since the roots are distinct. In a fixed direction, homogeneity and leave only finitely many integer scales. This proves Thue theorem, and the argument also works for a form with at least three distinct projective roots even if reducible.
The hyperelliptic alternative uses a related factorization for the usual nondegenerate case with squarefree of degree at least three. For , ideals of two different root factors can share primes only above the fixed root differences and the leading coefficient. At other primes their valuations are even. Finite exceptional-prime and ideal-class choices, together with units modulo squares, reduce the factors to finitely many expressions . Relations between distinct root factors then give simultaneous norm or Pell-type equations. Writing their solutions in fundamental units and applying the same small-value/logarithmic-form estimates bounds the unit exponents, hence . The common-factor and square-class reductions are essential; a single quadratic norm equation alone can have infinitely many Pell solutions. This outlines the effective hyperelliptic treatment as well as the explicit Thue reduction.