Brauer's theorem on forms

Last updated
There also is Brauer's theorem on induced characters.

In mathematics, Brauer's theorem, named for Richard Brauer, is a result on the representability of 0 by forms over certain fields in sufficiently many variables. [1]

Contents

Statement of Brauer's theorem

Let K be a field such that for every integer r > 0 there exists an integer ψ(r) such that for n ≥ ψ(r) every equation

has a non-trivial (i.e. not all xi are equal to 0) solution in K. Then, given homogeneous polynomials f1,...,fk of degrees r1,...,rk respectively with coefficients in K, for every set of positive integers r1,...,rk and every non-negative integer l, there exists a number ω(r1,...,rk,l) such that for n ≥ ω(r1,...,rk,l) there exists an l-dimensional affine subspace M of Kn (regarded as a vector space over K) satisfying

An application to the field of p-adic numbers

Letting K be the field of p-adic numbers in the theorem, the equation (*) is satisfied, since , b a natural number, is finite. Choosing k = 1, one obtains the following corollary:

A homogeneous equation f(x1,...,xn) = 0 of degree r in the field of p-adic numbers has a non-trivial solution if n is sufficiently large.

One can show that if n is sufficiently large according to the above corollary, then n is greater than r2. Indeed, Emil Artin conjectured [2] that every homogeneous polynomial of degree r over Qp in more than r2 variables represents 0. This is obviously true for r = 1, and it is well known that the conjecture is true for r = 2 (see, for example, J.-P. Serre, A Course in Arithmetic, Chapter IV, Theorem 6). See quasi-algebraic closure for further context.

In 1950 Demyanov [3] verified the conjecture for r = 3 and p  3, and in 1952 D. J. Lewis [4] independently proved the case r = 3 for all primes p. But in 1966 Guy Terjanian constructed a homogeneous polynomial of degree 4 over Q2 in 18 variables that has no non-trivial zero. [5] On the other hand, the Ax–Kochen theorem shows that for any fixed degree Artin's conjecture is true for all but finitely many Qp.

Notes

Related Research Articles

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

<span class="mw-page-title-main">Euclidean algorithm</span> Algorithm for computing greatest common divisors

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

In number theory, given a prime number p, the p-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; p-adic numbers can be written in a form similar to decimals, but with digits based on a prime number p rather than ten, and extending to the left rather than to the right. Formally, given a prime number p, a p-adic number can be defined as a series

Hilbert's tenth problem is the tenth on the list of mathematical problems that the German mathematician David Hilbert posed in 1900. It is the challenge to provide a general algorithm which, for any given Diophantine equation, can decide whether the equation has a solution with all unknowns taking integer values.

<span class="mw-page-title-main">Algebraic number theory</span> Branch of number theory

Algebraic number theory is a branch of number theory that uses the techniques of abstract algebra to study the integers, rational numbers, and their generalizations. Number-theoretic questions are expressed in terms of properties of algebraic objects such as algebraic number fields and their rings of integers, finite fields, and function fields. These properties, such as whether a ring admits unique factorization, the behavior of ideals, and the Galois groups of fields, can resolve questions of primary importance in number theory, like the existence of solutions to Diophantine equations.

In mathematics, the Brauer group of a field K is an abelian group whose elements are Morita equivalence classes of central simple algebras over K, with addition given by the tensor product of algebras. It was defined by the algebraist Richard Brauer.

In mathematics, Dirichlet's unit theorem is a basic result in algebraic number theory due to Peter Gustav Lejeune Dirichlet. It determines the rank of the group of units in the ring OK of algebraic integers of a number field K. The regulator is a positive real number that determines how "dense" the units are.

In mathematics, a Galois module is a G-module, with G being the Galois group of some extension of fields. The term Galois representation is frequently used when the G-module is a vector space over a field or a free module over a ring in representation theory, but can also be used as a synonym for G-module. The study of Galois modules for extensions of local or global fields and their group cohomology is an important tool in number theory.

In mathematics, Helmut Hasse's local–global principle, also known as the Hasse principle, is the idea that one can find an integer solution to an equation by using the Chinese remainder theorem to piece together solutions modulo powers of each different prime number. This is handled by examining the equation in the completions of the rational numbers: the real numbers and the p-adic numbers. A more formal version of the Hasse principle states that certain types of equations have a rational solution if and only if they have a solution in the real numbers and in the p-adic numbers for each prime p.

<span class="mw-page-title-main">Arithmetic geometry</span> Branch of algebraic geometry focused on problems in number theory

In mathematics, arithmetic geometry is roughly the application of techniques from algebraic geometry to problems in number theory. Arithmetic geometry is centered around Diophantine geometry, the study of rational points of algebraic varieties.

In mathematics, a field F is called quasi-algebraically closed (or C1) if every non-constant homogeneous polynomial P over F has a non-trivial zero provided the number of its variables is more than its degree. The idea of quasi-algebraically closed fields was investigated by C. C. Tsen, a student of Emmy Noether, in a 1936 paper (Tsen 1936); and later by Serge Lang in his 1951 Princeton University dissertation and in his 1952 paper (Lang 1952). The idea itself is attributed to Lang's advisor Emil Artin.

In number theory, the Chevalley–Warning theorem implies that certain polynomial equations in sufficiently many variables over a finite field have solutions. It was proved by Ewald Warning (1935) and a slightly weaker form of the theorem, known as Chevalley's theorem, was proved by Chevalley (1935). Chevalley's theorem implied Artin's and Dickson's conjecture that finite fields are quasi-algebraically closed fields.

In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point.

This is a glossary of arithmetic and diophantine geometry in mathematics, areas growing out of the traditional study of Diophantine equations to encompass large parts of number theory and algebraic geometry. Much of the theory is in the form of proposed conjectures, which can be related at various levels of generality.

In mathematics, Birch's theorem, named for Bryan John Birch, is a statement about the representability of zero by odd degree forms.

The Ax–Kochen theorem, named for James Ax and Simon B. Kochen, states that for each positive integer d there is a finite set Yd of prime numbers, such that if p is any prime not in Yd then every homogeneous polynomial of degree d over the p-adic numbers in at least d2 + 1 variables has a nontrivial zero.

Arithmetic dynamics is a field that amalgamates two areas of mathematics, dynamical systems and number theory. Part of the inspiration comes from complex dynamics, the study of the iteration of self-maps of the complex plane or other complex algebraic varieties. Arithmetic dynamics is the study of the number-theoretic properties of integer, rational, p-adic, or algebraic points under repeated application of a polynomial or rational function. A fundamental goal is to describe arithmetic properties in terms of underlying geometric structures.

<span class="mw-page-title-main">Anatoly Karatsuba</span> Russian mathematician

Anatoly Alexeyevich Karatsuba was a Russian mathematician working in the field of analytic number theory, p-adic numbers and Dirichlet series.

In algebra, linear equations and systems of linear equations over a field are widely studied. "Over a field" means that the coefficients of the equations and the solutions that one is looking for belong to a given field, commonly the real or the complex numbers. This article is devoted to the same problems where "field" is replaced by "commutative ring", or, typically "Noetherian integral domain".

In algebraic geometry, the main theorem of elimination theory states that every projective scheme is proper. A version of this theorem predates the existence of scheme theory. It can be stated, proved, and applied in the following more classical setting. Let k be a field, denote by the n-dimensional projective space over k. The main theorem of elimination theory is the statement that for any n and any algebraic variety V defined over k, the projection map sends Zariski-closed subsets to Zariski-closed subsets.

References

  1. R. Brauer, A note on systems of homogeneous algebraic equations, Bulletin of the American Mathematical Society, 51, pages 749-755 (1945)
  2. Collected papers of Emil Artin, page x, Addison–Wesley, Reading, Mass., 1965
  3. Demyanov, V. B. (1950). "На кубических форм дискретных линейных нормированных полей" [On cubic forms over discrete normed fields]. Doklady Akademii Nauk SSSR . 74: 889–891.
  4. D. J. Lewis, Cubic homogeneous polynomials over p-adic number fields, Annals of Mathematics, 56, pages 473–478, (1952)
  5. Guy Terjanian, Un contre-exemple à une conjecture d'Artin, C. R. Acad. Sci. Paris Sér. A–B, 262, A612, (1966)