finite sublattice
Смотреть что такое "finite sublattice" в других словарях:
Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… … 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
Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… … Wikipedia
SQ universal group — In mathematics, in the realm of group theory, a countable group is said to be SQ universal if every countable group can be embedded in one of its quotient groups. SQ universality can be thought of as a measure of largeness or complexity of a… … Wikipedia
Root system — This article discusses root systems in mathematics. For root systems of plants, see root. Lie groups … 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
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
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
Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… … 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
Free lattice — In mathematics, in the area of order theory, a free lattice is the free object corresponding to a lattice. As free objects, they have the universal property. The word problem for free lattices is also challenging.Formal definitionAny set X may be … Wikipedia
