Additive polynomial

From Wikipedia, the free encyclopedia

Template:Short description

Page Module:Message box/ambox.css has no content.

In mathematics, the additive polynomials are an important topic in classical algebraic number theory.

Definition

Let k be a field of prime characteristic k. A polynomial P(x) with coefficients in k is called an additive polynomial, or a Frobenius polynomial, if

P(a+b)=P(a)+P(b)

as polynomials in a and b. It is equivalent to assume that this equality holds for all a and b in some infinite field containing k, such as its algebraic closure.

Occasionally absolutely additive is used for the condition above, and additive is used for the weaker condition that P(a+b)=P(a)+P(b) for all a and b in the field.[1] For infinite fields the conditions are equivalent,Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. but for finite fields they are not, and the weaker condition is the "wrong" as it does not behave well. For example, over a field of order q any multiple P of xqx will satisfy P(a+b)=P(a)+P(b) for all a and b in the field, but will usually not be (absolutely) additive.

Examples

The polynomial xp is additive.[1] Indeed, for any a and b in the algebraic closure of k one has by the binomial theorem

(a+b)p=n=0p(pn)anbpn.

Since p is prime, for all n=1,,p1 the binomial coefficient (pn) is divisible by p, which implies that

(a+b)pap+bpmodp

as polynomials in a and b.[1]

Similarly all the polynomials of the form

τpn(x)=xpn

are additive, where n is a non-negative integer.[1]

The definition makes sense even if k is a field of characteristic zero, but in this case the only additive polynomials are those of the form ax for some a in k.[citation needed]

The ring of additive polynomials

It is quite easy to prove that any linear combination of polynomials τpn(x) with coefficients in k is also an additive polynomial.[1] An interesting question is whether there are other additive polynomials except these linear combinations. The answer is that these are the only ones.[2]

One can check that if P(x) and M(x) are additive polynomials, then so are P(x)+M(x) and P(M(x)). These imply that the additive polynomials form a ring under polynomial addition and composition. This ring is denoted[3]

k{τp}.

This ring is not commutative unless k is the field 𝔽p=/p (see modular arithmetic).[1] Indeed, consider the additive polynomials ax and xp for a coefficient a in k. For them to commute under composition, we must have

(ax)p=axp,

and hence apa=0. This is false for a not a root of this equation, that is, for a outside 𝔽p.[1]

The fundamental theorem of additive polynomials

Let P(x) be a polynomial with coefficients in k, and {w1,,wm}k be the set of its roots. Assuming that the roots of P(x) are distinct (that is, P(x) is separable), then P(x) is additive if and only if the set {w1,,wm} forms a group with the field addition.Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.

See also

References

Page Template:Reflist/styles.css has no content.

  1. ^ a b c d e f g Page Module:Citation/CS1/styles.css has no content.Goss, David (1996), Basic Structures of Function Field Arithmetic, Berlin: Springer, p. 1, doi:10.1007/978-3-642-61480-4, ISBN 3-540-61087-1
  2. ^ Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found.
  3. ^ Equivalently, Lua error in package.lua at line 80: module 'Module:Footnotes/anchor_id_list' not found. defines k{τp} to be the ring generated by τpn(x) and then proves (p. 3) that it consists of all additive polynomials.
  • Script error: No such module "Template wrapper".