Complete lattice

Summary

In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A lattice which satisfies at least one of these properties is known as a conditionally complete lattice. Specifically, every non-empty finite lattice is complete. Complete lattices appear in many applications in mathematics and computer science. Being a special instance of lattices, they are studied both in order theory and universal algebra. Complete lattices must not be confused with complete partial orders (cpos), which constitute a strictly more general class of partially ordered sets. More specific complete lattices are complete Boolean algebras and complete Heyting algebras (locales). Formal definition A partially ordered set (L, ≤) is a complete lattice if every subset A of L has both a greatest lower bound (the infimum, also called the meet) and a least upper bound (the supremum, also called the join) in (L, ≤). The meet is denoted

Official source

https://en.wikipedia.org/wiki/Complete_lattice

About this result

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.

Related publications (8)

Related publications

Related people (2)

Related people

Related units

Related concepts (35)

Related concepts

Related courses (1)

Related courses

Related lectures (1)

Related lectures

We study the elliptic curves given by y(2) = x(3) + bx + t(3n+1) over global function fields of characteristic 3 ; in particular we perform an explicit computation of the L-function by relating it to the zeta function of a certain superelliptic curve u(3) + bu = v(3n+1). In this way, using the Neron-Tate height on the Mordell-Weil group, we obtain lattices in dimension 2.3(n) for every n >= 1, which improve on the currently best known sphere packing densities in dimensions 162 (case n = 4) and 486 (case n = 5). For n = 3, the construction has the same packing density as the best currently known sphere packing in dimension 54, and for n = 1 it has the same density as the lattice E-6 in dimension 6.

SPRINGER INT PUBL AG2022

The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixed point property with respect to every affine isometric action on the space of p-Schatten class operators. It is in addition shown that higher rank lattices have the same property. These results are a generalization of previous theorems respectively of the author and of Bader-Furman-Gelander-Monod, which treated a commutative L-p-setting.

Amer Mathematical Soc2013

The representation theory of finite sets and correspondences

Serge Bouc, Jacques Thévenaz

We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various specific properties which do not hold for other types of functors. In particular, if k is a field and if F is a correspondence functor, then F is finitely generated if and only if the dimension of F(X) grows exponentially in terms of the cardinality of the finite set X. In such a case, F has finite length. Also, if k is noetherian, then any subfunctor of a finitely generated functor is finitely generated. When k is a field, we give a description of all the simple functors and we determine the dimension of their evaluations at any finite set. A main tool is the construction of a functor associated to any finite lattice T. We prove for instance that this functor is projective if and only if the lattice T is distributive. Moreover, it has quotients which play a crucial role in the analysis of simple functors. The special case of total orders yields some more specific results. Several other properties are also discussed, such as projectivity, duality, and symmetry. In an appendix, all the lattices associated to a given poset are described.

2015