Brauer's theorem on forms

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]

There also is Brauer's theorem on induced characters.

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
  • Davenport, Harold (2005). Analytic methods for Diophantine equations and Diophantine inequalities. Cambridge Mathematical Library. Edited and prepared by T. D. Browning. With a preface by R. C. Vaughan, D. R. Heath-Brown and D. E. Freeman (2nd ed.). Cambridge University Press. ISBN 0-521-60583-0. Zbl 1125.11018.
gollark: More great "WHY WOULD YOU DO THIS":```go// A Context carries a deadline, cancelation signal, and request-scoped values// across API boundaries. Its methods are safe for simultaneous use by multiple// goroutines.type Context interface { // Done returns a channel that is closed when this Context is canceled // or times out. Done() <-chan struct{} // Err indicates why this context was canceled, after the Done channel // is closed. Err() error // Deadline returns the time when this Context will be canceled, if any. Deadline() (deadline time.Time, ok bool) // Value returns the value associated with key or nil if none. Value(key interface{}) interface{}}```
gollark: Basically, modems/rednet but more flexible, cross-server, and without actual modems.
gollark: It's a websocket-based inter-computer cross-server message relay.
gollark: ```rust#[derive(Serialize, Deserialize, Debug, PartialEq, Eq, Hash, Clone)]#[serde(untagged)]pub enum Channel { Numeric(i64), Named(String)}#[derive(Serialize, Deserialize, Debug, Clone, Message)]pub struct RawMsg { pub channel: Channel, #[serde(flatten)] pub meta: HashMap<String, Value>, pub message: Value}#[derive(Serialize, Deserialize, Debug, Clone, Message)]pub struct Msg { pub channel: Channel, #[serde(flatten)] pub meta: HashMap<String, Value>, pub message: Value, pub timestamp: chrono::DateTime<chrono::Utc>}#[derive(Serialize, Deserialize, Debug)]#[serde(tag = "type")]enum MessageFromClient { #[serde(rename = "open")] Open { channel: skynet::Channel }, #[serde(rename = "close")] Close { channel: skynet::Channel }, #[serde(rename = "message")] Message(skynet::RawMsg)}#[derive(Serialize)]#[serde(tag = "type")]enum MessageToClient<'a> { #[serde(rename = "message")] Message(skynet::Msg), #[serde(rename = "channels")] OpenChannels { channels: &'a HashSet<skynet::Channel> }}```WIP Rust notreallyconversion of the Skynet protocol.
gollark: ```goconst( zero = iota; /* iota starts as zero */ one = iota; /* ...and is incremented every semicolon */ two; /* the last expression is repeated if you omit it */ three;)```

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)
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.