|
Peter–Weyl Theorem
In mathematics, the Peter–Weyl theorem is a basic result in the theory of harmonic analysis, applying to topological groups that are compact, but are not necessarily abelian. It was initially proved by Hermann Weyl, with his student Fritz Peter, in the setting of a compact topological group ''G'' . The theorem is a collection of results generalizing the significant facts about the decomposition of the regular representation of any finite group, as discovered by Ferdinand Georg Frobenius and Issai Schur. Let ''G'' be a compact group. The theorem has three parts. The first part states that the matrix coefficients of irreducible representations of ''G'' are dense in the space ''C''(''G'') of continuous complex-valued functions on ''G'', and thus also in the space ''L''2(''G'') of square-integrable functions. The second part asserts the complete reducibility of unitary representations of ''G''. The third part then asserts that the regular representation of ''G'' on ''L''2(''G'') ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Function
In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in value, known as '' discontinuities''. More precisely, a function is continuous if arbitrarily small changes in its value can be assured by restricting to sufficiently small changes of its argument. A discontinuous function is a function that is . Up until the 19th century, mathematicians largely relied on intuitive notions of continuity, and considered only continuous functions. The epsilon–delta definition of a limit was introduced to formalize the definition of continuity. Continuity is one of the core concepts of calculus and mathematical analysis, where arguments and values of functions are real and complex numbers. The concept has been generalized to functions between metric spaces and between topological spaces. The latter are the mo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Homomorphisms
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". Older notations for the homomorphism ''h''(''x'') may be ''x''''h'' or ''x''''h'', though this may be confused as an index or a general subscript. In automata theory, sometimes homomorphisms are written to the right of their arguments without parentheses, so that ''h''(''x'') becomes simply xh. In areas of mathematics where one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Strong Operator Topology
In functional analysis, a branch of mathematics, the strong operator topology, often abbreviated SOT, is the locally convex topology on the set of bounded operators on a Hilbert space ''H'' induced by the seminorms of the form T\mapsto\, Tx\, , as ''x'' varies in ''H''. Equivalently, it is the coarsest topology such that, for each fixed ''x'' in ''H'', the evaluation map T\mapsto Tx (taking values in ''H'') is continuous in T. The equivalence of these two definitions can be seen by observing that a subbase for both topologies is given by the sets U(T_0,x,\epsilon) = \ (where ''T0'' is any bounded operator on ''H'', ''x'' is any vector and ε is any positive real number). In concrete terms, this means that T_i\to T in the strong operator topology if and only if \, T_ix-Tx\, \to 0 for each ''x'' in ''H''. The SOT is stronger than the weak operator topology and weaker than the norm topology. The SOT lacks some of the nicer properties that the weak operator topology has, but being ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Circle Group
In mathematics, the circle group, denoted by \mathbb T or \mathbb S^1, is the multiplicative group of all complex numbers with absolute value 1, that is, the unit circle in the complex plane or simply the unit complex numbers. \mathbb T = \. The circle group forms a subgroup of \mathbb C^\times, the multiplicative group of all nonzero complex numbers. Since \mathbb C^\times is abelian, it follows that \mathbb T is as well. A unit complex number in the circle group represents a rotation of the complex plane about the origin and can be parametrized by the angle measure \theta: \theta \mapsto z = e^ = \cos\theta + i\sin\theta. This is the exponential map for the circle group. The circle group plays a central role in Pontryagin duality and in the theory of Lie groups. The notation \mathbb T for the circle group stems from the fact that, with the standard topology (see below), the circle group is a 1-torus. More generally, \mathbb T^n (the direct product of \mathbb T wi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group Action (mathematics)
In mathematics, a group action on a space is a group homomorphism of a given group into the group of transformations of the space. Similarly, a group action on a mathematical structure is a group homomorphism of a group into the automorphism group of the structure. It is said that the group ''acts'' on the space or structure. If a group acts on a structure, it will usually also act on objects built from that structure. For example, the group of Euclidean isometries acts on Euclidean space and also on the figures drawn in it. For example, it acts on the set of all triangles. Similarly, the group of symmetries of a polyhedron acts on the vertices, the edges, and the faces of the polyhedron. A group action on a vector space is called a representation of the group. In the case of a finite-dimensional vector space, it allows one to identify many groups with subgroups of , the group of the invertible matrices of dimension over a field . The symmetric group acts on any set wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lie Group
In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additional properties it must have to be thought of as a "transformation" in the abstract sense, for instance multiplication and the taking of inverses (division), or equivalently, the concept of addition and the taking of inverses (subtraction). Combining these two ideas, one obtains a continuous group where multiplying points and their inverses are continuous. If the multiplication and taking of inverses are smooth (differentiable) as well, one obtains a Lie group. Lie groups provide a natural model for the concept of continuous symmetry, a celebrated example of which is the rotational symmetry in three dimensions (given by the special orthogonal group \text(3)). Lie groups are widely used in many parts of modern mathematics and physics. Lie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matrix Group
In mathematics, a matrix group is a group ''G'' consisting of invertible matrices over a specified field ''K'', with the operation of matrix multiplication. A linear group is a group that is isomorphic to a matrix group (that is, admitting a faithful, finite-dimensional representation over ''K''). Any finite group is linear, because it can be realized by permutation matrices using Cayley's theorem. Among infinite groups, linear groups form an interesting and tractable class. Examples of groups that are not linear include groups which are "too big" (for example, the group of permutations of an infinite set), or which exhibit some pathological behavior (for example, finitely generated infinite torsion groups). Definition and basic examples A group ''G'' is said to be ''linear'' if there exists a field ''K'', an integer ''d'' and an injective homomorphism from ''G'' to the general linear group GL''d''(''K'') (a faithful linear representation of dimension ''d'' over ''K''): i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stone–Weierstrass Theorem
In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed interval can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the simplest functions, and because computers can directly evaluate polynomials, this theorem has both practical and theoretical relevance, especially in polynomial interpolation. The original version of this result was established by Karl Weierstrass in 1885 using the Weierstrass transform. Marshall H. Stone considerably generalized the theorem and simplified the proof . His result is known as the Stone–Weierstrass theorem. The Stone–Weierstrass theorem generalizes the Weierstrass approximation theorem in two directions: instead of the real interval , an arbitrary compact Hausdorff space is considered, and instead of the algebra of polynomial functions, a variety of other families of continuous functions on X are shown to suffice, as is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uniform Norm
In mathematical analysis, the uniform norm (or ) assigns to real- or complex-valued bounded functions defined on a set the non-negative number :\, f\, _\infty = \, f\, _ = \sup\left\. This norm is also called the , the , the , or, when the supremum is in fact the maximum, the . The name "uniform norm" derives from the fact that a sequence of functions converges to under the metric derived from the uniform norm if and only if converges to uniformly. If is a continuous function on a closed and bounded interval, or more generally a compact set, then it is bounded and the supremum in the above definition is attained by the Weierstrass extreme value theorem, so we can replace the supremum by the maximum. In this case, the norm is also called the . In particular, if is some vector such that x = \left(x_1, x_2, \ldots, x_n\right) in finite dimensional coordinate space, it takes the form: :\, x\, _\infty := \max \left(\left, x_1\ , \ldots , \left, x_n\\right). Metric and t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Continuous Functions On A Compact Hausdorff Space
In mathematical analysis, and especially functional analysis, a fundamental role is played by the space of continuous functions on a compact Hausdorff space X with values in the real or complex numbers. This space, denoted by \mathcal(X), is a vector space with respect to the pointwise addition of functions and scalar multiplication by constants. It is, moreover, a normed space with norm defined by \, f\, = \sup_ , f(x), , the uniform norm. The uniform norm defines the topology of uniform convergence of functions on X. The space \mathcal(X) is a Banach algebra with respect to this norm. Properties * By Urysohn's lemma, \mathcal(X) separates points of X: If x, y \in X are distinct points, then there is an f \in \mathcal(X) such that f(x) \neq f(y). * The space \mathcal(X) is infinite-dimensional whenever X is an infinite space (since it separates points). Hence, in particular, it is generally not locally compact. * The Riesz–Markov–Kakutani representation theorem gives a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dense Set
In topology and related areas of mathematics, a subset ''A'' of a topological space ''X'' is said to be dense in ''X'' if every point of ''X'' either belongs to ''A'' or else is arbitrarily "close" to a member of ''A'' — for instance, the rational numbers are a dense subset of the real numbers because every real number either is a rational number or has a rational number arbitrarily close to it (see Diophantine approximation). Formally, A is dense in X if the smallest closed subset of X containing A is X itself. The of a topological space X is the least cardinality of a dense subset of X. Definition A subset A of a topological space X is said to be a of X if any of the following equivalent conditions are satisfied: The smallest closed subset of X containing A is X itself. The closure of A in X is equal to X. That is, \operatorname_X A = X. The interior of the complement of A is empty. That is, \operatorname_X (X \setminus A) = \varnothing. Every point in X either ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
