TheoremBase

Operations over the Finite Images of Maps, and the Summands of the Simple Integral

For a set of maps with finite images, taking the operation over each image of a given summand map defines a map on that set; and for a measure and a set of maps whose level sets are measurable, the summands c times the measure of the level set at c form a map.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, maps and their values are as in Sets and Maps: Ordinary Notation (v), finite sets are as in Finite Sets (i), and for a map ss from a set XX to a set TT, s[X]s[X] is the image of XX under ss, a subset of TT, and s−1(B)s^{-1}(B) is the preimage of a set BB under ss.

Let XX, TT and YY be sets, let ∗\ast be an associative and commutative binary operation on YY with a neutral element ee, let AA be a set of maps from XX to TT such that s[X]s[X] is finite for every s∈As\in A, and let G:A×T→YG:A\times T\to Y be a map. There is exactly one map I:A→YI:A\to Y with

I(s)=∗c∈s[X]G(s,c)for every s∈A,I(s)=\mathop{\ast}\limits_{c\in s[X]}G(s,c)\qquad\text{for every }s\in A,

where, for s∈As\in A, the right-hand side is the operation over the finite set s[X]s[X], as in Sums and Products over a Finite Set and over an Interval (i) and Sums and Products over a Finite Set and over an Interval (ii), of the map c↦G(s,c)c\mapsto G(s,c) from s[X]s[X] to YY; when ∗\ast is written ++, it is the sum of Sums and Products over a Finite Set and over an Interval (v).

Let (X,F)(X,\mathcal{F}) be a measurable space, let μ\mu be a measure on (X,F)(X,\mathcal{F}), and let AA be a set of maps from XX to [0,∞][0,\infty] such that s−1({c})∈Fs^{-1}(\{c\})\in\mathcal{F} for every s∈As\in A and every c∈[0,∞]c\in[0,\infty]. There is exactly one map G:A×[0,∞]→[0,∞]G:A\times[0,\infty]\to[0,\infty] with G(s,c)=c⋅μ(s−1({c}))G(s,c)=c\cdot\mu(s^{-1}(\{c\})) for all s∈As\in A and c∈[0,∞]c\in[0,\infty], where ⋅\cdot is the product on [0,∞][0,\infty].

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…