In mathematics, specifically in , an exponential object or map object is the generalization of a function space in set theory. with all and exponential objects are called . Categories (such as of ) without adjoined products may still have an exponential law.
Let be a category, let and be of , and let have all with . An object together with a morphism is an exponential object if for any object and morphism there is a unique morphism (called the transpose of ) such that the following diagram commutes:
This assignment of a unique to each establishes an isomorphism (bijection) of hom-sets,
If exists for all objects in , then the functor defined on objects by and on arrows by , is a right adjoint to the product functor . For this reason, the morphisms and are sometimes called exponential adjoints of one another.
Alternatively, the exponential object may be defined through equations:
Existence of is guaranteed by existence of the operation .
Commutativity of the diagrams above is guaranteed by the equality .
Uniqueness of is guaranteed by the equality .
The exponential is given by a universal morphism from the product functor to the object . This universal morphism consists of an object and a morphism .
In the , an exponential object is the set of all functions . The map is just the evaluation map, which sends the pair to . For any map the map is the curried form of :
A Heyting algebra is just a bounded lattice that has all exponential objects. Heyting implication, , is an alternative notation for . The above adjunction results translate to implication () being right adjoint to meet (). This adjunction can be written as , or more fully as:
In the , the exponential object exists provided that is a locally compact Hausdorff space. In that case, the space is the set of all continuous functions from to together with the compact-open topology. The evaluation map is the same as in the category of sets; it is continuous with the above topology.
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.
We will discuss the basic structure of Lie groups and of their associated Lie algebras along with their finite dimensional representations and with a special emphasis on matrix Lie groups.
In mathematics, a topos (USˈtɒpɒs, UKˈtoʊpoʊs,_ˈtoʊpɒs; plural topoi ˈtɒpɔɪ or ˈtoʊpɔɪ, or toposes) is a that behaves like the category of sheaves of sets on a topological space (or more generally: on a site). Topoi behave much like the and possess a notion of localization; they are a direct generalization of point-set topology. The Grothendieck topoi find applications in algebraic geometry; the more general elementary topoi are used in logic. The mathematical field that studies topoi is called topos theory.
In mathematics, the compact-open topology is a topology defined on the set of continuous maps between two topological spaces. The compact-open topology is one of the commonly used topologies on function spaces, and is applied in homotopy theory and functional analysis. It was introduced by Ralph Fox in 1945. If the codomain of the functions under consideration has a uniform structure or a metric structure then the compact-open topology is the "topology of uniform convergence on compact sets.
In mathematics, specifically in , hom-sets (i.e. sets of morphisms between ) give rise to important functors to the . These functors are called hom-functors and have numerous applications in category theory and other branches of mathematics. Let C be a (i.e. a for which hom-classes are actually sets and not proper classes). For all objects A and B in C we define two functors to the as follows: {| class=wikitable |- ! Hom(A, –) : C → Set ! Hom(–, B) : C → Set |- | This is a covariant functor given by: Hom(A, –) maps each object X in C to the set of morphisms, Hom(A, X) Hom(A, –) maps each morphism f : X → Y to the function Hom(A, f) : Hom(A, X) → Hom(A, Y) given by for each g in Hom(A, X).
An integer program (IP) is a problem of the form min{f(x):Ax=b,l≤x≤u,x∈Zn}, where A∈Zm×n, b∈Zm, l,u∈Zn, and f:Zn→Z is a separable convex objective function.
The problem o ...
EPFL2020
,
In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...
In a seminal work, Micciancio and Voulgaris (SIAM J Comput 42(3):1364-1391, 2013) described a deterministic single-exponential time algorithm for the closest vector problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given ...