LLMpediaThe first transparent, open encyclopedia generated by LLMs

real quadratic field

Generated by GPT-5-mini
Note: This article was automatically generated by a large language model (LLM) from purely parametric knowledge (no retrieval). It may contain inaccuracies or hallucinations. This encyclopedia is part of a research project currently under review.
Article Genealogy
Parent: Hecke L-series Hop 6
Expansion Funnel Raw 71 → Dedup 0 → NER 0 → Enqueued 0
1. Extracted71
2. After dedup0 (None)
3. After NER0 ()
4. Enqueued0 ()
real quadratic field
NameReal quadratic field
Signature(2,0)

real quadratic field A real quadratic field is a quadratic extension of Q obtained by adjoining the square root of a positive squarefree integer, producing a degree‑2 number field with two real embeddings. These fields play central roles in the work of Carl Friedrich Gauss, Richard Dedekind, Ernst Kummer, Heinrich Weber, and contemporary researchers in Andrew Wiles‑era arithmetic. They connect to classical objects such as the Pell equation, continued fractions studied by Joseph-Louis Lagrange, and modern frameworks like the Langlands program and Iwasawa theory.

Definition and basic properties

A real quadratic field K = Q(√d) is defined by a positive squarefree integer d; its ring of integers OK depends on d and was analyzed by Dirichlet and Dedekind. The extension K/Q has Galois group of order 2 generated by the nontrivial automorphism studied by Évariste Galois, and has two real embeddings into R related to the work of Carl Gustav Jacobi. The field discriminant ΔK and the conductor reflect arithmetic described in the papers of Heinrich Martin Weber and David Hilbert. Ramification of primes in K is governed by decomposition laws used in Frobenius's studies and later in class field theory developed by Emil Artin and Teiji Takagi.

Examples and classification

Classical examples include K = Q(√2), Q(√3), Q(√5), Q(√13) which were examined by Euclid's successors and by Pythagoras‑era mathematicians indirectly via quadratic forms. The narrow classification of fields by discriminant appears in tables compiled by Gauss and modernized by John H. Conway and D. A. Buell. Computational catalogs rely on algorithms from Srinivasa Ramanujan‑inspired formulas and implementations in Antoon Bosscher‑style databases and software such as Magma (software), SageMath, and PARI/GP.

Units and Dirichlet's unit theorem

Dirichlet's unit theorem, proved by Peter Gustav Lejeune Dirichlet, asserts that the unit group OK× is infinite cyclic modulo roots of unity, a structure first exploited in explicit examples by Ferdinand von Lindemann and Adrien-Marie Legendre. For K real quadratic, fundamental units often arise from continued fraction expansions analyzed by Lagrange and explicit generators were computed by D. H. Lehmer and Herbert Wilf. The growth of fundamental units links to conjectures studied by Anatole Katok and asymptotic results considered by Harold Davenport.

Class number and class group

The class group Cl(OK) measures failure of unique factorization, a phenomenon central to Gauss's Disquisitiones and later to Kummer's work on cyclotomic fields and the proof strategies of Andrew Wiles. Real quadratic fields exhibit varied class numbers; famous open problems and heuristics were proposed by Henri Cohen and Hendrik Lenstra, with systematic tables by Alan Baker and computational verification by Hiroshi Sato. The class number one problem for real quadratic fields relates to historic lists studied by Harold Stark and modern advances by Noam Elkies.

Continued fractions and Pell's equation

Periodic continued fraction expansions of √d, proven periodic by Lagrange, produce solutions to Pell's equation x^2 − d y^2 = 1, a Diophantine relation central to Brahmagupta's and John Pell's historical investigations. Minimal solutions (x,y) correspond to fundamental units described by Victor Moll and used in cryptographic constructions referencing Ron Rivest and Adi Shamir. The interaction between continued fractions, reduction theory of binary quadratic forms (developed by Gauss) and computational number theory links to algorithms by Daniel Shanks.

Arithmetic invariants (discriminant, regulator, zeta function)

The field discriminant ΔK determines ramification and conductor properties explored by Dedekind and appears in analytic formulas such as the analytic class number formula connecting the class number hK, regulator RK, number of roots of unity, and the Dedekind zeta value ζK(0), building on work of Ernst Eduard Kummer and Atle Selberg. The regulator captures the logarithmic size of the fundamental unit and features in asymptotic studies by John Tate and Serge Lang. The Dedekind zeta function ζK(s) admits analytic continuation and a functional equation studied by Bernhard Riemann and generalized by Hecke and Hans Maaß.

Applications and connections to other areas

Real quadratic fields appear in explicit class field theory as used in constructions by Kronecker and in Stark's conjectures linking L‑values to units, addressed by Harold Stark and Don Zagier. They connect to modular forms studied by Kurt Hecke and Jean-Pierre Serre, to continued fraction algorithms used in computational complexity theory by Alan Turing‑era methods, and to cryptography in schemes referencing Diffie–Hellman and RSA primitives via infrastructure-based protocols inspired by H. W. Lenstra Jr.. Their role in homological and geometric settings appears in work of William Thurston and intersections with K-theory studied by Daniel Quillen.

Category:Number fields