Polynomial u-ring
From Maths
Stub grade: A
This page is a stub
This page is a stub, so it contains little or minimal information and is on a to-do list for being expanded.The message provided is:
Not my strong suit but I've done the proofs for this
Contents
[hide]Definition
Let R be a u-ring with the standard operations of + and ∗. The set (or further-more: u-ring) of polynomials over R (in the indeterminate X), denoted universally as R[X], is defined as follows[1]:
- Let M:={e,X,X2,X3,…,Xn,…} be the free monoid generated by {X}.
- A polynomial, P∈R[X], over R is a mapping: P:M→R by P:Xn→an such that |{an∈P(M) | an≠0}|∈N[Note 1]
- The set of such polynomials is R[X] - the set of all polynomials over R
Conventions
- It is normal to identify r∈R with the constant polynomial[1]: an:={0if n>0rotherwise, which we can write more simply as r
- Later we shall write this as r+0X+0X2+⋯0Xn+⋯ or more simply: r (hence the "naturalness" of the identification)
- It is also normal to identify X with the polynomial an:={0if n≠11otherwise
- Later we shall write this as 0+1X+0X2+⋯+0Xn+⋯ or simply X (hence the "naturalness" of the identification)
Notations
Claim 1: we may write P∈R[X] as:
- A summation: ∑n∈NanXn or more commonly: ∑∞n=0anXn; or
- P:=a0+a1X+a2X2+⋯+anXn for some n∈N.
- Such an n is actually called the degree of the polynomial Caveat:and can be defined only by convention if P is the zero polynomial
U-ring operations
Claim 2: R[X] is a u-ring itself. The operations are:
- P+Q
- PQ
Grade: B
This page requires some work to be carried out
Some aspect of this page is incomplete and work is required to finish it
The message provided is:
Warning:That grade doesn't exist!
The message provided is:
The terms are:
- (P+Q)n=(P)n+(Q)n and
- (PQ)n=∑i+j=n(P)i(Q)j - meaning the sum over terms whose indices add to n
Warning:That grade doesn't exist!
Identity (of the abelian additive group) and unity of the ring:
- The zero polynomial: 0+0X+0X2+⋯+0Xn+⋯ which by the notation section we can simply write as: 0
- The unity of the ring is the polynomial 1, (the thing we identify the unity of R to).
- More explicitly, the polynomial: 1+0X+0X2+⋯+0Xn+⋯
Proof of claims
Grade: D
This page requires one or more proofs to be filled in, it is on a to-do list for being expanded with them.
Please note that this does not mean the content is unreliable. Unless there are any caveats mentioned below the statement comes from a reliable source. As always, Warnings and limitations will be clearly shown and possibly highlighted if very important (see template:Caution et al).
The message provided is:
The message provided is:
See also
Notes
- Jump up ↑ This may be said as:
- an=0 for almost all n∈N0 (as per one of the references - Abstract Algebra: Grillet),
- an=0 almost always, or
- |{an∈P(M) | an=0}|=ℵ0
- But this requires a few things: the cardinality of the free monoid generated by a single object is countable and finitely many elements removed from a countable set remains countable