A modular lattice of order dimension 2. As with all finite 2-dimensional lattices, its Hasse diagram is an st-planar graph.
In the branch of mathematics called order theory, a modular lattice is a lattice that satisfies the following self-dual condition,
Modular law
a ≤ b implies a ∨ (x ∧ b) = (a ∨ x) ∧ b
where x, a, b are arbitrary elements in the lattice, ≤ is the partial order, and ∨ and ∧ (called join and meet respectively) are the operations of the lattice. This phrasing emphasizes an interpretation in terms of projection onto the sublattice [a, b], a fact known as the diamond isomorphism theorem.[1] An alternative but equivalent condition stated as an equation (see below) emphasizes that modular lattices form a variety in the sense of universal algebra.
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.
In a not necessarily modular lattice, there may still be elements b for which the modular law holds in connection with arbitrary elements x and a (for a ≤ b). Such an element is called a right modular element. Even more generally, the modular law may hold for any a and a fixed pair (x, b). Such a pair is called a modular pair, and there are various generalizations of modularity related to this notion and to semimodularity.
Modular lattices are sometimes called Dedekind lattices after Richard Dedekind, who discovered the modular identity in several motivating examples.
^"Why are modular lattices important?". Mathematics Stack Exchange. Retrieved 2018-09-17.
mathematics called order theory, a modularlattice is a lattice that satisfies the following self-dual condition, Modular law a ≤ b implies a ∨ (x ∧ b) =...
and thus have a Fourier series. A modular form can equivalently be defined as a function F from the set of lattices in C to the set of complex numbers...
A metric lattice is modular. 22. A modularlattice is semi-modular. 23. A projective lattice is modular. 24. A projective lattice is geometric. (def)...
the modular law is called an orthomodular lattice. In bounded distributive lattices, complements are unique. Every complemented distributive lattice has...
{\mbox{ and }}\quad s=cp+dq.} Elements of the modular group provide a symmetry on the two-dimensional lattice. Let ω1 and ω2 be two complex numbers whose...
positive definite lattice is a modular form whose weight is one half the rank. If the lattice is even, the form has level 1, and if the lattice is odd the form...
lattice of all subgroups of a group is not a modularlattice in general. Indeed, this particular lattice contains the forbidden "pentagon" N5 as a sublattice...
spaces G-module over a group G, in mathematics Modularlattice a kind of partially ordered set Modularity theorem (formerly Taniyama–Shimura conjecture)...
T), which is the equation that defines a modularlattice if it holds for any three elements of the lattice with Q ≤ S. In particular, since normal subgroups...
mathematics, a supersolvable lattice is a graded lattice that has a maximal chain of elements, each of which obeys a certain modularity relationship. The definition...
that defines a lattice in the complex plane. This type of lattice is the underlying object with which elliptic functions and modular forms are defined...
semimodular lattice. A finite lattice is modular if and only if it is both upper and lower semimodular. A finite lattice, or more generally a lattice satisfying...
technical result on the lattice of subgroups of a group or the lattice of submodules of a module, or more generally for any modularlattice. Lemma. Suppose G...
fact that a finite lattice is a modularlattice if and only if its Hasse diagram is a modular graph. It is not possible for a modular graph to contain a...
g(x)) form the minimal non-modularlattice N5 (see Pic. 1); its appearance prevents the subsumption lattice from being modular and hence also from being...
relations instead of normal subgroups holds for any algebraic structure. Modularlattice Derek John Scott Robinson (2003). An Introduction to Abstract Algebra...
sometimes called the invariant-subspace lattice of T and written Lat(T). As the name suggests, it is a (modular) lattice, with meets and joins given by (respectively)...
random packing of equal spheres generally has a density around 63.5%. A lattice arrangement (commonly called a regular arrangement) is one in which the...
axioms. A continuous geometry is a lattice L with the following properties L is modular. L is complete. The lattice operations ∧, ∨ satisfy a certain continuity...
In mathematics, the Leech lattice is an even unimodular lattice Λ24 in 24-dimensional Euclidean space, which is one of the best models for the kissing...
the least element. Modularlattice: a lattice whose elements satisfy the additional modular identity. Distributive lattice: a lattice in which each of meet...
operations intersection and sum make the set of all subspaces a bounded modularlattice, where the {0} subspace, the least element, is an identity element...
mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive-definite, even, unimodular lattice of rank 8. The name...
Global Information