|
Boolean Rings
In mathematics, a Boolean ring ''R'' is a ring for which ''x''2 = ''x'' for all ''x'' in ''R'', that is, a ring that consists only of idempotent elements. An example is the ring of integers modulo 2. Every Boolean ring gives rise to a Boolean algebra, with ring multiplication corresponding to conjunction or meet ∧, and ring addition to exclusive disjunction or symmetric difference (not disjunction ∨, which would constitute a semiring). Conversely, every Boolean algebra gives rise to a Boolean ring. Boolean rings are named after the founder of Boolean algebra, George Boole. Notations There are at least four different and incompatible systems of notation for Boolean rings and algebras: *In commutative algebra the standard notation is to use ''x'' + ''y'' = (''x'' ∧ ¬ ''y'') ∨ (¬ ''x'' ∧ ''y'') for the ring sum of ''x'' and ''y'', and use ''xy'' = ''x'' ∧ ''y'' for their product. *In logic, a common notation i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Associative Algebra
In mathematics, an associative algebra ''A'' is an algebraic structure with compatible operations of addition, multiplication (assumed to be associative), and a scalar multiplication by elements in some field ''K''. The addition and multiplication operations together give ''A'' the structure of a ring; the addition and scalar multiplication operations together give ''A'' the structure of a vector space over ''K''. In this article we will also use the term ''K''-algebra to mean an associative algebra over the field ''K''. A standard first example of a ''K''-algebra is a ring of square matrices over a field ''K'', with the usual matrix multiplication. A commutative algebra is an associative algebra that has a commutative multiplication, or, equivalently, an associative algebra that is also a commutative ring. In this article associative algebras are assumed to have a multiplicative identity, denoted 1; they are sometimes called unital associative algebras for clarification. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like or , the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, ); such operations are ''not'' commutative, and so are referred to as ''noncommutative operations''. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quotient Ring
In ring theory, a branch of abstract algebra, a quotient ring, also known as factor ring, difference ring or residue class ring, is a construction quite similar to the quotient group in group theory and to the quotient space in linear algebra. It is a specific example of a quotient, as viewed from the general setting of universal algebra. Starting with a ring and a two-sided ideal in , a new ring, the quotient ring , is constructed, whose elements are the cosets of in subject to special and operations. (Only the fraction slash "/" is used in quotient ring notation, not a horizontal fraction bar.) Quotient rings are distinct from the so-called "quotient field", or field of fractions, of an integral domain as well as from the more general "rings of quotients" obtained by localization. Formal quotient ring construction Given a ring and a two-sided ideal in , we may define an equivalence relation on as follows: : if and only if is in . Using the ideal properties, it is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Order Ideal
In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and lattice theory. Basic definitions A subset of a partially ordered set (P, \leq) is an ideal, if the following conditions hold: # is non-empty, # for every ''x'' in and ''y'' in ''P'', implies that ''y'' is in ( is a lower set), # for every ''x'', ''y'' in , there is some element ''z'' in , such that and ( is a directed set). While this is the most general way to define an ideal for arbitrary posets, it was originally defined for lattices only. In this case, the following equivalent definition can be given: a subset of a lattice (P, \leq) is an ideal if and only if it is a lower set that is closed under finite joins ( suprema); that is, it is none ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Ideal
In ring theory, a branch of abstract algebra, an ideal of a ring is a special subset of its elements. Ideals generalize certain subsets of the integers, such as the even numbers or the multiples of 3. Addition and subtraction of even numbers preserves evenness, and multiplying an even number by any integer (even or odd) results in an even number; these closure and absorption properties are the defining properties of an ideal. An ideal can be used to construct a quotient ring in a way similar to how, in group theory, a normal subgroup can be used to construct a quotient group. Among the integers, the ideals correspond one-for-one with the non-negative integers: in this ring, every ideal is a principal ideal consisting of the multiples of a single non-negative number. However, in other rings, the ideals may not correspond directly to the ring elements, and certain properties of integers, when generalized to rings, attach more naturally to the ideals than to the elements of the ri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
If And Only If
In logic and related fields such as mathematics and philosophy, "if and only if" (shortened as "iff") is a biconditional logical connective between statements, where either both statements are true or both are false. The connective is biconditional (a statement of material equivalence), and can be likened to the standard material conditional ("only if", equal to "if ... then") combined with its reverse ("if"); hence the name. The result is that the truth of either one of the connected statements requires the truth of the other (i.e. either both statements are true, or both are false), though it is controversial whether the connective thus defined is properly rendered by the English "if and only if"—with its pre-existing meaning. For example, ''P if and only if Q'' means that ''P'' is true whenever ''Q'' is true, and the only case in which ''P'' is true is if ''Q'' is also true, whereas in the case of ''P if Q'', there could be other scenarios where ''P'' is true and ''Q'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ring Homomorphism
In ring theory, a branch of abstract algebra, a ring homomorphism is a structure-preserving function between two rings. More explicitly, if ''R'' and ''S'' are rings, then a ring homomorphism is a function such that ''f'' is: :addition preserving: ::f(a+b)=f(a)+f(b) for all ''a'' and ''b'' in ''R'', :multiplication preserving: ::f(ab)=f(a)f(b) for all ''a'' and ''b'' in ''R'', :and unit (multiplicative identity) preserving: ::f(1_R)=1_S. Additive inverses and the additive identity are part of the structure too, but it is not necessary to require explicitly that they too are respected, because these conditions are consequences of the three conditions above. If in addition ''f'' is a bijection, then its inverse ''f''−1 is also a ring homomorphism. In this case, ''f'' is called a ring isomorphism, and the rings ''R'' and ''S'' are called ''isomorphic''. From the standpoint of ring theory, isomorphic rings cannot be distinguished. If ''R'' and ''S'' are rngs, then the cor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stone's Representation Theorem For Boolean Algebras
In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a certain field of sets. The theorem is fundamental to the deeper understanding of Boolean algebra that emerged in the first half of the 20th century. The theorem was first proved by Marshall H. Stone. Stone was led to it by his study of the spectral theory of operators on a Hilbert space. Stone spaces Each Boolean algebra ''B'' has an associated topological space, denoted here ''S''(''B''), called its Stone space. The points in ''S''(''B'') are the ultrafilters on ''B'', or equivalently the homomorphisms from ''B'' to the two-element Boolean algebra. The topology on ''S''(''B'') is generated by a (closed) basis consisting of all sets of the form \, where ''b'' is an element of ''B''. This is the topology of pointwise convergence of nets of homomorphisms into the two-element Boolean algebra. For every Boolean algebra ''B'', ''S''(''B'') is a compact totally disco ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Field Of Sets
In mathematics, a field of sets is a mathematical structure consisting of a pair ( X, \mathcal ) consisting of a set X and a family \mathcal of subsets of X called an algebra over X that contains the empty set as an element, and is closed under the operations of taking complements in X, finite unions, and finite intersections. Fields of sets should not be confused with fields in ring theory nor with fields in physics. Similarly the term "algebra over X" is used in the sense of a Boolean algebra and should not be confused with algebras over fields or rings in ring theory. Fields of sets play an essential role in the representation theory of Boolean algebras. Every Boolean algebra can be represented as a field of sets. Definitions A field of sets is a pair ( X, \mathcal ) consisting of a set X and a family \mathcal of subsets of X, called an algebra over X, that has the following properties: : X \setminus F \in \mathcal for all F \in \mathcal. as an element: \varnothin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
