Pointwise product

Let X and Y be sets such that Y has a notion of multiplication — that is, there is a binary operation

${\displaystyle \cdot :Y\times Y\longrightarrow Y}$ given by ${\displaystyle y\cdot z=yz.}$

Then given two functions f, g: X → Y, the pointwise product (f ⋅ g) : X → Y is defined by

${\displaystyle (f\cdot g)(x)=f(x)\cdot g(x)}$

for all x in X. Just as we often omit the symbol for the binary operation ⋅ (i.e. we write yz instead of y ⋅ z), we often write fg for f ⋅ g.

The most common case of the pointwise product of two functions is when the codomain is a ring (or field), in which multiplication is well-defined.

Let X be a set and let R be a ring. Since addition and multiplication are defined in R, we can construct an algebraic structure known as an algebra out of the functions from X to R by defining addition, multiplication, and scalar multiplication of functions to be done pointwise.

If R^X denotes the set of functions from X to R, then we say that if f, g are elements of R^X, then f + g, fg, and rf — the last of which is defined by

${\displaystyle (rf)(x)=rf(x)\,}$

for all r in R — are all elements of R^X.

If both f and g have as their domain all possible assignments of a set of discrete variables, then their pointwise product is a function whose domain is constructed by all possible assignments of the union of both sets. The value of each assignment is calculated as the product of the values of both functions given to each one the subset of the assignment that is in its domain.

For example, given the function f₁() of the boolean variables p and q, and f₂() of the boolean variables q and r, both with the range in R, the pointwise product of f₁() and f₂() is shown in the next table:

p	q	r	${\displaystyle f_{1}(p,q)}$	${\displaystyle f_{2}(q,r)}$	Pointwise product
T	T	T	0.1	0.2	0.1 × 0.2
T	T	F	0.1	0.4	0.1 × 0.4
T	F	T	0.3	0.6	0.3 × 0.6
T	F	F	0.3	0.8	0.3 × 0.8
F	T	T	0.5	0.2	0.5 × 0.2
F	T	F	0.5	0.4	0.5 × 0.4
F	F	T	0.7	0.6	0.7 × 0.6
F	F	F	0.7	0.8	0.7 × 0.8

• Pointwise