Bounded functionIn mathematics, a function f defined on some set X with real or complex values is called bounded if the set of its values is bounded. In other words, there exists a real number M such that for all x in X. A function that is not bounded is said to be unbounded. If f is real-valued and f(x) ≤ A for all x in X, then the function is said to be bounded (from) above by A. If f(x) ≥ B for all x in X, then the function is said to be bounded (from) below by B. A real-valued function is bounded if and only if it is bounded from above and below.
Dimension theorem for vector spacesIn mathematics, the dimension theorem for vector spaces states that all bases of a vector space have equally many elements. This number of elements may be finite or infinite (in the latter case, it is a cardinal number), and defines the dimension of the vector space. Formally, the dimension theorem for vector spaces states that: As a basis is a generating set that is linearly independent, the theorem is a consequence of the following theorem, which is also useful: In particular if V is finitely generated, then all its bases are finite and have the same number of elements.
Ordered fieldIn mathematics, an ordered field is a field together with a total ordering of its elements that is compatible with the field operations. The basic example of an ordered field is the field of real numbers, and every Dedekind-complete ordered field is isomorphic to the reals. Every subfield of an ordered field is also an ordered field in the inherited order. Every ordered field contains an ordered subfield that is isomorphic to the rational numbers. Squares are necessarily non-negative in an ordered field.
Subset sum problemThe subset sum problem (SSP) is a decision problem in computer science. In its most general formulation, there is a multiset of integers and a target-sum , and the question is to decide whether any subset of the integers sum to precisely . The problem is known to be NP-hard. Moreover, some restricted variants of it are NP-complete too, for example: The variant in which all inputs are positive. The variant in which inputs may be positive or negative, and . For example, given the set , the answer is yes because the subset sums to zero.
Volume of an n-ballIn geometry, a ball is a region in a space comprising all points within a fixed distance, called the radius, from a given point; that is, it is the region enclosed by a sphere or hypersphere. An n-ball is a ball in an n-dimensional Euclidean space. The volume of a n-ball is the Lebesgue measure of this ball, which generalizes to any dimension the usual volume of a ball in 3-dimensional space. The volume of a n-ball of radius R is where is the volume of the unit n-ball, the n-ball of radius 1.
Rank–nullity theoremThe rank–nullity theorem is a theorem in linear algebra, which asserts: the number of columns of a matrix M is the sum of the rank of M and the nullity of M; and the dimension of the domain of a linear transformation f is the sum of the rank of f (the dimension of the of f) and the nullity of f (the dimension of the kernel of f). It follows that for linear transformations of vector spaces of finite dimension, either injectivity or surjectivity implies bijectivity.
SolverA solver is a piece of mathematical software, possibly in the form of a stand-alone computer program or as a software library, that 'solves' a mathematical problem. A solver takes problem descriptions in some sort of generic form and calculates their solution. In a solver, the emphasis is on creating a program or library that can easily be applied to other problems of similar type. Types of problems with existing dedicated solvers include: Linear and non-linear equations.
Partially ordered groupIn abstract algebra, a partially ordered group is a group (G, +) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if a ≤ b then a + g ≤ b + g and g + a ≤ g + b. An element x of G is called positive if 0 ≤ x. The set of elements 0 ≤ x is often denoted with G+, and is called the positive cone of G. By translation invariance, we have a ≤ b if and only if 0 ≤ -a + b.
Auxiliary normed spaceIn functional analysis, two methods of constructing normed spaces from disks were systematically employed by Alexander Grothendieck to define nuclear operators and nuclear spaces. One method is used if the disk is bounded: in this case, the auxiliary normed space is with norm The other method is used if the disk is absorbing: in this case, the auxiliary normed space is the quotient space If the disk is both bounded and absorbing then the two auxiliary normed spaces are canonically isomorphic (as topological vector spaces and as normed spaces).
Kronecker deltaIn mathematics, the Kronecker delta (named after Leopold Kronecker) is a function of two variables, usually just non-negative integers. The function is 1 if the variables are equal, and 0 otherwise: or with use of Iverson brackets: For example, because , whereas because . The Kronecker delta appears naturally in many areas of mathematics, physics, engineering and computer science, as a means of compactly expressing its definition above.
