- distributive sublattice
- мат. дистрибутивная подрешетка
Большой англо-русский и русско-английский словарь. 2001.
distributive sublattice
Смотреть что такое "distributive sublattice" в других словарях:
Distributive lattice — In mathematics, distributive lattices are lattices for which the operations of join and meet distribute over each other. The prototypical examples of such structures are collections of sets for which the lattice operations can be given by set… … Wikipedia
Distributive homomorphism — A congruence θ of a join semilattice S is monomial, if the θ equivalence class of any element of S has a largest element. We say that θ is distributive, if it is a join, in the congruence lattice Con S of S, of monomial join congruences of S. The … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most … Wikipedia
Modular lattice — Hasse diagram of N5, the smallest non modular lattice. In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self dual condition: Modular law x ≤ b implies… … Wikipedia
Dedekind–MacNeille completion — The Hasse diagram of a partially ordered set (left) and its Dedekind–MacNeille completion (right). In order theoretic mathematics, the Dedekind–MacNeille completion of a partially ordered set (also called the completion by cuts or normal… … Wikipedia
Subdirect product — In mathematics, especially in the areas of abstract algebra known as universal algebra, group theory, ring theory, and module theory, a subdirect product is a subalgebra of a direct product that depends fully on all its factors without however… … Wikipedia
Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y) (cl… … Wikipedia
Representation theorem — In mathematics, a representation theorem is a theorem that states that every abstract structure with certain properties is isomorphic to a concrete structure. For example, *in algebra, ** Cayley s theorem states that every group is isomorphic to… … Wikipedia
