Closed graph theorem (functional analysis)In mathematics, particularly in functional analysis and topology, the closed graph theorem is a result connecting the continuity of certain kinds of functions to a topological property of their graph. In its most elementary form, the closed graph theorem states that a linear function between two Banach spaces is continuous if and only if the graph of that function is closed. The closed graph theorem has extensive application throughout functional analysis, because it can control whether a partially-defined linear operator admits continuous extensions.
EllipseIn mathematics, an ellipse is a plane curve surrounding two focal points, such that for all points on the curve, the sum of the two distances to the focal points is a constant. It generalizes a circle, which is the special type of ellipse in which the two focal points are the same. The elongation of an ellipse is measured by its eccentricity , a number ranging from (the limiting case of a circle) to (the limiting case of infinite elongation, no longer an ellipse but a parabola).
Applications architectureIn information systems, applications architecture or application architecture is one of several architecture domains that form the pillars of an enterprise architecture (EA). An applications architecture describes the behavior of applications used in a business, focused on how they interact with each other and with users. It is focused on the data consumed and produced by applications rather than their internal structure.
Point (geometry)In classical Euclidean geometry, a point is a primitive notion that models an exact location in space, and has no length, width, or thickness. In modern mathematics, a point refers more generally to an element of some set called a space. Being a primitive notion means that a point cannot be defined in terms of previously defined objects. That is, a point is defined only by some properties, called axioms, that it must satisfy; for example, "there is exactly one line that passes through two different points".
Almost open mapIn functional analysis and related areas of mathematics, an almost open map between topological spaces is a map that satisfies a condition similar to, but weaker than, the condition of being an open map. As described below, for certain broad categories of topological vector spaces, surjective linear operators are necessarily almost open. Given a surjective map a point is called a for and is said to be (or ) if for every open neighborhood of is a neighborhood of in (note that the neighborhood is not required to be an neighborhood).
Category of setsIn the mathematical field of , the category of sets, denoted as Set, is the whose are sets. The arrows or morphisms between sets A and B are the total functions from A to B, and the composition of morphisms is the composition of functions. Many other categories (such as the , with group homomorphisms as arrows) add structure to the objects of the category of sets and/or restrict the arrows to functions of a particular kind.
Representable functorIn mathematics, particularly , a representable functor is a certain functor from an arbitrary into the . Such functors give representations of an abstract category in terms of known structures (i.e. sets and functions) allowing one to utilize, as much as possible, knowledge about the category of sets in other settings. From another point of view, representable functors for a category C are the functors given with C. Their theory is a vast generalisation of upper sets in posets, and of Cayley's theorem in group theory.
Pseudoconvex functionIn convex analysis and the calculus of variations, both branches of mathematics, a pseudoconvex function is a function that behaves like a convex function with respect to finding its local minima, but need not actually be convex. Informally, a differentiable function is pseudoconvex if it is increasing in any direction where it has a positive directional derivative. The property must hold in all of the function domain, and not only for nearby points.
Algebraic logicIn mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables. What is now usually called classical algebraic logic focuses on the identification and algebraic description of models appropriate for the study of various logics (in the form of classes of algebras that constitute the algebraic semantics for these deductive systems) and connected problems like representation and duality. Well known results like the representation theorem for Boolean algebras and Stone duality fall under the umbrella of classical algebraic logic .
Open and closed mapsIn mathematics, more specifically in topology, an open map is a function between two topological spaces that maps open sets to open sets. That is, a function is open if for any open set in the is open in Likewise, a closed map is a function that maps closed sets to closed sets. A map may be open, closed, both, or neither; in particular, an open map need not be closed and vice versa. Open and closed maps are not necessarily continuous.
