Complete Heyting algebra

In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra that is complete as a lattice. Complete Heyting algebras are the of three different ; the category CHey, the category Loc of locales, and its , the category Frm of frames. Although these three categories contain the same objects, they differ in their morphisms, and thus get distinct names. Only the morphisms of CHey are homomorphisms of complete Heyting algebras. Locales and frames form the foundation of pointless topology, which, instead of building on point-set topology, recasts the ideas of general topology in categorical terms, as statements on frames and locales. Consider a partially ordered set (P, ≤) that is a complete lattice. Then P is a complete Heyting algebra or frame if any of the following equivalent conditions hold: P is a Heyting algebra, i.e. the operation has a right adjoint (also called the lower adjoint of a (monotone) Galois connection), for each element x of P. For all elements x of P and all subsets S of P, the following infinite distributivity law holds: P is a distributive lattice, i.e., for all x, y and z in P, we have and the meet operations are Scott continuous (i.e., preserve the suprema of directed sets) for all x in P. The entailed definition of Heyting implication is Using a bit more category theory, we can equivalently define a frame to be a cocomplete cartesian closed poset. The system of all open sets of a given topological space ordered by inclusion is a complete Heyting algebra. The of the category CHey, the category Frm of frames and the category Loc of locales are complete Heyting algebras. These categories differ in what constitutes a morphism: The morphisms of Frm are (necessarily monotone) functions that preserve finite meets and arbitrary joins. The definition of Heyting algebras crucially involves the existence of right adjoints to the binary meet operation, which together define an additional implication operation. Thus, the morphisms of CHey are morphisms of frames that in addition preserves implication.

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 concepts (24)

Related lectures (4)

Untitled MATH-436: Homotopical algebra

Functional Line: Defining Sequences and Convergence

Covers the definition of the functional line and sequences, emphasizing convergence in functional analysis.

Complex Analysis: Cauchy Integral Formula MATH-201: Analysis III

Explores the Cauchy integral formula in complex analysis and its applications in evaluating complex integrals.

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.

Stone duality

In mathematics, there is an ample supply of categorical dualities between certain of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they form a natural generalization of Stone's representation theorem for Boolean algebras. These concepts are named in honor of Marshall Stone. Stone-type dualities also provide the foundation for pointless topology and are exploited in theoretical computer science for the study of formal semantics.

Distributivity (order theory)

In the mathematical area of order theory, there are various notions of the common 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 concept can in fact reasonably be generalized to semilattices as well. Probably the most common type of distributivity is the one defined for lattices, where the formation of binary suprema and infima provide the total operations of join () and meet ().