Polynomial u-ring

From Maths
Jump to: navigation, search
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

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, PR[X], over R is a mapping: P:MR by P:Xnan such that |{anP(M) | an0}|N[Note 1]
  • The set of such polynomials is R[X] - the set of all polynomials over R

Conventions

  • It is normal to identify rR 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 n11otherwise
    • 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 PR[X] as:

  1. A summation: nNanXn or more commonly: n=0anXn; or
  2. P:=a0+a1X+a2X2++anXn for some nN.
    • 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:

  1. P+Q
  2. 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:
The terms are:
  1. (P+Q)n=(P)n+(Q)n and
  2. (PQ)n=i+j=n(P)i(Q)j - meaning the sum over terms whose indices add to n
Don't forget to flesh out the identity and unity!

Warning:That grade doesn't exist!

Identity (of the abelian additive group) and unity of the ring:

  1. The zero polynomial: 0+0X+0X2++0Xn+ which by the notation section we can simply write as: 0
  2. 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:
Done on paper:

See also

Notes

  1. Jump up This may be said as:
    1. an=0 for almost all nN0 (as per one of the references - Abstract Algebra: Grillet),
    2. an=0 almost always, or
    3. |{anP(M) | an=0}|=0
    I have written: |{anP(M) | an0}|N - which is quite literally "there are finitely many elements that are the additive identity of R"

References

  1. Jump up to: 1.0 1.1 Abstract Algebra - Pierre Antoine Grillet