Ad
related to: lattices examplesfreshdiscover.com has been visited by 100K+ users in the past month
Search results
Results from the WOW.Com Content Network
Besides distributive lattices, examples of modular lattices are the lattice of submodules of a module (hence modular), the lattice of two-sided ideals of a ring, and the lattice of normal subgroups of a group. The set of first-order terms with the ordering "is more specific than" is a non-modular lattice used in automated reasoning.
Lattices are best thought of as discrete approximations of continuous groups (such as Lie groups). For example, it is intuitively clear that the subgroup of integer vectors "looks like" the real vector space in some sense, while both groups are essentially different: one is finitely generated and countable, while the other is not finitely generated and has the cardinality of the continuum.
As already mentioned the main example for distributive lattices are lattices of sets, where join and meet are given by the usual set-theoretic operations. Further examples include: The Lindenbaum algebra of most logics that support conjunction and disjunction is a distributive lattice, i.e. "and" distributes over "or" and vice versa.
In geometry and group theory, a lattice in the real coordinate space is an infinite set of points in this space with the properties that coordinate-wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point.
Modular lattices arise naturally in algebra and in many other areas of mathematics. In these scenarios, modularity is an abstraction of the 2nd Isomorphism Theorem. For example, the subspaces of a vector space (and more generally the submodules of a module over a ring) form a modular lattice.
The complete subgroup lattice for D4, the dihedral group of the square. This is an example of a complete lattice. In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum and an infimum ().
For example, the monoclinic I lattice can be described by a monoclinic C lattice by different choice of crystal axes. Similarly, all A- or B-centred lattices can be described either by a C- or P-centering. This reduces the number of combinations to 14 conventional Bravais lattices, shown in the table below.
such that one of these properties suffices to define distributivity for lattices. Typical examples of distributive lattice are totally ordered sets, Boolean algebras, and Heyting algebras. Every finite distributive lattice is isomorphic to a lattice of sets, ordered by inclusion (Birkhoff's representation theorem).
Ad
related to: lattices examplesfreshdiscover.com has been visited by 100K+ users in the past month