|
Alternativity
In abstract algebra, alternativity is a property of a binary operation. A magma ''G'' is said to be if (xx)y = x(xy) for all x, y \in G and if y(xx) = (yx)x for all x, y \in G. A magma that is both left and right alternative is said to be ().. Any associative magma (that is, a semigroup) is alternative. More generally, a magma in which every pair of elements generates an associative submagma must be alternative. The converse, however, is not true, in contrast to the situation in alternative algebra In abstract algebra, an alternative algebra is an algebra in which multiplication need not be associative, only alternative. That is, one must have *x(xy) = (xx)y *(yx)x = y(xx) for all ''x'' and ''y'' in the algebra. Every associative algebra is o ...s. In fact, an alternative magma need not even be power-associative. References Properties of binary operations {{algebra-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alternative Algebra
In abstract algebra, an alternative algebra is an algebra in which multiplication need not be associative, only alternative. That is, one must have *x(xy) = (xx)y *(yx)x = y(xx) for all ''x'' and ''y'' in the algebra. Every associative algebra is obviously alternative, but so too are some strictly non-associative algebras such as the octonions. The associator Alternative algebras are so named because they are the algebras for which the associator is alternating. The associator is a trilinear map given by : ,y,z= (xy)z - x(yz). By definition, a multilinear map is alternating if it vanishes whenever two of its arguments are equal. The left and right alternative identities for an algebra are equivalent toSchafer (1995) p. 27 : ,x,y= 0 : ,x,x= 0. Both of these identities together imply that : ,y,x= , x, x+ , y, x- , x+y, x+y= , x+y, -y= , x, -y- , y, y= 0 for all x and y. This is equivalent to the '' flexible identity''Schafer (1995) p. 28 :(xy)x = x(yx). The associator of an alte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Associativity
In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement for expressions in logical proofs. Within an expression containing two or more occurrences in a row of the same associative operator, the order in which the operations are performed does not matter as long as the sequence of the operands is not changed. That is (after rewriting the expression with parentheses and in infix notation if necessary), rearranging the parentheses in such an expression will not change its value. Consider the following equations: \begin (2 + 3) + 4 &= 2 + (3 + 4) = 9 \,\\ 2 \times (3 \times 4) &= (2 \times 3) \times 4 = 24 . \end Even though the parentheses were rearranged on each line, the values of the expressions were not altered. Since this holds true when performing addition and multiplication on any rea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include group (mathematics), groups, ring (mathematics), rings, field (mathematics), fields, module (mathematics), modules, vector spaces, lattice (order), lattices, and algebra over a field, algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variable (mathematics), variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form category (mathematics), mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For exampl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Binary Operation
In mathematics, a binary operation or dyadic operation is a rule for combining two elements (called operands) to produce another element. More formally, a binary operation is an operation of arity two. More specifically, an internal binary operation ''on a set'' is a binary operation whose two domains and the codomain are the same set. Examples include the familiar arithmetic operations of addition, subtraction, and multiplication. Other examples are readily found in different areas of mathematics, such as vector addition, matrix multiplication, and conjugation in groups. An operation of arity two that involves several sets is sometimes also called a ''binary operation''. For example, scalar multiplication of vector spaces takes a scalar and a vector to produce a vector, and scalar product takes two vectors to produce a scalar. Such binary operations may be called simply binary functions. Binary operations are the keystone of most algebraic structures that are studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Magma (algebra)
In abstract algebra, a magma, binar, or, rarely, groupoid is a basic kind of algebraic structure. Specifically, a magma consists of a set equipped with a single binary operation that must be closed by definition. No other properties are imposed. History and terminology The term ''groupoid'' was introduced in 1927 by Heinrich Brandt describing his Brandt groupoid (translated from the German ). The term was then appropriated by B. A. Hausmann and Øystein Ore (1937) in the sense (of a set with a binary operation) used in this article. In a couple of reviews of subsequent papers in Zentralblatt, Brandt strongly disagreed with this overloading of terminology. The Brandt groupoid is a groupoid in the sense used in category theory, but not in the sense used by Hausmann and Ore. Nevertheless, influential books in semigroup theory, including Clifford and Preston (1961) and Howie (1995) use groupoid in the sense of Hausmann and Ore. Hollings (2014) writes that the term ''groupoid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semigroup
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', denotes the result of applying the semigroup operation to the ordered pair . Associativity is formally expressed as that for all ''x'', ''y'' and ''z'' in the semigroup. Semigroups may be considered a special case of magmas, where the operation is associative, or as a generalization of groups, without requiring the existence of an identity element or inverses. The closure axiom is implied by the definition of a binary operation on a set. Some authors thus omit it and specify three axioms for a group and only one axiom (associativity) for a semigroup. As in the case of groups or magmas, the semigroup operation need not be commutative, so ''x''·''y'' is not necessarily equal to ''y''·''x''; a well-known example of an operation that is as ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Converse (logic)
In logic and mathematics, the converse of a categorical or implicational statement is the result of reversing its two constituent statements. For the implication ''P'' → ''Q'', the converse is ''Q'' → ''P''. For the categorical proposition ''All S are P'', the converse is ''All P are S''. Either way, the truth of the converse is generally independent from that of the original statement.Robert Audi, ed. (1999), ''The Cambridge Dictionary of Philosophy'', 2nd ed., Cambridge University Press: "converse". Implicational converse Let ''S'' be a statement of the form ''P implies Q'' (''P'' → ''Q''). Then the converse of ''S'' is the statement ''Q implies P'' (''Q'' → ''P''). In general, the truth of ''S'' says nothing about the truth of its converse, unless the antecedent ''P'' and the consequent ''Q'' are logically equivalent. For example, consider the true statement "If I am a human, then I am mortal." The converse of that statement is "If I am mortal, then I am ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Power-associative
In mathematics, specifically in abstract algebra, power associativity is a property of a binary operation that is a weak form of associativity. Definition An algebra (or more generally a magma) is said to be power-associative if the subalgebra generated by any element is associative. Concretely, this means that if an element x is performed an operation * by itself several times, it doesn't matter in which order the operations are carried out, so for instance x*(x*(x*x)) = (x*(x*x))*x = (x*x)*(x*x). Examples and properties Every associative algebra is power-associative, but so are all other alternative algebras (like the octonions, which are non-associative) and even some non-alternative algebras like the sedenions and Okubo algebras. Any algebra whose elements are idempotent is also power-associative. Exponentiation to the power of any positive integer can be defined consistently whenever multiplication is power-associative. For example, there is no need to distinguish whethe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
