Commutative Algebra Ongoing BC Flashcards

1
Q

defn. commutative ring?

A

A set R equipped with two operations + & x such that they satisfy the eight axioms.

  • addition is associative.
  • addition is commutative.
  • a∈R ⇒ -a∈R.
  • 0∈R ⇒ a+0 = a.
  • 1∈R ⇒ a x 1 = a.
  • multiplication is associative.
  • a(b + c) = ab +ac. distributive
  • multiplication is commutative.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

axioms?

A

(R,+) is an abelian group
a(b+c) ⇒ ab+bc
ab=ba

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

defn. Inverse

A

R is a commutative ring and x∈R, an element x¯¹∈R is an inverse of x if xx¯¹ =1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

properties of inverses

A

they are unique,

inverse of 0 doesn’t exist

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Defn. unit

A

x∈R is a unit if it is an invertible element of R.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Defn. Abelian Group

A

a commutative group

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Defn. U(R)?

A

U(R)= {x∈R | x is a unit}

group of invertible elements

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Defn. Field ?

A

a field is a commutative ring K such that U(K) =K{0}

ie, a field is a ring where all non-zero elements are invertible

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Defn. Domain ?

A

a domain is R such that a,b∈R, ab=0 ⇒ a=0 or b=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

relationship between feild and domain ?

A

a field is always a domain.

ie a group of invertible elements excluding zero is always a domain

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

defn. Monomials

A

monomials in n variables are in one-to-one correspondence with the set ℕ^n.
ℕ^n = {α = (k_1,… , k_n) | k_1,… ,k_n ∈ℕ} the set of all n-tuples of natural numbers.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

multiindex

A

an element (α) of a set ℕ^n

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

M(X_1,…,X_n)

A

the set of all monomials in n variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

addition and multiplication of monomials

A

addition is not defined

multiplication is defined as X³X² = X(³+²)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

total degree of a monomial

A

= the sum of the powers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

defn. Poset (partially ordered set)

A

(S,≼) is a partially ordered set if S is a set and ≼ is a binary relation on S which is

  • reflexsive, x∈S ⇒ x≼x
  • antisymmetric: x≼y, y≼x ⇒ x=y
  • transitive: x≼y, y≼z ⇒ x≼z
17
Q

Lecture 3

A

Lecture 3

18
Q

Dicksons Lemma

A

S is a sub set of M(X_1,…,X_n): then # Smin

19
Q

The partial order | on M(X_1,…,X_n)

A

take a picture

20
Q

Dickson’s Lemma

A

Let S be a subset of (M(X_1, . . . ,X_n), |). Then.

  1. S_min is finite.
  2. Every element of S is divisible by at least one element of S_min.
21
Q

Minimal element

A

A minimal element of a partially ordered set (S,≼) is x∈S such that there is no y∈S with y ≺ x.
Denote by S_min the set of minimal elements of S.

22
Q

Dickson’s Lemma

A

Let S be a subset of (M(X_1, . . . ,X_n), |). Then:

  1. S_min is finite.
  2. Every element of S is divisible by at least one element of S_min.
23
Q

Monomial orderings

A

A monomial ordering is a partial order ≼ on M = M(X_1,…,X_n) which satisfies:

  • ≼ is a total order. (i.e m,m’∈M ⇒ m≼m’ or m≻m’;
  • m∈M ⇒ 1≼m
  • If m’≼m then, for every m_1 ∈M, m_1m’ ≼ m1m.
24
Q

Lex Ordering

A

Variables are ordered first X_1 ≻ X_2≻…X_n

X^a ≻ X^b if a - b > 0.

25
Q

DegLex Ordering

A

Variables are ordered first X_1 ≻ X_2≻…X_n
totaldeg(X^a) > totaldeg(X^b)
then use Lex if the total degrees are equal.