|
Unitary Operators
In functional analysis, a unitary operator is a surjective bounded operator on a Hilbert space that preserves the inner product. Non-trivial examples include rotations, reflections, and the Fourier operator. Unitary operators generalize unitary matrices. Unitary operators are usually taken as operating ''on'' a Hilbert space, but the same notion serves to define the concept of isomorphism ''between'' Hilbert spaces. Definition Definition 1. A ''unitary operator'' is a bounded linear operator on a Hilbert space that satisfies , where is the adjoint of , and is the identity operator. The weaker condition defines an '' isometry''. The other weaker condition, , defines a ''coisometry''. Thus a unitary operator is a bounded linear operator that is both an isometry and a coisometry, or, equivalently, a surjective isometry. An equivalent definition is the following: Definition 2. A ''unitary operator'' is a bounded linear operator on a Hilbert space for which the foll ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Analysis
Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (for example, Inner product space#Definition, inner product, Norm (mathematics)#Definition, norm, or Topological space#Definitions, topology) and the linear transformation, linear functions defined on these spaces and suitably respecting these structures. The historical roots of functional analysis lie in the study of function space, spaces of functions and the formulation of properties of transformations of functions such as the Fourier transform as transformations defining, for example, continuous function, continuous or unitary operator, unitary operators between function spaces. This point of view turned out to be particularly useful for the study of differential equations, differential and integral equations. The usage of the word ''functional (mathematics), functional'' as a noun goes back to the calculus of v ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms of an object forms a group, called the automorphism group. It is, loosely speaking, the symmetry group of the object. Definition In an algebraic structure such as a group, a ring, or vector space, an ''automorphism'' is simply a bijective homomorphism of an object into itself. (The definition of a homomorphism depends on the type of algebraic structure; see, for example, group homomorphism, ring homomorphism, and linear operator.) More generally, for an object in some category, an automorphism is a morphism of the object to itself that has an inverse morphism; that is, a morphism f: X\to X is an automorphism if there is a morphism g: X\to X such that g\circ f= f\circ g = \operatorname _X, where \operatorname _X is the identity ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fourier Transform
In mathematics, the Fourier transform (FT) is an integral transform that takes a function as input then outputs another function that describes the extent to which various frequencies are present in the original function. The output of the transform is a complex-valued function of frequency. The term ''Fourier transform'' refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made, the output of the operation is sometimes called the frequency domain representation of the original function. The Fourier transform is analogous to decomposing the sound of a musical chord into the intensities of its constituent pitches. Functions that are localized in the time domain have Fourier transforms that are spread out across the frequency domain and vice versa, a phenomenon known as the uncertainty principle. The critical case for this principle is the Gaussian function, of substantial importance in probability theory and statist ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
U(1)
In mathematics, the circle group, denoted by \mathbb T or , 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 , the multiplicative group of all nonzero complex numbers. Since \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 \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 with itself n times) is geometrically an n-toru ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Absolute Value
In mathematics, the absolute value or modulus of a real number x, is the non-negative value without regard to its sign. Namely, , x, =x if x is a positive number, and , x, =-x if x is negative (in which case negating x makes -x positive), and For example, the absolute value of 3 and the absolute value of −3 is The absolute value of a number may be thought of as its distance from zero. Generalisations of the absolute value for real numbers occur in a wide variety of mathematical settings. For example, an absolute value is also defined for the complex numbers, the quaternions, ordered rings, fields and vector spaces. The absolute value is closely related to the notions of magnitude, distance, and norm in various mathematical and physical contexts. Terminology and notation In 1806, Jean-Robert Argand introduced the term ''module'', meaning ''unit of measure'' in French, specifically for the ''complex'' absolute value,Oxford English Dictionary, Draft Revision, Ju ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature, "imaginary" complex numbers have a mathematical existence as firm as that of the real numbers, and they are fundamental tools in the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or complex coefficie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Permutation Matrix
In mathematics, particularly in matrix theory, a permutation matrix is a square binary matrix that has exactly one entry of 1 in each row and each column with all other entries 0. An permutation matrix can represent a permutation of elements. Pre- multiplying an -row matrix by a permutation matrix , forming , results in permuting the rows of , while post-multiplying an -column matrix , forming , permutes the columns of . Every permutation matrix ''P'' is orthogonal, with its inverse equal to its transpose: P^=P^\mathsf. Indeed, permutation matrices can be characterized as the orthogonal matrices whose entries are all non-negative. The two permutation/matrix correspondences There are two natural one-to-one correspondences between permutations and permutation matrices, one of which works along the rows of the matrix, the other along its columns. Here is an example, starting with a permutation in two-line form at the upper left: :\begin \pi\colon\begin1&2&3&4\\3&2&4&1\e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthonormal Basis
In mathematics, particularly linear algebra, an orthonormal basis for an inner product space V with finite Dimension (linear algebra), dimension is a Basis (linear algebra), basis for V whose vectors are orthonormal, that is, they are all unit vectors and Orthogonality_(mathematics), orthogonal to each other. For example, the standard basis for a Euclidean space \R^n is an orthonormal basis, where the relevant inner product is the dot product of vectors. The Image (mathematics), image of the standard basis under a Rotation (mathematics), rotation or Reflection (mathematics), reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for \R^n arises in this fashion. An orthonormal basis can be derived from an orthogonal basis via Normalize (linear algebra), normalization. The choice of an origin (mathematics), origin and an orthonormal basis forms a coordinate frame known as an ''orthonormal frame''. For a general inner product space V, an orthono ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hadamard Matrix
In mathematics, an Hadamard matrix, named after the French mathematician Jacques Hadamard, is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal. In geometry, geometric terms, this means that each pair of rows in a Hadamard matrix represents two perpendicular vector (mathematics and physics), vectors, while in combinatorics, combinatorial terms, it means that each pair of rows has matching entries in exactly half of their columns and mismatched entries in the remaining columns. It is a consequence of this definition that the corresponding properties hold for columns as well as rows. The ''n''-dimensional Parallelepiped#Parallelotope, parallelotope spanned by the rows of an ''n'' × ''n'' Hadamard matrix has the maximum possible volume among parallelotopes spanned by vectors whose entries are bounded in absolute value by 1. Equivalently, a Hadamard matrix has maximal determinant among matrix (mathematics), matrices with entrie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
