|
Functional Equation
In mathematics, a functional equation is, in the broadest meaning, an equation in which one or several functions appear as unknowns. So, differential equations and integral equations are functional equations. However, a more restricted meaning is often used, where a ''functional equation'' is an equation that relates several values of the same function. For example, the logarithm functions are essentially characterized by the ''logarithmic functional equation'' \log(xy)=\log(x) + \log(y). If the domain of the unknown function is supposed to be the natural numbers, the function is generally viewed as a sequence, and, in this case, a functional equation (in the narrower meaning) is called a recurrence relation. Thus the term ''functional equation'' is used mainly for real functions and complex functions. Moreover a smoothness condition is often assumed for the solutions, since without such a condition, most functional equations have very irregular solutions. For example, the ... [...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 mathematical analysis, 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 mathematical object, abstract objects and the use of pure reason to proof (mathematics), prove them. These objects consist of either abstraction (mathematics), abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of inference rule, deductive rules to already established results. These results include previously proved theorems, axioms ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Meromorphic Function
In the mathematical field of complex analysis, a meromorphic function on an open subset ''D'' of the complex plane is a function that is holomorphic on all of ''D'' ''except'' for a set of isolated points, which are poles of the function. The term comes from the Greek ''meros'' ( μέρος), meaning "part". Every meromorphic function on ''D'' can be expressed as the ratio between two holomorphic functions (with the denominator not constant 0) defined on ''D'': any pole must coincide with a zero of the denominator. Heuristic description Intuitively, a meromorphic function is a ratio of two well-behaved (holomorphic) functions. Such a function will still be well-behaved, except possibly at the points where the denominator of the fraction is zero. If the denominator has a zero at ''z'' and the numerator does not, then the value of the function will approach infinity; if both parts have a zero at ''z'', then one must compare the multiplicity of these zeros. From an algebraic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamel Basis
In mathematics, a set of vectors in a vector space is called a basis if every element of may be written in a unique way as a finite linear combination of elements of . The coefficients of this linear combination are referred to as components or coordinates of the vector with respect to . The elements of a basis are called . Equivalently, a set is a basis if its elements are linearly independent and every element of is a linear combination of elements of . In other words, a basis is a linearly independent spanning set. A vector space can have several bases; however all the bases have the same number of elements, called the ''dimension'' of the vector space. This article deals mainly with finite-dimensional vector spaces. However, many of the principles are also valid for infinite-dimensional vector spaces. Definition A basis of a vector space over a field (such as the real numbers or the complex numbers ) is a linearly independent subset of that spans . This me ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Axiom Of Choice
In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that ''a Cartesian product of a collection of non-empty sets is non-empty''. Informally put, the axiom of choice says that given any collection of sets, each containing at least one element, it is possible to construct a new set by arbitrarily choosing one element from each set, even if the collection is infinite. Formally, it states that for every indexed family (S_i)_ of nonempty sets, there exists an indexed set (x_i)_ such that x_i \in S_i for every i \in I. The axiom of choice was formulated in 1904 by Ernst Zermelo in order to formalize his proof of the well-ordering theorem. In many cases, a set arising from choosing elements arbitrarily can be made without invoking the axiom of choice; this is, in particular, the case if the number of sets from which to choose the elements is finite, or if a canonical rule on how to choose the elements is available – some distinguis ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a . In the case where V = W, a linear map is called a (linear) '' endomorphism''. Sometimes the term refers to this case, but the term "linear operator" can have different meanings for different conventions: for example, it can be used to emphasize that V and W are real vector spaces (not necessarily with V = W), or it can be used to emphasize that V is a function space, which is a common convention in functional analysis. Sometimes the term ''linear function'' has the same meaning as ''lin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cauchy's Functional Equation
Cauchy's functional equation is the functional equation: f(x+y) = f(x) + f(y).\ A function f that solves this equation is called an additive function. Over the rational numbers, it can be shown using elementary algebra that there is a single family of solutions, namely f:x\mapsto cx for any rational constant c. Over the real numbers, the family of linear maps f : x \mapsto cx, now with c an arbitrary real constant, is likewise a family of solutions; however there can exist other solutions not of this form that are extremely complicated. However, any of a number of regularity conditions, some of them quite weak, will preclude the existence of these pathological solutions. For example, an additive function f:\R\to\R is linear if: * f is continuous (proven by Cauchy in 1821). This condition was weakened in 1875 by Darboux who showed that it is only necessary for the function to be continuous at one point. * f is monotonic on any interval. * f is bounded on any interval. * f is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Functional Square Root
In mathematics, a functional square root (sometimes called a half iterate) is a square root of a function with respect to the operation of function composition. In other words, a functional square root of a function is a function satisfying for all . Notation Notations expressing that is a functional square root of are and . History *The functional square root of the exponential function (now known as a half-exponential function) was studied by Hellmuth Kneser in 1950. *The solutions of over \mathbb (the involutions of the real numbers) were first studied by Charles Babbage in 1815, and this equation is called Babbage's functional equation. A particular solution is for . Babbage noted that for any given solution , its functional conjugate by an arbitrary invertible function is also a solution. In other words, the group of all invertible functions on the real line acts on the subset consisting of solutions to Babbage's functional equation by conjugation. So ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Odd Function
In mathematics, even functions and odd functions are functions which satisfy particular symmetry relations, with respect to taking additive inverses. They are important in many areas of mathematical analysis, especially the theory of power series and Fourier series. They are named for the parity of the powers of the power functions which satisfy each condition: the function f(x) = x^n is an even function if ''n'' is an even integer, and it is an odd function if ''n'' is an odd integer. Definition and examples Evenness and oddness are generally considered for real functions, that is real-valued functions of a real variable. However, the concepts may be more generally defined for functions whose domain and codomain both have a notion of additive inverse. This includes abelian groups, all rings, all fields, and all vector spaces. Thus, for example, a real function could be odd or even (or neither), as could a complex-valued function of a vector variable, and so on. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Even Function
In mathematics, even functions and odd functions are functions which satisfy particular symmetry relations, with respect to taking additive inverses. They are important in many areas of mathematical analysis, especially the theory of power series and Fourier series. They are named for the parity of the powers of the power functions which satisfy each condition: the function f(x) = x^n is an even function if ''n'' is an even integer, and it is an odd function if ''n'' is an odd integer. Definition and examples Evenness and oddness are generally considered for real functions, that is real-valued functions of a real variable. However, the concepts may be more generally defined for functions whose domain and codomain both have a notion of additive inverse. This includes abelian groups, all rings, all fields, and all vector spaces. Thus, for example, a real function could be odd or even (or neither), as could a complex-valued function of a vector variable, and so on. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Periodic Function
A periodic function is a function that repeats its values at regular intervals. For example, the trigonometric functions, which repeat at intervals of 2\pi radians, are periodic functions. Periodic functions are used throughout science to describe oscillations, waves, and other phenomena that exhibit periodicity. Any function that is not periodic is called aperiodic. Definition A function is said to be periodic if, for some nonzero constant , it is the case that :f(x+P) = f(x) for all values of in the domain. A nonzero constant for which this is the case is called a period of the function. If there exists a least positive constant with this property, it is called the fundamental period (also primitive period, basic period, or prime period.) Often, "the" period of a function is used to mean its fundamental period. A function with period will repeat on intervals of length , and these intervals are sometimes also referred to as periods of the function. Geometrically, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fibonacci Numbers
In mathematics, the Fibonacci numbers, commonly denoted , form a sequence, the Fibonacci sequence, in which each number is the sum of the two preceding ones. The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes (as did Fibonacci) from 1 and 2. Starting from 0 and 1, the first few values in the sequence are: :0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144. The Fibonacci numbers were first described in Indian mathematics, as early as 200 BC in work by Pingala on enumerating possible patterns of Sanskrit poetry formed from syllables of two lengths. They are named after the Italian mathematician Leonardo of Pisa, later known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book ''Liber Abaci''. Fibonacci numbers appear unexpectedly often in mathematics, so much so that there is an entire journal dedicated to their study, the '' Fibonacci Quarterly''. Applications of Fibonacci numbers include ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Shift Operator
In mathematics, and in particular functional analysis, the shift operator also known as 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. Definition Functions of a real variable The shift operator (where ) takes a function on R to its translation , : T^t f(x) = f_t(x) = f(x+t)~. A practical operational calculus ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
