TheoremBase

Precomposition Commutes with Pointwise Operations, and Sections of Functions Are Precompositions

Composing with a function T on the right commutes with positive and negative parts, absolute values, sums, multiples, indicators, pointwise suprema and dyadic approximations; and the sections of a function on a product are its composites with the insertion functions.

Statement

In the setting of Measurable Functions and the Lebesgue Integral: Notation, let VV and WW be sets and T:V→WT:V\to W a function; for a function ff on WW, f∘Tf\circ T is the composite of Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii), and for A⊆WA\subseteq W, T−1(A)T^{-1}(A) is the preimage of AA, as in Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set. For functions on VV and on WW, positive and negative parts and absolute values, indicator functions, sums and multiples in [0,∞][0,\infty], and dyadic approximations are those of Positive Part, Negative Part and Absolute Value of a Real-Valued Function (i), Positive Part, Negative Part and Absolute Value of a Real-Valued Function (ii), Positive Part, Negative Part and Absolute Value of a Real-Valued Function (iii), Indicator Function of a Subset (i), Sums, Multiples and Products of Functions into [0,∞] (i), Sums, Multiples and Products of Functions into [0,∞] (ii) and Dyadic Approximations of a Map into [0,∞] (i).

Positive part, negative part and absolute value. For every function f:W→Rf:W\to\mathbb{R},

(f∘T)+=f+∘T,(f∘T)−=f−∘T,∣f∘T∣=∣f∣∘T.(f\circ T)^{+}=f^{+}\circ T,\qquad(f\circ T)^{-}=f^{-}\circ T,\qquad|f\circ T|=|f|\circ T.

Sums, multiples, indicators and suprema in [0,∞][0,\infty]. Let f,g:W→[0,∞]f,g:W\to[0,\infty] be functions, c∈[0,∞]c\in[0,\infty] and A⊆WA\subseteq W. Then

(f+g)∘T=f∘T+g∘T,(cf)∘T=c (f∘T),1A∘T=1T−1(A).(f+g)\circ T=f\circ T+g\circ T,\qquad(cf)\circ T=c\,(f\circ T),\qquad\mathbf{1}_{A}\circ T=\mathbf{1}_{T^{-1}(A)}.

Let (fm)m∈N(f_{m})_{m\in\mathbb{N}} be a sequence of functions W→[0,∞]W\to[0,\infty] and h:W→[0,∞]h:W\to[0,\infty] a function with h(w)=sup⁡mfm(w)h(w)=\sup_{m}f_{m}(w) for every w∈Ww\in W, the supremum as in Order and Suprema in the Extended Real Line (iii). Then

(h∘T)(v)=sup⁡m (fm∘T)(v)(v∈V).(h\circ T)(v)=\sup_{m}\,(f_{m}\circ T)(v)\qquad(v\in V).

Dyadic approximations. For every function g:W→[0,∞]g:W\to[0,\infty] and every m∈Nm\in\mathbb{N},

sm(g)∘T=sm(g∘T).s_{m}(g)\circ T=s_{m}(g\circ T).

Sections of functions. Let ZZ be a set, f:V×W→Zf:V\times W\to Z a function, v∈Vv\in V and w∈Ww\in W, let fvf_{v} and fwf^{w} be the sections of ff, and let iv:W→V×Wi_{v}:W\to V\times W, w′↦(v,w′)w'\mapsto(v,w'), and iw:V→V×Wi^{w}:V\to V\times W, v′↦(v′,w)v'\mapsto(v',w), be the insertion functions. Then

fv=f∘iv,fw=f∘iw.f_{v}=f\circ i_{v},\qquad f^{w}=f\circ i^{w}.

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…