Geometry of numbers

From HandWiki

Geometry of numbers is the part of number theory which uses geometry for the study of algebraic numbers. Typically, a ring of algebraic integers is viewed as a lattice in [math]\displaystyle{ \mathbb R^n, }[/math] and the study of these lattices provides fundamental information on algebraic numbers.[1] The geometry of numbers was initiated by Hermann Minkowski (1910). The geometry of numbers has a close relationship with other fields of mathematics, especially functional analysis and Diophantine approximation, the problem of finding rational numbers that approximate an irrational quantity.[2]

Minkowski's results

Suppose that [math]\displaystyle{ \Gamma }[/math] is a lattice in [math]\displaystyle{ n }[/math]-dimensional Euclidean space [math]\displaystyle{ \mathbb{R}^n }[/math] and [math]\displaystyle{ K }[/math] is a convex centrally symmetric body. Minkowski's theorem, sometimes called Minkowski's first theorem, states that if [math]\displaystyle{ \operatorname{vol} (K)\gt 2^n \operatorname{vol}(\mathbb{R}^n/\Gamma) }[/math], then [math]\displaystyle{ K }[/math] contains a nonzero vector in [math]\displaystyle{ \Gamma }[/math].


The successive minimum [math]\displaystyle{ \lambda_k }[/math] is defined to be the inf of the numbers [math]\displaystyle{ \lambda }[/math] such that [math]\displaystyle{ \lambda K }[/math] contains [math]\displaystyle{ k }[/math] linearly independent vectors of [math]\displaystyle{ \Gamma }[/math]. Minkowski's theorem on successive minima, sometimes called Minkowski's second theorem, is a strengthening of his first theorem and states that[3]

[math]\displaystyle{ \lambda_1\lambda_2\cdots\lambda_n \operatorname{vol} (K)\le 2^n \operatorname{vol} (\mathbb{R}^n/\Gamma). }[/math]

Later research in the geometry of numbers

In 1930–1960 research on the geometry of numbers was conducted by many number theorists (including Louis Mordell, Harold Davenport and Carl Ludwig Siegel). In recent years, Lenstra, Brion, and Barvinok have developed combinatorial theories that enumerate the lattice points in some convex bodies.[4]

Subspace theorem of W. M. Schmidt

In the geometry of numbers, the subspace theorem was obtained by Wolfgang M. Schmidt in 1972.[5] It states that if n is a positive integer, and L1,...,Ln are linearly independent linear forms in n variables with algebraic coefficients and if ε>0 is any given real number, then the non-zero integer points x in n coordinates with

[math]\displaystyle{ |L_1(x)\cdots L_n(x)|\lt |x|^{-\varepsilon} }[/math]

lie in a finite number of proper subspaces of Qn.

Influence on functional analysis

Minkowski's geometry of numbers had a profound influence on functional analysis. Minkowski proved that symmetric convex bodies induce norms in finite-dimensional vector spaces. Minkowski's theorem was generalized to topological vector spaces by Kolmogorov, whose theorem states that the symmetric convex sets that are closed and bounded generate the topology of a Banach space.[6]

Researchers continue to study generalizations to star-shaped sets and other non-convex sets.[7]

References

  1. ↑ MSC classification, 2010, available at http://www.ams.org/msc/msc2010.html, Classification 11HXX.
  2. ↑ Schmidt's books. Template:Cite Geometric Algorithms and Combinatorial Optimization
  3. ↑ Cassels (1971) p. 203
  4. ↑ Grötschel et al., Lovász et al., Lovász, and Beck and Robins.
  5. ↑ Schmidt, Wolfgang M. Norm form equations. Ann. Math. (2) 96 (1972), pp. 526–551. See also Schmidt's books; compare Bombieri and Vaaler and also Bombieri and Gubler.
  6. ↑ For Kolmogorov's normability theorem, see Walter Rudin's Functional Analysis. For more results, see Schneider, and Thompson and see Kalton et al.
  7. ↑ Kalton et al. Gardner

Bibliography



Retrieved from "https://handwiki.org/wiki/index.php?title=Geometry_of_numbers&oldid=3357309"