Search results
Results from the WOW.Com Content Network
A Boolean algebra can be interpreted either as a special kind of ring (a Boolean ring) or a special kind of distributive lattice (a Boolean lattice). Each interpretation is responsible for different distributive laws in the Boolean algebra. Similar structures without distributive laws are near-rings and near-fields instead of rings and division ...
Stone's representation theorem for distributive lattices; Representation theorem – Proof that every structure with certain properties is isomorphic to another structure; Field of sets – Algebraic concept in measure theory, also referred to as an algebra of sets; List of Boolean algebra topics
A non-associative algebra [1] (or distributive algebra) is an algebra over a field where the binary multiplication operation is not assumed to be associative.That is, an algebraic structure A is a non-associative algebra over a field K if it is a vector space over K and is equipped with a K-bilinear binary multiplication operation A × A → A which may or may not be associative.
The term "Boolean algebra" honors George Boole (1815–1864), a self-educated English mathematician. He introduced the algebraic system initially in a small pamphlet, The Mathematical Analysis of Logic, published in 1847 in response to an ongoing public controversy between Augustus De Morgan and William Hamilton, and later as a more substantial book, The Laws of Thought, published in 1854.
Because set unions and intersections obey the distributive law, this is a distributive lattice. Birkhoff's theorem states that any finite distributive lattice can be constructed in this way. Theorem. Any finite distributive lattice L is isomorphic to the lattice of lower sets of the partial order of the join-irreducible elements of L.
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. Informally, a ring is a set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers.
Conversely, every distributive lattice is isomorphic to a ring of sets; in the case of finite distributive lattices, this is Birkhoff's representation theorem and the sets may be taken as the lower sets of a partially ordered set. [1] A family of sets closed under union and relative complement is also closed under symmetric difference and ...
In mathematics, the category of rings, denoted by Ring, is the category whose objects are rings (with identity) and whose morphisms are ring homomorphisms (that preserve the identity). Like many categories in mathematics, the category of rings is large , meaning that the class of all rings is proper .