|
Locally Compact Abelian Group
In several mathematical areas, including harmonic analysis, topology, and number theory, locally compact abelian groups are abelian groups which have a particularly convenient topology on them. For example, the group of integers (equipped with the discrete topology), or the real numbers or the circle (both with their usual topology) are locally compact abelian groups. Definition and examples A topological group is called ''locally compact'' if the underlying topological space is locally compact and Hausdorff; the topological group is called ''abelian'' if the underlying group is abelian. Examples of locally compact abelian groups include: * \R^n for ''n'' a positive integer, with vector addition as group operation. * The positive real numbers \R^+ with multiplication as operation. This group is isomorphic to (\R, +) by the exponential map. * Any finite abelian group, with the discrete topology. By the structure theorem for finite abelian groups, all such groups are produ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many areas of mathematics, which include number theory (the study of numbers), algebra (the study of formulas and related structures), geometry (the study of shapes and spaces that contain them), Mathematical analysis, analysis (the study of continuous changes), and set theory (presently used as a foundation for all mathematics). Mathematics involves the description and manipulation of mathematical object, abstract objects that consist of either abstraction (mathematics), abstractions from nature orin modern mathematicspurely abstract entities that are stipulated to have certain properties, called axioms. Mathematics uses pure reason to proof (mathematics), prove properties of objects, a ''proof'' consisting of a succession of applications of in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quotient Group
A quotient group or factor group is a mathematical group obtained by aggregating similar elements of a larger group using an equivalence relation that preserves some of the group structure (the rest of the structure is "factored out"). For example, the cyclic group of addition modulo ''n'' can be obtained from the group of integers under addition by identifying elements that differ by a multiple of n and defining a group structure that operates on each such class (known as a congruence class) as a single entity. It is part of the mathematical field known as group theory. For a congruence relation on a group, the equivalence class of the identity element is always a normal subgroup of the original group, and the other equivalence classes are precisely the cosets of that normal subgroup. The resulting quotient is written , where G is the original group and N is the normal subgroup. This is read as '', where \text is short for modulo. (The notation should be interpreted w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Infinite Cyclic Group
In abstract algebra, a cyclic group or monogenous group is a group, denoted C_n (also frequently \Z_n or Z_n, not to be confused with the commutative ring of -adic numbers), that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a '' generator'' of the group. Every infinite cyclic group is isomorphic to the additive group \Z, the integers. Every finite cyclic group of order n is isomorphic to the additive group of Z/''n''Z, the integers modulo n. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is a direct product of c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In abstract algebra, a cyclic group or monogenous group is a Group (mathematics), group, denoted C_n (also frequently \Z_n or Z_n, not to be confused with the commutative ring of P-adic number, -adic numbers), that is Generating set of a group, generated by a single element. That is, it is a set (mathematics), set of Inverse element, invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer Exponentiation, power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a ''Generating set of a group, generator'' of the group. Every infinite cyclic group is isomorphic to the additive group \Z, the integers. Every finite cyclic group of Order (group theory), order n is isomorphic to the additive group of Quotient group, Z/''n''Z, the in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Real Numbers
In mathematics, a real number is a number that can be used to measurement, measure a continuous variable, continuous one-dimensional quantity such as a time, duration or temperature. Here, ''continuous'' means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion. The real numbers are fundamental in calculus (and in many other branches of mathematics), in particular by their role in the classical definitions of limit (mathematics), limits, continuous function, continuity and derivatives. The set of real numbers, sometimes called "the reals", is traditionally mathematical notation, denoted by a bold , often using blackboard bold, . The adjective ''real'', used in the 17th century by René Descartes, distinguishes real numbers from imaginary numbers such as the square roots of . The real numbers include the rational numbers, such as the integer and the fraction (mathematics), fraction . ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Representable Functor
In mathematics, particularly category theory, a representable functor is a certain functor from an arbitrary category into the category of sets. 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 Yoneda's representability theorem generalizes Cayley's theorem in group theory. Definition Let C be a locally small category and let Set be the category of sets. For each object ''A'' of C let Hom(''A'',–) be the hom functor that maps object ''X'' to the set Hom(''A'',''X''). A functor ''F'' : C → Set is said to be representable if it is naturally isomorphic to Hom(''A'',–) for some object ''A'' of C. A representation of ''F'' is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dual Space
In mathematics, any vector space ''V'' has a corresponding dual vector space (or just dual space for short) consisting of all linear forms on ''V,'' together with the vector space structure of pointwise addition and scalar multiplication by constants. The dual space as defined above is defined for all vector spaces, and to avoid ambiguity may also be called the . When defined for a topological vector space, there is a subspace of the dual space, corresponding to continuous linear functionals, called the continuous dual space. Dual vector spaces find application in many branches of mathematics that use vector spaces, such as in tensor analysis with finite-dimensional vector spaces. When applied to vector spaces of functions (which are typically infinite-dimensional), dual spaces are used to describe measures, distributions, and Hilbert spaces. Consequently, the dual space is an important concept in functional analysis. Early terms for ''dual'' include ''polarer Raum'' ahn 1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Separable Space
In mathematics, a topological space is called separable if it contains a countable, dense subset; that is, there exists a sequence ( x_n )_^ of elements of the space such that every nonempty open subset of the space contains at least one element of the sequence. Like the other axioms of countability, separability is a "limitation on size", not necessarily in terms of cardinality (though, in the presence of the Hausdorff axiom, this does turn out to be the case; see below) but in a more subtle topological sense. In particular, every continuous function on a separable space whose image is a subset of a Hausdorff space is determined by its values on the countable dense subset. Contrast separability with the related notion of second countability, which is in general stronger but equivalent on the class of metrizable spaces. First examples Any topological space that is itself finite or countably infinite is separable, for the whole space is a countable dense subset of itself. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact-open Topology
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." That is to say, a sequence of functions converges in the compact-open topology precisely when it converges uniformly on every compact subset of the domain. Definition Let and be two topological spaces, and let denote the set of all continuous maps between and . Given a compact subset of and an open subset of , let denote the set of all functions such that In other words, V(K, U) = C(K, U) \times_ C(X, Y). Then the collection of all such is a subbase for the compact- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Set
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space. The idea is that a compact space has no "punctures" or "missing endpoints", i.e., it includes all ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and -\infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topological spaces. One su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Convergence
In the mathematical field of analysis, uniform convergence is a mode of convergence of functions stronger than pointwise convergence. A sequence of functions (f_n) converges uniformly to a limiting function f on a set E as the function domain if, given any arbitrarily small positive number \varepsilon, a number N can be found such that each of the functions f_N, f_,f_,\ldots differs from f by no more than \varepsilon ''at every point'' x ''in'' E. Described in an informal way, if f_n converges to f uniformly, then how quickly the functions f_n approach f is "uniform" throughout E in the following sense: in order to guarantee that f_n(x) differs from f(x) by less than a chosen distance \varepsilon, we only need to make sure that n is larger than or equal to a certain N, which we can find without knowing the value of x\in E in advance. In other words, there exists a number N=N(\varepsilon) that could depend on \varepsilon but is ''independent of x'', such that choosing n\geq N wi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Homomorphism
In mathematics, given two groups, (''G'',∗) and (''H'', ·), a group homomorphism from (''G'',∗) to (''H'', ·) is a function ''h'' : ''G'' → ''H'' such that for all ''u'' and ''v'' in ''G'' it holds that : h(u*v) = h(u) \cdot h(v) where the group operation on the left side of the equation is that of ''G'' and on the right side that of ''H''. From this property, one can deduce that ''h'' maps the identity element ''eG'' of ''G'' to the identity element ''eH'' of ''H'', : h(e_G) = e_H and it also maps inverses to inverses in the sense that : h\left(u^\right) = h(u)^. \, Hence one can say that ''h'' "is compatible with the group structure". In areas of mathematics where one considers groups endowed with additional structure, a ''homomorphism'' sometimes means a map which respects not only the group structure (as above) but also the extra structure. For example, a homomorphism of topological groups is often required to be continuous. Properties Let e_ be the ident ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
