TheoremBase

Step Functions on a Partition of a Closed Interval as Simple Functions

The open cells of a partition of [a,b] cover the interval off the partition points; a function with prescribed values on the cells and on the partition points exists; and a nonnegative function constant on each cell is a nonnegative simple function whose simple integral is the sum of its cell values times the cell lengths.

Statement

In the settings of Measurable Functions and the Lebesgue Integral: Notation and The Real Line: Standing Notation and Background for Calculus on Intervals, assume the axiom of dependent choice. Let a,b∈Ra,b\in\mathbb{R} with a<ba<b, let [a,b][a,b] be the closed interval, and let λ\lambda be Lebesgue measure on R\mathbb{R}. Write ([a,b],B[a,b],λ[a,b])([a,b],\mathcal{B}_{[a,b]},\lambda_{[a,b]}) for the restriction of (R,B(R),λ)(\mathbb{R},\mathcal{B}(\mathbb{R}),\lambda) to [a,b][a,b] (a measure space, as λ\lambda is a measure and [a,b]∈B(R)[a,b]\in\mathcal{B}(\mathbb{R}) by Lebesgue Measure on the Real Line: Existence, Lengths of Intervals and Uniqueness (iv) and Lebesgue Measure on the Real Line: Existence, Lengths of Intervals and Uniqueness (i)); thus B[a,b]={D∈B(R):D⊆[a,b]}\mathcal{B}_{[a,b]}=\{D\in\mathcal{B}(\mathbb{R}):D\subseteq[a,b]\} and λ[a,b](D)=λ(D)\lambda_{[a,b]}(D)=\lambda(D) for D∈B[a,b]D\in\mathcal{B}_{[a,b]}. Let PP be a partition of [a,b][a,b], and let n∈Nn\in\mathbb{N} and the increasing listing a=x1<x2<⋯<xn+1=ba=x_{1}<x_{2}<\dots<x_{n+1}=b of PP be as in The Increasing Listing of a Partition: Endpoints, Lengths, Covering, Unions, Inserting a Point, Concatenation and Uniform Partitions (i); [n]={1,…,n}[n]=\{1,\dots,n\} is as in Intervals of Natural Numbers (ii). For i∈[n]i\in[n], let EiE_{i} be the open interval

Ei=(xi,xi+1),E_{i}=(x_{i},x_{i+1}),

where xix_{i} and xi+1x_{i+1} are defined by The Increasing Listing of a Partition: Endpoints, Lengths, Covering, Unions, Inserting a Point, Concatenation and Uniform Partitions (ii).

The cells cover the interval off the partition. For every t∈[a,b]t\in[a,b] with t∉Pt\notin P there is i∈[n]i\in[n] with t∈Eit\in E_{i}.

Step functions exist. Let c:[n]→Rc:[n]\to\mathbb{R}, i↦cii\mapsto c_{i}, be a function and let d∈Rd\in\mathbb{R}. There is a function s:[a,b]→Rs:[a,b]\to\mathbb{R} with s(t)=cis(t)=c_{i} for every i∈[n]i\in[n] and every t∈Eit\in E_{i}, and s(t)=ds(t)=d for every t∈Pt\in P.

The simple integral of a step function. Let c:[n]→Rc:[n]\to\mathbb{R}, i↦cii\mapsto c_{i}, be a function with ci≥0c_{i}\ge0 for every i∈[n]i\in[n], and let s:[a,b]→Rs:[a,b]\to\mathbb{R} be a function with s(t)≥0s(t)\ge0 for every t∈[a,b]t\in[a,b] and s(t)=cis(t)=c_{i} for every i∈[n]i\in[n] and every t∈Eit\in E_{i}; its values on PP are arbitrary. Then ss is a nonnegative simple function on ([a,b],B[a,b])([a,b],\mathcal{B}_{[a,b]}), and its simple integral is the real number

Iλ[a,b](s)=∑i=1nci (xi+1−xi),I_{\lambda_{[a,b]}}(s)=\sum_{i=1}^{n}c_{i}\,(x_{i+1}-x_{i}),

the finite sum in R\mathbb{R}.

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…