TheoremBase

Dyadic Approximations of a Map into [0,∞]

For a map g from a set X into [0,∞] and m in ℕ, the dyadic approximation sm(g)s_m(g) rounds g(x) down to a multiple of 2^{-m} and truncates at m, with value m where g is infinite; the maps sm(g)s_m(g) form a sequence of real-valued maps on X.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let ∞\infty and [0,∞][0,\infty] be as in The Extended Real Line, Its Order, and [0,∞] (i) and The Extended Real Line, Its Order, and [0,∞] (ii), so that x∈[0,∞]x\in[0,\infty] if and only if either x∈Rx\in\mathbb{R} and 0≤x0\le x, or x=∞x=\infty. Natural numbers and integers are read in R\mathbb{R} as in The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (v); in particular 22, and m∈Nm\in\mathbb{N} below, standing where a real number is required, denote their images in R\mathbb{R} as numerals, as in Commutative Rings, Fields and Ordered Fields: Standard Notation (iv), which agrees with the reading of The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (v) by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (iv). For z∈Rz\in\mathbb{R}, ⌊z⌋\lfloor z\rfloor is the integer part of zz, an integer and so a real number. For m∈Nm\in\mathbb{N}, 2m2^{m} is the power of 22 in R\mathbb{R}, which is >0>0 by Powers in a Commutative Ring, a Field and an Ordered Field: Exponent Laws, Factorisation, Geometric Sums, Monotonicity and Bernoulli's Inequality (vi), and 2−m=1/2m2^{-m}=1/2^{m}. For y,z∈Ry,z\in\mathbb{R}, min⁡{y,z}\min\{y,z\} is formed in R\mathbb{R} as in The Maximum and Minimum of Two Elements of a Total Order (i) (it is yy if y≤zy\le z and zz if z≤yz\le y, by The Maximum and Minimum of Two Elements of a Total Order (ii)). For a set XX, RX\mathbb{R}^{X} is the set of maps from XX to R\mathbb{R} of The Class of All Functions from One Set to Another (i). Let XX be a set and let g:X→[0,∞]g:X\to[0,\infty] be a map.

For m∈Nm\in\mathbb{N}, the dyadic approximation of gg of order mm is the map sm(g):X→Rs_{m}(g):X\to\mathbb{R} with

sm(g)(x)=min⁡{m,  2−m⌊2mg(x)⌋}  if g(x)∈R,sm(g)(x)=m  if g(x)=∞,s_{m}(g)(x)=\min\bigl\{m,\;2^{-m}\lfloor2^{m}g(x)\rfloor\bigr\}\ \text{ if }g(x)\in\mathbb{R},\qquad s_{m}(g)(x)=m\ \text{ if }g(x)=\infty,

for x∈Xx\in X. It exists and is unique by Maps Defined by Cases (i), applied to the predicative condition g(x)∈Rg(x)\in\mathbb{R}, to the expression min⁡{m,2−m⌊2mg(x)⌋}\min\{m,2^{-m}\lfloor2^{m}g(x)\rfloor\}, an element of R\mathbb{R} whenever g(x)∈Rg(x)\in\mathbb{R} (with 2mg(x)2^{m}g(x) the product in R\mathbb{R}, mm read in R\mathbb{R} as in The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (v), and ⌊2mg(x)⌋\lfloor2^{m}g(x)\rfloor the value at 2mg(x)2^{m}g(x) of the integer-part map of Maps Used to Build the Integral: Fibres of a Map, Pointwise Combinations with Finite Image, Tail Extrema of a Sequence of Maps, the Integer Part, and Indicators (iv)), and to the expression mm, an element of R\mathbb{R} as m∈Nm\in\mathbb{N} is read in R\mathbb{R} by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (v); for x∈Xx\in X with g(x)∉Rg(x)\notin\mathbb{R} we have g(x)=∞g(x)=\infty.

The sequence of dyadic approximations of gg is the sequence (sm(g))m∈N(s_{m}(g))_{m\in\mathbb{N}} in RX\mathbb{R}^{X}, that is, the map N→RX\mathbb{N}\to\mathbb{R}^{X} with value sm(g)s_{m}(g) at every m∈Nm\in\mathbb{N} (it exists and is unique by Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (iv) and Maps Formed Pointwise: Constant Maps, Pairs of Values, Maps Applied to Values, and Families of Maps (iii), applied to the map G:N×X→RG:\mathbb{N}\times X\to\mathbb{R} with G(m,x)=sm(g)(x)G(m,x)=s_{m}(g)(x), which exists by Maps Defined by Cases (i) as in (i), with the set N×X\mathbb{N}\times X in place of XX and the condition and the expressions written, for p=(m,x)∈N×Xp=(m,x)\in\mathbb{N}\times X, in the components p1=mp_{1}=m and p2=xp_{2}=x of pp; its value G(m,⋅)G(m,\cdot) at mm is sm(g)s_{m}(g) by the uniqueness in (i)).

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…