Finite-support pointwise operations Created 2026-10-25 Updated 2026-11-05
Suppose functions vanish outside finite sets , and a binary operation satisfies . The pointwise operation result then vanishes outside the union : elsewhere both inputs are zero. If these sets are their supports, this proves the displayed support inclusion.
Enumerating the union is sufficient for addition, subtraction, pointwise maximum and pointwise minimum of signed count functions. It also suffices to test their pointwise order, since elsewhere. Taking only the intersection can miss a nonzero value present on just one side. Scanning only the left support can also miss a negative right-side value when checking .
This is the pointwise order on a function space. Each of the three partial order axioms follows from the corresponding axiom in .
For reflexivity, for every , so . For antisymmetry, if and , then for every ; equality of functions therefore gives . For transitivity, if , then for every , so .
Thus is a partially ordered set. The argument also covers an empty domain , since then there is exactly one function .