线性代数和离散数学
代数结构 (Algebraic Structure)
A non-empty set G equipped with one or more binary operations is said to be an algebraic structure. Suppose * is a binary operation on G. Then (G, *) is an algebraic structure. (N,*), (1, +), (1, -) are all the algebraic structure. Here, (R, +, .) is an algebraic structure equipped with two operations.
配备有一个或多个二进制运算的非空集G被称为代数结构 。 假设*是G上的二进制运算。 那么(G,*)是一个代数结构 。 (N,*),(1,+),(1,-)都是代数结构 。 在此, (R,+ ,.)是具有两个运算的代数结构 。
一组二进制运算 (Binary operation on a set)
Suppose G is a non-empty set. The G X G = {(a,b) : a E G, b E G)}. If f : G X G → G then f is called a binary operation on a set G. The image of the ordered pair (a,b) under the function f is denoted by afb.
假设G是一个非空集。 GXG = {(a,b):a EG,b EG)} 。 如果f:GXG→G,则将f称为集合G的二进制运算。 函数f下的有序对(a,b)的图像由afb表示。
A binary operation on asset G is sometimes also said to be the binary composition in the set G. If * is a binary composition in G then, a * b E G, a, b E G. Therefore g is closed with respect to the composition denoted by *.
资产G的二元运算有时也被称为集合G中的二元组合。 如果*是G中的二进制组成,则a * b EG,a,b EG 。 因此, g对于*表示的成分是封闭的。
Example:
例:
An addition is a binary operation on the set N of natural number. The sum of two natural number is also a natural number. Therefore, N is a natural number with respect to addition i.e. a+b.
加法运算是对自然数集N的二进制运算。 两个自然数之和也是自然数。 因此, N是关于加法的自然数,即a + b 。
Subtraction is not a binary operation on N. We have 4 – 7 = 3 not belong to N whereas 4 E N. thus, N is not closed with respect to subtraction, but subtraction is a binary operation on the set of an integer.
减法不是对N的二进制运算。 我们有4 – 7 = 3不属于N而4 EN 。 因此, N在减法上不是闭合的,但是减法是对整数集的二进制运算。
代数结构的性质 (Properties of an algebraic structure)
By a property of an algebraic structure, we mean a property possessed by any of its operations. Important properties of an algebraic system are:
代数结构的属性是指其任何运算所拥有的属性。 代数系统的重要属性是:
1. Associative and commutative laws
1.关联法和交换法
An operation * on a set is said to be associative or to satisfy the associative law if, for any elements a, b , c in S we have (a * b) * c = a * (b * c )
如果对S中的任何元素a,b,c具有(a * b)* c = a *(b * c),则集合上的一个运算*被认为是关联的或满足关联定律的
An operation * on a set S is said to be commutative or satisfy the commutative law if, a * b = b * a for any element a, b in S.
如果对于S中的任何元素a,b , a * b = b * a ,则对集合S的运算*被认为是可交换的或满足可交换律。
2. Identity element and inverse
2.身份元素与逆
Consider an operation * on a set S. An element e in S is called an identity elements for * if for any elements a in S - a * e = e * a = a
考虑对集合S的运算* 。 如果S中的任何元素a- S *中的元素e称为*的标识元素-a * e = e * a = a
Generally, an element e is called a left identity or a right identity according to as e *a or a * e = a where a is any elements in S.
通常,根据e * a或a * e = a ,元素e称为左标识或右标识,其中a是S中的任何元素。
Suppose an operation * on a set S does have an identity element e. The inverse of an element in S is an element b such that: a * b = b * a = e
假设对集合S的操作*确实具有标识元素e 。 S中元素的逆是元素b ,使得: a * b = b * a = e
3. Cancellation laws
3.取消法
An operation * on a set S is a said to satisfy the left cancellation law if, a * b = a * c implies b = c and is said to satisfy the right cancellation law if, b * a = c * a implies b = c
在集合S的操作*为所述满足左取消法如果,A * B =一个* C意味着B = C,被认为满足右分配律,如果,b *的一个= C * A意味着B = C
翻译自: https://www.includehelp.com/basics/algebraic-structure-and-properties-of-structure.aspx
线性代数和离散数学