In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other. The prototypical examples of...
17 KB (2,061 words) - 16:03, 7 May 2025
called an orthomodular lattice. In bounded distributive lattices, complements are unique. Every complemented distributive lattice has a unique orthocomplementation...
9 KB (876 words) - 15:48, 30 May 2025
In mathematics, the distributive property of binary operations is a generalization of the distributive law, which asserts that the equality x ⋅ ( y + z...
19 KB (2,998 words) - 11:19, 19 July 2025
concept of distributivity, applied to the formation of suprema and infima. Most of these apply to partially ordered sets that are at least lattices, but the...
8 KB (1,065 words) - 21:55, 22 May 2025
completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets. Formally, a complete lattice L is said...
6 KB (665 words) - 11:01, 7 August 2025
as frames and completely distributive lattices, see distributivity in order theory. For some applications the distributivity condition is too strong,...
39 KB (5,451 words) - 17:40, 29 June 2025
Birkhoff's representation theorem (redirect from Finite distributive lattice)
distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations...
22 KB (2,980 words) - 15:23, 29 April 2025
Boolean algebra (structure) (redirect from Boolean lattice)
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties...
49 KB (3,372 words) - 02:25, 17 September 2024
Heyting algebra (redirect from Brouwer lattice)
are distributive lattices. Every Boolean algebra is a Heyting algebra when a → b is defined as ¬a ∨ b, as is every complete distributive lattice satisfying...
44 KB (6,295 words) - 11:53, 24 July 2025
inclusion, the antichains are called Sperner families and their lattice is a free distributive lattice, with a Dedekind number of elements. More generally, counting...
8 KB (1,090 words) - 11:19, 27 February 2023
duality theory for distributive lattices provides three different (but closely related) representations of bounded distributive lattices via Priestley spaces...
6 KB (599 words) - 16:40, 2 May 2025
Semilattice (redirect from Upper semi-lattice)
semilattice necessarily be bounded.) A totally ordered set is a distributive lattice, hence in particular a meet-semilattice and join-semilattice: any...
18 KB (2,387 words) - 06:30, 6 July 2025
Antimatroid (category Lattice theory)
case of greedoids and of semimodular lattices, and as a generalization of partial orders and of distributive lattices. Antimatroids are equivalent, by complementation...
35 KB (4,947 words) - 19:54, 19 June 2025
lattice: a lattice in which arbitrary meet and joins exist. Bounded lattice: a lattice with a greatest element and least element. Distributive lattice: a lattice...
21 KB (2,707 words) - 02:10, 7 June 2025
mathematics, economics, and computer science, the lattice of stable matchings is a distributive lattice whose elements are stable matchings. For a given...
26 KB (3,930 words) - 07:50, 19 January 2024
Ideal (order theory) (redirect from Ideal (lattice theory))
is no proper filter that is a strict superset. When a poset is a distributive lattice, maximal ideals and filters are necessarily prime, while the converse...
13 KB (1,762 words) - 08:42, 16 June 2025
inverse. At the same time, semirings are a generalization of bounded distributive lattices. The smallest semiring that is not a ring is the two-element Boolean...
52 KB (8,023 words) - 14:39, 23 July 2025
De Morgan algebra (redirect from Distributive i-lattice)
structure A = (A, ∨, ∧, 0, 1, ¬) such that: (A, ∨, ∧, 0, 1) is a bounded distributive lattice, and ¬ is a De Morgan involution: ¬(x ∧ y) = ¬x ∨ ¬y and ¬¬x = x...
10 KB (1,126 words) - 14:12, 3 July 2025
lattices of subgroups are distributive. More generally, a finitely generated group is cyclic if and only if its lattice of subgroups is distributive and...
6 KB (757 words) - 07:33, 27 December 2024
Dedekind number (category Lattice theory)
{\displaystyle n} -element set, the number of elements in a free distributive lattice with n {\displaystyle n} generators, and one more than the number...
16 KB (2,046 words) - 16:23, 7 May 2025
Stone duality (section The lattice of open sets)
DLat01 of bounded distributive lattices. Hence, DLat01 is dual to CohSp—one obtains Stone's representation theorem for distributive lattices. When restricting...
15 KB (2,289 words) - 19:58, 5 July 2025
composed leads to rich algebraic structures: a preorder on graphs, a distributive lattice, and a category (one for undirected graphs and one for directed graphs)...
38 KB (4,860 words) - 20:28, 9 May 2025
of N5 as a sublattice. Every distributive lattice is modular. Dilworth (1954) proved that, in every finite modular lattice, the number of join-irreducible...
20 KB (2,417 words) - 07:56, 25 June 2025
(order theory) Dense order Distributivity (order theory) Modular lattice Distributive lattice Completely distributive lattice Ascending chain condition...
5 KB (396 words) - 23:32, 16 April 2025
axiomatization of Boolean algebra, such as the axioms for a complemented distributive lattice, a sufficient condition for an algebraic structure of this kind to...
75 KB (9,569 words) - 10:59, 18 July 2025
Hamming distance, independent sets of vertices in path graphs, or via distributive lattices. Like the hypercube graph, the vertices of the Fibonacci cube of...
15 KB (1,727 words) - 18:10, 23 August 2024
poset may be defined as a small posetal category, a distributive lattice as a small posetal distributive category, a Heyting algebra as a small posetal finitely...
3 KB (320 words) - 16:17, 21 May 2025
Median graph (category Lattice theory)
graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman...
46 KB (6,003 words) - 22:18, 9 August 2025
sub-poset of the subsumption lattice, and is itself a lattice. This lattice, too, includes N5 and the minimal non-distributive lattice M3 as sublattices (see...
6 KB (703 words) - 00:48, 9 March 2022
lcm(0, 0) = 0 because then the natural numbers become a complete distributive lattice with GCD as meet and LCM as join operation. This extension of the...
36 KB (4,747 words) - 07:30, 1 August 2025