Professional Documents
Culture Documents
Rings of Fractions
Rings of Fractions
Definition
Let (R, +, ·) be a commutative unital ring. A subset S ⊆ R is called
multiplicative system if S is a submonoid of the multiplicative monoid
(R, ·).
Definition
Let (R, +, ·) be a commutative unital ring. A subset S ⊆ R is called
multiplicative system if S is a submonoid of the multiplicative monoid
(R, ·).
Remark
In order that a subset S ⊆ R represents a multiplicative system of the
ring R it is necessary and sufficient that the following conditions hold:
1) 1 ∈ S
2) x · y ∈ S , (∀)x, y ∈ S .
Definition
Let (R, +, ·) be a commutative unital ring. A subset S ⊆ R is called
multiplicative system if S is a submonoid of the multiplicative monoid
(R, ·).
Remark
In order that a subset S ⊆ R represents a multiplicative system of the
ring R it is necessary and sufficient that the following conditions hold:
1) 1 ∈ S
2) x · y ∈ S , (∀)x, y ∈ S .
is an equivalence relation.
Remark
If 0 ∈ S, then S −1 R = { 0s }.
Remark
If 0 ∈ S, then S −1 R = { 0s }.
are correctly defined and endorse S −1 R with a unital ring structure, such
that S ⊆ U(S −1 R).
Definition
The ring (S −1 R, +, ·) constructed in the previous proposition is called
the ring of fractions of the ring R with respect to the multiplicative
system S.
are correctly defined and endorse S −1 R with a unital ring structure, such
that S ⊆ U(S −1 R).
Definition
The ring (S −1 R, +, ·) constructed in the previous proposition is called
the ring of fractions of the ring R with respect to the multiplicative
system S.
Remark
If the ring (R, +, ·) is entire, and S = R \ {0}, the ring of fractions
S −1 R is a field, called the field of fractions of the ring R.
Remark
If the ring (R, +, ·) is entire, and S = R \ {0}, the ring of fractions
S −1 R is a field, called the field of fractions of the ring R.
Example
The field Q of rational numbers is the field of fractions of the ring Z of
the integers.
Remark
If the ring (R, +, ·) is entire, and S = R \ {0}, the ring of fractions
S −1 R is a field, called the field of fractions of the ring R.
Example
The field Q of rational numbers is the field of fractions of the ring Z of
the integers.
Definition
Let (R, +, ·) be a commutative unital ring, and R N the set of all
sequences with elements in R. We define on R N two binary operations
+ : R N × R N −→ R N and · : R N × R N −→ R N by
Definition
Let (R, +, ·) be a commutative unital ring, and R N the set of all
sequences with elements in R. We define on R N two binary operations
+ : R N × R N −→ R N and · : R N × R N −→ R N by
ϕ : R −→ R N : r 7−→ (r , 0, 0, . . . , 0, . . . )
Remark
1, n = k
If X = (0, 1, 0, 0, . . . , 0, . . . ), then (X n )k = δnk = .
6 k
0, n =
ϕ : R −→ R N : r 7−→ (r , 0, 0, . . . , 0, . . . )
Remark
1, n = k
If X = (0, 1, 0, 0, . . . , 0, . . . ), then (X n )k = δnk = .
0, n 6= k
Also, if we identify the elements of the ring R with their images by the
injective homomorphism ϕ, for any (an )n∈N ∈ R N we have
X
(an )n∈N = a0 + a1 · X + a2 · X 2 + · · · + an · X n + · · · = an X n .
n∈N
ϕ : R −→ R N : r 7−→ (r , 0, 0, . . . , 0, . . . )
Remark
1, n = k
If X = (0, 1, 0, 0, . . . , 0, . . . ), then (X n )k = δnk = .
0, n 6= k
Also, if we identify the elements of the ring R with their images by the
injective homomorphism ϕ, for any (an )n∈N ∈ R N we have
X
(an )n∈N = a0 + a1 · X + a2 · X 2 + · · · + an · X n + · · · = an X n .
n∈N
supp(f ) := {n ∈ N| an 6= 0} .
Proposition
If f , g ∈ R[[X ]], we have
supp(f ) := {n ∈ N| an 6= 0} .
Proposition
If f , g ∈ R[[X ]], we have
Remark
n
P
If f = n∈N an X ∈ R[[X ]], then
∞, f = 0,
h(f ) =
min{n ∈ N| an 6= 0}, f =
6 0.
Remark
n
P
If f = n∈N an X ∈ R[[X ]], then
∞, f = 0,
h(f ) =
min{n ∈ N| an 6= 0}, f =
6 0.
If also the ring R is entire, then the second inequality from above becomes
an equality, and the ring R[[X ]] is also entire.
Notation
R[X ] := {f ∈ R[[X ]]| |supp(f )| < ∞} .
Notation
R[X ] := {f ∈ R[[X ]]| |supp(f )| < ∞} .
Proposition
R[X ] ≤ R[[X ]] .
Notation
R[X ] := {f ∈ R[[X ]]| |supp(f )| < ∞} .
Proposition
R[X ] ≤ R[[X ]] .
∂(f ) := sup(supp(f )) .
Remark
P0 n
If f = n∈N an X ∈ R[X ], then
−∞, f = 0,
∂(f ) =
max{n ∈ N| an 6= 0}, f =
6 0.
∂(f ) := sup(supp(f )) .
Remark
P0 n
If f = n∈N an X ∈ R[X ], then
−∞, f = 0,
∂(f ) =
max{n ∈ N| an 6= 0}, f =
6 0.
If also the ring R is entire, then the second inequality from above becomes
an equality, and the ring R[X ] is also entire.
f (s) = 0 ,
Definition
If (R, +, ·) is a commutative unital ring, and n ∈ N∗ is a nonnegative
integer with n ≥ 2, the ring of polynomials in n variables, denoted
R[X1 , X2 , . . . , Xn ], is defined recursively by:
Definition
If (R, +, ·) is a commutative unital ring, and n ∈ N∗ is a nonnegative
integer with n ≥ 2, the ring of polynomials in n variables, denoted
R[X1 , X2 , . . . , Xn ], is defined recursively by:
Remark
P0 ν1 ν2
If f ∈ R[X1 , X2 , . . . , Xn ], then f = ν1 ,ν2 ,...,νn ∈N aν1 ,ν2 ,...,νn X1 X2 . . . Xnνn .
Definition
If (R, +, ·) is a commutative unital ring, and n ∈ N∗ is a nonnegative
integer with n ≥ 2, the ring of polynomials in n variables, denoted
R[X1 , X2 , . . . , Xn ], is defined recursively by:
Remark
P0 ν1 ν2
If f ∈ R[X1 , X2 , . . . , Xn ], then f = ν1 ,ν2 ,...,νn ∈N aν1 ,ν2 ,...,νn X1 X2 . . . Xnνn .
Definition
Let mP∈ N be a nonnegative integer. A polynomial
f = 0ν1 ,ν2 ,...,νn ∈N aν1 ,ν2 ,...,νn X1ν1 X2ν2 . . . Xnνn such that the total degrees of
all its terms are equal to m, is called homogeneous polynomial of degree
m.
Definition
Let mP∈ N be a nonnegative integer. A polynomial
f = 0ν1 ,ν2 ,...,νn ∈N aν1 ,ν2 ,...,νn X1ν1 X2ν2 . . . Xnνn such that the total degrees of
all its terms are equal to m, is called homogeneous polynomial of degree
m.
Remark
Any polynomial in n variables can be decomposed into a sum of
homogeneous polynomials.
Definition
Let mP∈ N be a nonnegative integer. A polynomial
f = 0ν1 ,ν2 ,...,νn ∈N aν1 ,ν2 ,...,νn X1ν1 X2ν2 . . . Xnνn such that the total degrees of
all its terms are equal to m, is called homogeneous polynomial of degree
m.
Remark
Any polynomial in n variables can be decomposed into a sum of
homogeneous polynomials.
Definition
A polynomial f ∈ R[X1 , X2 , . . . , Xn ] such that f = f σ, (∀)σ ∈ Sn is
called symmetric polynomial.
Definition
A polynomial f ∈ R[X1 , X2 , . . . , Xn ] such that f = f σ, (∀)σ ∈ Sn is
called symmetric polynomial.
s1 = X1 + X2 + · · · + Xn
s2 = X1 X2 + X1 X3 + · · · + Xn−1 Xn
..
. P
sk = 1≤i1 <i2 <···<ik ≤n Xi1 Xi2 . . . Xik
..
.
sn = X1 X2 . . . Xn
Proposition
The set Rs [X1 , X2 , . . . , Xn ] of all symmetric polynomials in the variables
X1 , X2 , . . . , Xn forms a subring of the ring R[X1 , X2 , . . . , Xn ] of all
polynomials in n variables.
Lect.dr. M.Chiş () Lecture 7 2009 22 / 23
Example
The polynomials s1 , s2 , . . . , sn ∈ R[X1 , X2 , . . . , Xn ] defined by
s1 = X1 + X2 + · · · + Xn
s2 = X1 X2 + X1 X3 + · · · + Xn−1 Xn
..
. P
sk = 1≤i1 <i2 <···<ik ≤n Xi1 Xi2 . . . Xik
..
.
sn = X1 X2 . . . Xn
Proposition
The set Rs [X1 , X2 , . . . , Xn ] of all symmetric polynomials in the variables
X1 , X2 , . . . , Xn forms a subring of the ring R[X1 , X2 , . . . , Xn ] of all
polynomials in n variables.
Lect.dr. M.Chiş () Lecture 7 2009 22 / 23
Proposition
the fundamental theorem of symmetric polynomials
For any symmetric polynomial f ∈ Rs [X1 , X2 , . . . , Xn ] there is a polynomial
g ∈ R[Y1 , Y2 , . . . , Yn ], such that
f = g (s1 , s2 , . . . , sn ) .