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.
Because the concept of a lattice can be axiomatised in terms of two operations and satisfying certain identities, the of all lattices constitute a variety (universal algebra), and thus there exist (by general principles of universal algebra) free objects within this category: lattices where only those relations hold which follow from the general axioms.
These free lattices may be characterised using the relevant universal property. Concretely, free lattice is a functor from sets to lattices, assigning to each set the free lattice equipped with a set map assigning to each the corresponding element . The universal property of these is that there for any map from to some arbitrary lattice exists a unique lattice homomorphism satisfying , or as a commutative diagram:
The functor is left adjoint to the forgetful functor from lattices to their underlying sets.
It is frequently possible to prove things about the free lattice directly using the universal property, but such arguments tend to be rather abstract, so a concrete construction provides a valuable alternative presentation.
In the case of semilattices, an explicit construction of the free semilattice is straightforward to give; this helps illustrate several features of the definition by way of universal property. Concretely, the free semilattice may be realised as the set of all finite nonempty subsets of , with ordinary set union as the join operation . The map maps elements of to singleton sets, i.e., for all . For any semilattice and any set map , the corresponding universal morphism is given by
where denotes the semilattice operation in .
This form of is forced by the universal property: any can be written as a finite union of elements on the form for some , the equality in the universal property says , and finally the homomorphism status of implies for all .
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, specifically order theory, the join of a subset of a partially ordered set is the supremum (least upper bound) of denoted and similarly, the meet of is the infimum (greatest lower bound), denoted In general, the join and meet of a subset of a partially ordered set need not exist. Join and meet are dual to one another with respect to order inversion. A partially ordered set in which all pairs have a join is a join-semilattice. Dually, a partially ordered set in which all pairs have a meet is a meet-semilattice.
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.
In universal algebra, a variety of algebras or equational class is the class of all algebraic structures of a given signature satisfying a given set of identities. For example, the groups form a variety of algebras, as do the abelian groups, the rings, the monoids etc. According to Birkhoff's theorem, a class of algebraic structures of the same signature is a variety if and only if it is closed under the taking of homomorphic images, subalgebras, and (direct) products.
We give a construction of an efficient one-out-of-many proof system, in which a prover shows that he knows the pre-image for one element in a set, based on the hardness of lattice problems. The construction employs the recent zero-knowledge framework of Ly ...
An oblivious linear function evaluation protocol, or OLE, is a two-party protocol for the function f (x) = ax + b, where a sender inputs the field elements a, b, and a receiver inputs x and learns f (x). OLE can be used to build secret-shared multiplicatio ...