Inmathematics, the qualifierpointwise is used to indicate that a certain property is defined by considering each value of somefunction An important class of pointwise concepts are thepointwise operations, that is, operations defined on functions by applying the operations to function values separately for each point in thedomain of definition. Importantrelations can also be defined pointwise.
A binary operationo:Y ×Y →Y on a setY can be lifted pointwise to an operationO: (X→Y) × (X→Y) → (X→Y) on the setX →Y of all functions fromX toY as follows: Given two functionsf1:X →Y andf2:X →Y, define the functionO(f1,f2):X →Y by
Commonly,o andO are denoted by the same symbol. A similar definition is used for unary operationso, and for operations of otherarity.[citation needed]
The pointwise addition of two functions and with the same domain andcodomain is defined by:
The pointwise product or pointwise multiplication is:
The pointwise product with a scalar is usually written with the scalar term first. Thus, when is ascalar:
An example of an operation on functions which isnot pointwise isconvolution.
Pointwise operations inherit such properties asassociativity,commutativity anddistributivity from corresponding operations on thecodomain. If is somealgebraic structure, the set of all functions to thecarrier set of can be turned into an algebraic structure of the same type in an analogous way.
Componentwise operations are usually defined on vectors, where vectors are elements of the set for somenatural number and somefield. If we denote the-th component of any vector as, then componentwise addition is.
Componentwise operations can be defined on matrices. Matrix addition, where is a componentwise operation whilematrix multiplication is not.
Atuple can be regarded as a function, and a vector is a tuple. Therefore, any vector corresponds to the function such that, and any componentwise operation on vectors is the pointwise operation on functions corresponding to those vectors.
Inorder theory it is common to define a pointwisepartial order on functions. WithA,Bposets, the set of functionsA →B can be ordered by definingf ≤g if(∀x ∈ A)f(x) ≤g(x). Pointwise orders also inherit some properties of the underlying posets. For instance if A and B arecontinuous lattices, then so is the set of functionsA →B with pointwise order.[1] Using the pointwise order on functions one can concisely define other important notions, for instance:[2]
An example of aninfinitary pointwise relation ispointwise convergence of functions—asequence of functionswithconverges pointwise to a functionf if for eachx inX
For order theory examples:
This article incorporates material from Pointwise onPlanetMath, which is licensed under theCreative Commons Attribution/Share-Alike License.