离散结构和离散数学中文书_戒指和戒指类型| 离散数学

离散结构和离散数学中文书

(Ring)

The algebraic structure (R, +, .) which consisting of a non-empty set R along with two binary operations like addition(+) and multiplication(.) then it is called a ring.

由非空集R以及两个二进制运算(如加法(+)和乘法(。))组成的代数结构(R,+,。)称为环。

An algebraic ( or mathematically) system (R, *, o) consisting of a non-empty set R any two binary operations * and o defined on R such that:

代数(或数学上的)系统(R,*,o),由一个非空集R以及在R上定义的任意两个二进制运算*和o组成,这样:

  1. (R, *) is an abelian group and (R, 0) is a semigroup.

    (R,*)是一个阿贝尔群,(R,0)是一个半群。

  2. The operation o is the distributive over the operation * is said to be the ring.

    操作o是操作*的分布*称为环。

There are following postulates are satisfied:

满足以下假设:

R1 (R1)

The system (R, +) is an abelian group. So we have the following properties:

系统(R,+)是一个阿贝尔群。 因此,我们具有以下属性:

1. Closure property

1.关闭属性

The set R is called with respect to the composition +.

关于组成+调用集合R。

i.e. aER, bER => a+b E R for all a, b E R

即aER,bER => a + b ER对于所有a,b ER

2. Associativity

2.关联性

Associative law hld good in the set R for the composition +.

联想定律hld好的集合R为构图+。

i.e. (a+b) + c = a + (b+c) for all a, b, c E R.

即(a + b)+ c = a +(b + c)对于所有a,b,c E R。

3. Existence of identity

3.身份的存在

There exist an unique 0 E R called zero element such that, a + b = a = 0 + a, a E R

存在一个称为零元素的唯一0 ER,因此, a + b = a = 0 + a,一个ER

4. Existence of inverse

4.逆的存在

For each a E R there exists an elements a E R such that, a + (-a) = 0 = (-a) + a

对于每个ER,都有一个元素ER,使得a +(-a)= 0 =(-a)+ a

5. Commutative of addition

5.加法的可交换

Commutative law holds good in the set R for the composition +.

交换律在成分R的集合R中保持良好。

i.e. a + b = b + a for all a, b E R

即,对于所有a,b ER,a + b = b + a

R2 (R2)

The set R is closed with respect to the multiplication composition.

集合R关于乘法合成是封闭的。

R3 (R3)

Multiplication composition is associative i.e. (a.b).c = a.(b.c) for all a, b, c E R

乘法组合是关联的,即(a),b,c的所有(a).c = a。(bc)

R4 (R4)

The multiplication composition is right and left distributive with respect to addition.

乘法组成在加法方面是左右分布。

i.e. a.(b + c) = a.b + a.c for every a, b, c E R (left distributive law)

iea(b + c)= ab + ac每a,b,c ER(左分配律)

(b + c). a = b.a + c.a (right distributive law)

(b + c)。 a = ba + ca(正确的分配定律)

戒指类型 (Types of Rings)

1. Null Ring

1.空环

The singleton (0) with binary operation + and defined by 0 + 0 = 0 and 0.0 = 0 is a ring called the zero ring or null ring.

具有二进制运算+且由0 + 0 = 0和0.0 = 0定义的单例(0)是一个称为零环或空环的环。

2. Commutative Ring

2.换向环

If the multiplication in a ring is also commutative then the ring is known as commutative ring i.e. the ring (R, +, .) is a commutative ring provided.

如果环中的乘法也是可交换的,则该环称为可交换环,即环(R,+,。)是提供的可交换环。

a.b = b.a for all a, b E R

对于所有a,b ER,ab = ba

If the multiplication is not commutative it is called non- commutative ring.

如果乘法不是可交换的,则称为非可交换环。

3. Ring with unity

3.团结一致

If e be an element of a ring R such that e.a = a.e = a for all E R then the ring is called ring with unity and the elements e is said to be units elements or unity or identity of R.

如果e是所有R的环R的元素,使得ea = ae = a,则该环称为具有单一性的环,并且元素e被称为是R的单位或元素或同一性。

4. Ring with zero divisor

4.除数为零的环

A ring (R, +, .) is a said to have divisor of zero (or zero divisor), if there exist two non-zero elements a, b E R such that a.b = 0 or b.a = 0 where 0 is the additive identity in R . here a and b are called the proper divisor of zero.

如果存在两个非零元素a,b ER使得ab = 0或ba = 0,则环(R,+,。)被称为具有零的除数(或零除数),其中0是加法恒等式在R中。 这里a和b称为零的适当除数。

5. Ring without zero divisor

5.无零除环

A ring R is said to be without zero divisor. If the product of no two non zero elements of R is zero i.e. if ab = 0 => a = 0 or b = 0.

环R被认为没有零除数。 如果R中没有两个非零元素的乘积为零,即ab = 0 => a = 0或b = 0。

环的性质 (Properties of Ring)

If R is a ring then for all a, b, c E R

如果R是一个环,则对于所有a,b,c ER

  1. a0 = 0a = 0

    a0 = 0a = 0

  2. a(-b) = -(ab) = (-a)b

    a(-b)=-(ab)=(-a)b

  3. (-a)(-b) = ab

    (-a)(-b)= ab

  4. a(b-c) = ab – ac

    a(bc)= ab – ac

  5. (b-c)a = ba- ca

    (bc)a = ba- ca

翻译自: https://www.includehelp.com/basics/rings-and-types-of-rings-discrete-mathematics.aspx

离散结构和离散数学中文书

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值