Shift Operator
In mathematics, and in particular functional analysis, the shift operator, also known as the translation operator, is an operator that takes a function to its translation . In time series analysis, the shift operator is called the '' lag operator''. Shift operators are examples of linear operators, important for their simplicity and natural occurrence. The shift operator action on functions of a real variable plays an important role in harmonic analysis, for example, it appears in the definitions of almost periodic functions, positive-definite functions, derivatives, and convolution. Shifts of sequences (functions of an integer variable) appear in diverse areas such as Hardy spaces, the theory of abelian varieties, and the theory of symbolic dynamics, for which the baker's map is an explicit representation. The notion of triangulated category is a categorified analogue of the shift operator. Definition Functions of a real variable The shift operator (where ) takes a fu ... [...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]   |
|
Triangulated Category
In mathematics, a triangulated category is a category with the additional structure of a "translation functor" and a class of "exact triangles". Prominent examples are the derived category of an abelian category, as well as the stable homotopy category. The exact triangles generalize the short exact sequences in an abelian category, as well as fiber sequences and cofiber sequences in topology. Much of homological algebra is clarified and extended by the language of triangulated categories, an important example being the theory of sheaf cohomology. In the 1960s, a typical use of triangulated categories was to extend properties of sheaves on a space ''X'' to complexes of sheaves, viewed as objects of the derived category of sheaves on ''X''. More recently, triangulated categories have become objects of interest in their own right. Many equivalences between triangulated categories of different origins have been proved or conjectured. For example, the homological mirror symmetry c ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Multiplication Operator
In operator theory, a multiplication operator is a linear operator defined on some vector space of functions and whose value at a function is given by multiplication by a fixed function . That is, T_f\varphi(x) = f(x) \varphi (x) \quad for all in the domain of , and all in the domain of (which is the same as the domain of ). Multiplication operators generalize the notion of operator given by a diagonal matrix. More precisely, one of the results of operator theory is a spectral theorem that states that every self-adjoint operator on a Hilbert space is unitarily equivalent to a multiplication operator on an ''L''''2'' space. These operators are often contrasted with composition operators, which are similarly induced by any fixed function . They are also closely related to Toeplitz operators, which are compressions of multiplication operators on the circle to the Hardy space. Properties * A multiplication operator T_f on L^2(X), where is \sigma-finite, is bounded i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Unitary Operator
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 followi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Continuous Operator
In functional analysis and operator theory, a bounded linear operator is a linear transformation L : X \to Y between topological vector spaces (TVSs) X and Y that maps bounded subsets of X to bounded subsets of Y. If X and Y are normed vector spaces (a special type of TVS), then L is bounded if and only if there exists some M > 0 such that for all x \in X, \, Lx\, _Y \leq M \, x\, _X. The smallest such M is called the operator norm of L and denoted by \, L\, . A linear operator between normed spaces is continuous if and only if it is bounded. The concept of a bounded linear operator has been extended from normed spaces to all topological vector spaces. Outside of functional analysis, when a function f : X \to Y is called " bounded" then this usually means that its image f(X) is a bounded subset of its codomain. A linear map has this property if and only if it is identically 0. Consequently, in functional analysis, when a linear operator is called "bounded" then it is never me ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Norm (mathematics)
In mathematics, a norm is a function (mathematics), function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the Origin (mathematics), origin: it Equivariant map, commutes with scaling, obeys a form of the triangle inequality, and zero is only at the origin. In particular, the Euclidean distance in a Euclidean space is defined by a norm on the associated Euclidean vector space, called the #Euclidean norm, Euclidean norm, the #p-norm, 2-norm, or, sometimes, the magnitude or length of the vector. This norm can be defined as the square root of the inner product of a vector with itself. A seminorm satisfies the first two properties of a norm but may be zero for vectors other than the origin. A vector space with a specified norm is called a normed vector space. In a similar manner, a vector space with a seminorm is called a ''seminormed vector space''. The term pseudonorm has been used for several related meaning ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Abelian Group
In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after the Norwegian mathematician Niels Henrik Abel. The concept of an abelian group underlies many fundamental algebraic structures, such as fields, rings, vector spaces, and algebras. The theory of abelian groups is generally simpler than that of their non-abelian counterparts, and finite abelian groups are very well understood and fully classified. Definition An abelian group is a set A, together with an operation ・ , that combines any two elements a and b of A to form another element of A, denoted a \cdot b. The sym ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Infinite Sequence
In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is called the ''length'' of the sequence. Unlike a set, the same elements can appear multiple times at different positions in a sequence, and unlike a set, the order does matter. Formally, a sequence can be defined as a function from natural numbers (the positions of elements in the sequence) to the elements at each position. The notion of a sequence can be generalized to an indexed family, defined as a function from an ''arbitrary'' index set. For example, (M, A, R, Y) is a sequence of letters with the letter "M" first and "Y" last. This sequence differs from (A, R, M, Y). Also, the sequence (1, 1, 2, 3, 5, 8), which contains the number 1 at two different positions, is a valid sequence. Sequences can be '' finite'', as in these examples, or '' ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Abel Equation
The Abel equation, named after Niels Henrik Abel, is a type of functional equation of the form :f(h(x)) = h(x + 1) or :\alpha(f(x)) = \alpha(x)+1. The forms are equivalent when is invertible. or control the iteration of . Equivalence The second equation can be written :\alpha^(\alpha(f(x))) = \alpha^(\alpha(x)+1)\, . Taking , the equation can be written ::f(\alpha^(y)) = \alpha^(y+1)\, . For a known function , a problem is to solve the functional equation for the function , possibly satisfying additional requirements, such as . The change of variables , for a real parameter , brings Abel's equation into the celebrated Schröder's equation, . The further change into Böttcher's equation, . The Abel equation is a special case of (and easily generalizes to) the translation equation, :\omega( \omega(x,u),v)=\omega(x,u+v) ~, e.g., for \omega(x,1) = f(x), :\omega(x,u) = \alpha^(\alpha(x)+u). (Observe .) The Abel function further provides the canonical coor ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Iterated Function
In mathematics, an iterated function is a function that is obtained by composing another function with itself two or several times. The process of repeatedly applying the same function is called iteration. In this process, starting from some initial object, the result of applying a given function is fed again into the function as input, and this process is repeated. For example, on the image on the right: : Iterated functions are studied in computer science, fractals, dynamical systems, mathematics and renormalization group physics. Definition The formal definition of an iterated function on a set ''X'' follows. Let be a set and be a function. Defining as the ''n''-th iterate of , where ''n'' is a non-negative integer, by: f^0 ~ \stackrel ~ \operatorname_X and f^ ~ \stackrel ~ f \circ f^, where is the identity function on and denotes function composition. This notation has been traced to and John Frederick William Herschel in 1813. Herschel credited ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Binomial Theorem
In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial. According to the theorem, the power expands into a polynomial with terms of the form , where the exponents and are nonnegative integers satisfying and the coefficient of each term is a specific positive integer depending on and . For example, for , (x+y)^4 = x^4 + 4 x^3y + 6 x^2 y^2 + 4 x y^3 + y^4. The coefficient in each term is known as the binomial coefficient or (the two have the same value). These coefficients for varying and can be arranged to form Pascal's triangle. These numbers also occur in combinatorics, where gives the number of different combinations (i.e. subsets) of elements that can be chosen from an -element set. Therefore is usually pronounced as " choose ". Statement According to the theorem, the expansion of any nonnegative integer power of the binomial is a sum of the form (x+y)^n = x^n y^0 + x^ y^1 + x^ y^ ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Taylor Expansion
In mathematics, the Taylor series or Taylor expansion of a function is an infinite sum of terms that are expressed in terms of the function's derivatives at a single point. For most common functions, the function and the sum of its Taylor series are equal near this point. Taylor series are named after Brook Taylor, who introduced them in 1715. A Taylor series is also called a Maclaurin series when 0 is the point where the derivatives are considered, after Colin Maclaurin, who made extensive use of this special case of Taylor series in the 18th century. The partial sum formed by the first terms of a Taylor series is a polynomial of degree that is called the th Taylor polynomial of the function. Taylor polynomials are approximations of a function, which become generally more accurate as increases. Taylor's theorem gives quantitative estimates on the error introduced by the use of such approximations. If the Taylor series of a function is convergent, its sum is the limit o ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |