|
Invariant Subspace Problem
In the field of mathematics known as functional analysis, the invariant subspace problem is a partially unresolved problem asking whether every bounded operator on a complex Banach space sends some non-trivial closed subspace to itself. Many variants of the problem have been solved, by restricting the class of bounded operators considered or by specifying a particular class of Banach spaces. The problem is still open for separable Hilbert spaces (in other words, each example, found so far, of an operator with no non-trivial invariant subspaces is an operator that acts on a Banach space that is not isomorphic to a separable Hilbert space). History The problem seems to have been stated in the mid-1900s after work by Beurling and von Neumann,. who found (but never published) a positive solution for the case of compact operators. It was then posed by Paul Halmos for the case of operators T such that T^2 is compact. This was resolved affirmatively, for the more general class of polyn ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eigenvalue Equation
In linear algebra, linear transformations can be represented by matrices. If T is a linear transformation mapping \mathbb^n to \mathbb^m and \mathbf x is a column vector with n entries, then T( \mathbf x ) = A \mathbf x for some m \times n matrix A, called the transformation matrix of T. Note that A has m rows and n columns, whereas the transformation T is from \mathbb^n to \mathbb^m. There are alternative expressions of transformation matrices involving row vectors that are preferred by some authors. Uses Matrices allow arbitrary linear transformations to be displayed in a consistent format, suitable for computation. This also allows transformations to be composed easily (by multiplying their matrices). Linear transformations are not the only ones that can be represented by matrices. Some transformations that are non-linear on an n-dimensional Euclidean space R''n'' can be represented as linear transformations on the ''n''+1-dimensional space R''n''+1. These include both affi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dimension (vector Space)
In mathematics, the dimension of a vector space ''V'' is the cardinality (i.e., the number of vectors) of a basis of ''V'' over its base field. p. 44, §2.36 It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension. For every vector space there exists a basis, and all bases of a vector space have equal cardinality; as a result, the dimension of a vector space is uniquely defined. We say V is if the dimension of V is finite, and if its dimension is infinite. The dimension of the vector space V over the field F can be written as \dim_F(V) or as : F read "dimension of V over F". When F can be inferred from context, \dim(V) is typically written. Examples The vector space \R^3 has \left\ as a standard basis, and therefore \dim_(\R^3) = 3. More generally, \dim_(\R^n) = n, and even more generally, \dim_(F^n) = n for any field F. The complex numbers \Complex are both a real and complex vector space; we have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-standard Analysis
The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers. The standard way to resolve these debates is to define the operations of calculus using epsilon–delta procedures rather than infinitesimals. Nonstandard analysis instead reformulates the calculus using a logically rigorous notion of infinitesimal numbers. Nonstandard analysis originated in the early 1960s by the mathematician Abraham Robinson. He wrote: ... the idea of infinitely small or ''infinitesimal'' quantities seems to appeal naturally to our intuition. At any rate, the use of infinitesimals was widespread during the formative stages of the Differential and Integral Calculus. As for the objection ... that the distance between two distinct real numbers cannot be infinitely small, Gottfried Wilhelm Leibniz argued that the theory of infinitesimals implies the introduction of ideal numbers which might be infinitely small or infinitely ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperfinite Set
In nonstandard analysis, a branch of mathematics, a hyperfinite set or *-finite set is a type of internal set. An internal set ''H'' of internal cardinality ''g'' ∈ *N (the hypernaturals) is hyperfinite if and only if there exists an internal bijection between ''G'' = and ''H''. Hyperfinite sets share the properties of finite sets: A hyperfinite set has minimal and maximal elements, and a hyperfinite union of a hyperfinite collection of hyperfinite sets may be derived. The sum of the elements of any hyperfinite subset of *R always exists, leading to the possibility of well-defined integration. Hyperfinite sets can be used to approximate other sets. If a hyperfinite set approximates an interval, it is called a ''near interval'' with respect to that interval. Consider a hyperfinite set K = with a hypernatural ''n''. ''K'' is a near interval for 'a'',''b''if ''k''1 = ''a'' and ''k''''n'' = ''b'', and if the difference between successive elements of ''K'' is infinitesimal. Phrased ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-standard Analysis
The history of calculus is fraught with philosophical debates about the meaning and logical validity of fluxions or infinitesimal numbers. The standard way to resolve these debates is to define the operations of calculus using epsilon–delta procedures rather than infinitesimals. Nonstandard analysis instead reformulates the calculus using a logically rigorous notion of infinitesimal numbers. Nonstandard analysis originated in the early 1960s by the mathematician Abraham Robinson. He wrote: ... the idea of infinitely small or ''infinitesimal'' quantities seems to appeal naturally to our intuition. At any rate, the use of infinitesimals was widespread during the formative stages of the Differential and Integral Calculus. As for the objection ... that the distance between two distinct real numbers cannot be infinitely small, Gottfried Wilhelm Leibniz argued that the theory of infinitesimals implies the introduction of ideal numbers which might be infinitely small or infinitely ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Normal Operator
In mathematics, especially functional analysis, a normal operator on a complex Hilbert space ''H'' is a continuous linear operator ''N'' : ''H'' → ''H'' that commutes with its hermitian adjoint ''N*'', that is: ''NN*'' = ''N*N''. Normal operators are important because the spectral theorem holds for them. The class of normal operators is well understood. Examples of normal operators are * unitary operators: ''N*'' = ''N−1'' * Hermitian operators (i.e., self-adjoint operators): ''N*'' = ''N'' * Skew-Hermitian operators: ''N*'' = −''N'' * positive operators: ''N'' = ''MM*'' for some ''M'' (so ''N'' is self-adjoint). A normal matrix is the matrix expression of a normal operator on the Hilbert space C''n''. Properties Normal operators are characterized by the spectral theorem. A compact normal operator (in particular, a normal operator on a finite-dimensional linear space) is unitarily diagonalizable. Let T be a bounded operator. The following are equivalent. * T is normal. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spectral Theorem
In mathematics, particularly linear algebra and functional analysis, a spectral theorem is a result about when a linear operator or matrix (mathematics), matrix can be Diagonalizable matrix, diagonalized (that is, represented as a diagonal matrix in some basis). This is extremely useful because computations involving a diagonalizable matrix can often be reduced to much simpler computations involving the corresponding diagonal matrix. The concept of diagonalization is relatively straightforward for operators on finite-dimensional vector spaces but requires some modification for operators on infinite-dimensional spaces. In general, the spectral theorem identifies a class of linear operators that can be modeled by multiplication operators, which are as simple as one can hope to find. In more abstract language, the spectral theorem is a statement about commutative C*-algebras. See also spectral theory for a historical perspective. Examples of operators to which the spectral theorem appl ... [...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 is a basis for V whose vectors are orthonormal, that is, they are all unit vectors and 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 of the standard basis under a rotation or reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for \R^n arises in this fashion. For a general inner product space V, an orthonormal basis can be used to define normalized orthogonal coordinates on V. Under these coordinates, the inner product becomes a dot product of vectors. Thus the presence of an orthonormal basis reduces the study of a finite-dimensional inner product space to the study of \R^n under dot product. Every finite-dimensional inner product space has an orthonormal basis, which may be ob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uncountable
In mathematics, an uncountable set (or uncountably infinite set) is an infinite set that contains too many elements to be countable. The uncountability of a set is closely related to its cardinal number: a set is uncountable if its cardinal number is larger than that of the set of all natural numbers. Characterizations There are many equivalent characterizations of uncountability. A set ''X'' is uncountable if and only if any of the following conditions hold: * There is no injective function (hence no bijection) from ''X'' to the set of natural numbers. * ''X'' is nonempty and for every ω-sequence of elements of ''X'', there exists at least one element of X not included in it. That is, ''X'' is nonempty and there is no surjective function from the natural numbers to ''X''. * The cardinality of ''X'' is neither finite nor equal to \aleph_0 (aleph-null, the cardinality of the natural numbers). * The set ''X'' has cardinality strictly greater than \aleph_0. The first three of ... [...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 \_^ 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. An importa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Vector
An operator ''A'' on an (infinite dimensional) Banach space or Hilbert space H has a cyclic vector ''f'' if the vectors ''f'', ''Af'', ''A2f'',... span H. Equivalently, ''f'' is a cyclic vector for ''A'' in case the set of all vectors of the form ''p(A)f'', where ''p'' varies over all polynomials, is dense Density (volumetric mass density or specific mass) is the substance's mass per unit of volume. The symbol most often used for density is ''ρ'' (the lower case Greek letter rho), although the Latin letter ''D'' can also be used. Mathematically ... in H. See also * Cyclic and separating vector References Abstract algebra Functional analysis {{Abstract-algebra-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Subspace
In mathematics, in linear algebra and functional analysis, a cyclic subspace is a certain special subspace of a vector space associated with a vector in the vector space and a linear transformation of the vector space. The cyclic subspace associated with a vector ''v'' in a vector space ''V'' and a linear transformation ''T'' of ''V'' is called the ''T''-cyclic subspace generated by ''v''. The concept of a cyclic subspace is a basic component in the formulation of the cyclic decomposition theorem in linear algebra. Definition Let T:V\rightarrow V be a linear transformation of a vector space V and let v be a vector in V. The T-cyclic subspace of V generated by v is the subspace W of V generated by the set of vectors \. This subspace is denoted by Z(v;T). In the case when V is a topological vector space, v is called a cyclic vector for T if Z(v;T) is dense in V. For the particular case of finite-dimensional spaces, this is equivalent to saying that Z(v;T) is the whole space V. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
