enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Distributive property - Wikipedia

    en.wikipedia.org/wiki/Distributive_property

    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 ...

  3. Ring (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Ring_(mathematics)

    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.

  4. Completely distributive lattice - Wikipedia

    en.wikipedia.org/wiki/Completely_distributive...

    In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets. Formally, a complete lattice L is said to be completely distributive if, for any doubly indexed family { x j , k | j in J , k in K j } of L , we have

  5. Distributive lattice - Wikipedia

    en.wikipedia.org/wiki/Distributive_lattice

    The simplest non-distributive lattices are M 3, the "diamond lattice", and N 5, the "pentagon lattice". A lattice is distributive if and only if none of its sublattices is isomorphic to M 3 or N 5; a sublattice is a subset that is closed under the meet and join operations of the original lattice. Note that this is not the same as being a subset ...

  6. Birkhoff's representation theorem - Wikipedia

    en.wikipedia.org/wiki/Birkhoff's_representation...

    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.

  7. Division ring - Wikipedia

    en.wikipedia.org/wiki/Division_ring

    Division rings are the only rings over which every module is free: a ring R is a division ring if and only if every R-module is free. [9] The center of a division ring is commutative and therefore a field. [10] Every division ring is therefore a division algebra over its center. Division rings can be roughly classified according to whether or ...

  8. Category of rings - Wikipedia

    en.wikipedia.org/wiki/Category_of_rings

    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 .

  9. Non-associative algebra - Wikipedia

    en.wikipedia.org/wiki/Non-associative_algebra

    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.