Finding an Unique and “Natural” Extension of the Expected Value That Is Finite for All Functions in Non-Shy Subset of the Set of All Measurable Functions

Preprint

Concept Paper

Finding an Unique and “Natural” Extension of the Expected Value That Is Finite for All Functions in Non-Shy Subset of the Set of All Measurable Functions

Altmetrics

Downloads

916

Views

269

Comments

Bharath Krishnan^*

This version is not peer-reviewed

Submitted:

09 February 2024

Posted:

12 February 2024

Read the latest preprint version here

Alerts

Abstract

Suppose for n∈ ℕ, set A⊆ℝⁿ and function f∶A→ℝⁿ. If set A is Borel; we want to find an unique and “natural” extension of the expected value, w.r.t the Hausdorff measure on bounded functions to unbounded/bounded f, that's finite for all f in a non-shy subset of B*---the set of all Borel measurable functions in ℝᴬ. The issue is current extensions of the expected value are finite for all functions in only a shy subset of B*. The reason this issue wasn't resolved is mathematicians have not thought of the problem, focusing on application rather than generalization. Despite the lack of potential use, we'll attempt to solve the problem by defining a choice function---this shall choose a unique set of equivalent sequences of sets (Fₖ***) , where the set-theoretic limit of Fₖ*** is the graph of f; the measure Hʰ is the ℎ-Hausdorff measure, such for each k∈ℕ, 0 < Hʰ(Fₖ***) < +∞; and (fₖ*) is a sequence of functions where {(x₁,...,xₙ,fₖ*(x₁,...,xₙ))∶x∈ dom(Fₖ***)}=Fₖ***. Thus, if (Fₖ***) converges to A at a rate linear or super-linear to the rate non-equivelant sequences of sets converge, the extended expected value of or E**[f,Fₖ***] is: ∀(ε>0)∃(N∈ℕ)∀(k∈N)(k≥N⇒1/Hʰ(dom(Fₖ***))∫dom(Fₖ*** )fₖ* dHʰ - E**[f,Fₖ***]<ε ) which should be unique and “natural” extension for all f in a non-shy subset of B*. Note we guessed the choice function using computer programming but we don’t use mathematical proofs due to the lack of expertise in the subject matter. Despite this, the biggest use of this research is the extension of the expected value is finite for "almost all" functions: this is easier to use in application when finding the "average" of functions covering an infinite expanse of space.

Keywords:

Subject: Computer Science and Mathematics - Analysis

1. Introduction

Suppose for

n \in N

, set

A \subseteq R^{n}

and the function

f : A \to R

. If A is Borel, note the expected value of f, w.r.t the Hausdorff-dimensional Hausdorff measure, is undefined when the Hausdorff-dimension (of A)-dimensional Hausdorff measure (of also A) is either

+ \infty

, zero or the function f is unbounded. Infact, for a shy subset of

B^{*}

—the set of Borel measurable functions in

R^{A}

—the expected value of f is finite, meaning "almost no" functions have a finite expected value. More specifically, we want to manipulate the expected value of f to be finite, for a non-shy (i.e., prevelant or neither prevelant nor shy[2]) subset of

B^{*}

This can be done by taking the expected value of a sequence of bounded functions which converge to bounded/unbounded f. A sequence of bounded functions is chosen using a "choice function", where criteria are added to determine the choice function. Note, we want the expected value from the chosen sequence of bounded functions to be unique and "natural" extension of the original expected value, taking finite values only.

We do this by defining a sequence of sets called ★-sequence of sets (def. 8). Note the ★-sequences of sets converge to the graph of f rather than A; otherwise, the generalized expected value of f w.r.t to a ★-sequence (def. 9) cannot be finite for a non-shy subset of Borel measurable functions. Moreover, since there are graphs of functions with multiple ★-sequences of sets, s.t. the generalized expected values of f w.r.t each ★-sequence are different and non-unique (depending on the starred-sequence chosen)—we must have a choice function which chooses a unique set of equivalent ★-sequences with the same, unique expected value.

Therefore, when defining the choice function, we ask a question in §3.4 where with previous sections; we define equivalent & non-equivalent ★-sequences of sets for §3.1, and "natural" extensions of expected values for §3.3. We attempt to answer the question in §3.4 by redefining linear/super-linear convergence (def. 16) in terms of entropy, samples and "pathways" where the samples are derived by taking a point from each partition of a ★-sequence of sets, such the partitions have equal Hausdorff measure—§4. Since all samples have finite points; we take a "pathway" of line segments between the nearest point to each start-point of all segments in the pathway (i.e., the pathway should intersect every point once), where in def. 19 we exclude segments with lengths which are outliers [3]. The procedure is similar to the ones used in computers to graph functions [4]. We also take the length of each of the line segments in the "pathway", multiplying all lengths by a constant so they add up to one (i.e. a discrete probability distribution). We take the supremum of the Entropy of the distribution [5] w.r.t all "pathways" to redefine def. 16 as def. 20, where the redefined definition is used to create a choice function in §5.1.

2. Preliminary Definitons/Motivation

Other than integration with filters [6], there are few other constructive approaches to finding a unique and "natural" extension of the average that takes a finite value for additional functions. Before beginning, consider the following mathematical definitions:

2.1. Preliminary Definitions

Let X be a completely metrizable topological vector space.

Definition 1

(Prevalent Subset of X) . A Borel set

E \subset X

is said to be prevalent if there exists a Borel measure μ on X such that:

1.: $0 < μ (C) < \infty$ for some compact subset C of X, and
2.: the set $E + x$ has full μ-measure (that is, the complement of $E + x$ has measure zero) for all $x \in X$ .

More generally, a subset F of X is prevalent if F contains a prevalent Borel Set. Also note:

Definition 2

(Shy Subset of X). The complement of a prevalent set is called a shy set.

such that we define:

Definition 3

(Non-Shy Subset of X). A subset of X that is prevalent or neither prevalent nor shy.

Furthermore, suppose we define:

Definition 4

(Hausdorff Measure). Let

(V, d)

be a metric space,

α \in [0, \infty)

. For every

C \in V

, define the diameter of C as:

diam (C) : = sup \{d (x, y) : x, y \in C\}, diam (\emptyset) : = 0

We define:

H_{δ}^{α} (E) = inf \{\sum_{i = 1}^{\infty} {(diam (C_{i}))}^{α} : diam (C_{i}) \leq δ, E \subseteq ⋃_{i = 1}^{\infty} C_{i}\} .

(1)

The Hausdorff Outer Measure is defined by

H^{α} (E) = sup_{δ > 0} H_{δ}^{α} (E) = lim_{δ \to 0} H_{δ}^{α} (E)

i \in N

and

δ \in R

such that

δ > 0

, where the Euler’s Gamma function is Γ and constant

N_{α}

is:

N_{α} = \frac{π^{α / 2}}{2 Γ (\frac{α}{2} + 1)}

(2)

when

α \in N

and E is a Borel set we have that

L^{α} (E) = \frac{1}{2} N_{α} H^{α} (E)

(3)

such that

H^{α} (E)

is related to the α-dimensional Lebesgue Measure.

Definition 5

(Hausdorff Dimension). The Hausdorff Dimension of E is defined by

\dim_{H} (E)

where:

H^{α} (E) = \{\begin{matrix} \infty & if 0 \leq α < \dim_{H} (E) \\ 0 & if \dim_{H} (E) < α < \infty \end{matrix}

(4)

Therefore, we can use definitions 1, 2, 4 to prove or disprove:

Theorem 1.

The set of Borel measurable, unbounded functions forms a prevalent subset of the set of all Borel measurable functions.

Note 2

(Notes on Theorem 1). By measurable function, we mean the pre-image of any subset of

R

(under a measurable function) is in the Borel sigma algebra. (Note function f on set A is unbounded when there is no

I \geq 0

such that for all

x \in A

|f (x)| \leq I

however, we’re unsure if theorem 1 is correct. Despite this, we could prove or disprove theorem 1 using the paper on prevalence in [2].

If the theorem is true, it is easier to show a shy subset of Borel measurable, unbounded function have finite expected values (see the next definition). Hence, a shy subset of all Borel measurable function, including bounded Borel functions, have finite expected values.

We, therefore, define the expected value w.r.t the Hausdorff measure to be the following:

Definition 6

(Expected Value of f). If

n \in N

, where set

A \subseteq R^{n}

, the expected value of function

f : A \to R

(using def. 4 and 5) is

E [f] = \frac{1}{H^{\dim_{H} (A)} (A)} \int_{A} f d H^{\dim_{H} (A)}

where we can see there are cases where

E [f]

is undefined or infinite (e.g.

H^{\dim_{H} (A)} (A)

is zero,

+ \infty

or f is unbounded). In this case, if topological vector space X is

R^{A}

(see §2.1) where we define

B^{*}

such that:

Definition 7

(The set of all measurable functions).

B^{*}

is the set of all Borel measurable functions in

R^{A}

Then, we must prove:

Theorem 3.

The expected value

E [f]

is finite for all f in only a shy subset of

B^{*}

Note 4

(Note on Theorem 3). We’re not sure how to prove theorem 3; however, we refer to an answer from @Mathe at the last page of this citation [7],

"We can follow the argument presented in example 3.6 of [2]:

Because a function can always be represented as

f = f^{+} - f^{-}

we only consider whether positive functions have a mean value. We consider the case of a set A with finite positive measure. In this context having a mean means having a finite integral, and not being integrable means having an infinite integral.

Take

X : = L^{0} (A)

(measurable functions over A) let P denote the one-dimensional subspace of

L^{0} (A)

consisting of constant functions (assuming the Hausdorff measure on A) and let

F : = L^{0} (A) ∖ L^{1} (A)

(measurable functions over A with no finite integral)

λ_{P}

denotes the Lebesgue measure over P, for any fixed

f \in F

λ_{P} (\{β \in R : \int_{A} (f + β) μ < \infty\}) = 0

Meaning P is a 1-dimensional probe of F, so F is a 1-prevalent set. (In other terms, the set of measurable functions over A with no finite integral or mean, forms a prevalent subset of the set of all measurable functions in

R^{A}

. Therefore, using def. 2, the set of measurable functions with a finite integral or mean forms a shy subset of all Borel measurable functions in

R^{A}

2.2. Extended Expected Values

Four solutions to getting a finite expected value for the superset of the subset of

B^{*}

, where

E [f]

is finite (def. 6), follows:

1.: Defining a dimension function ; i.e., $h : [0, + \infty) \to [0, + \infty]$ , that’s monotonically increasing, strictly positive and right continuous, such that when R denotes the radius of a ball in a covering for the definition of the Hausdorff Measure, we replace $R^{\dim_{H} (A)}$ with $h (R)$ so $H^{h} (A)$ : the h-Hausdorff measure , is positive and finite. This leads to the extended expected value $E^{★} [f]$ , where:

$E^{★} [f] = \frac{1}{H^{h} (A)} \int_{A} f d H^{h}$

Note, however, not all A has dimension function h which leads to:
2.: If A is fractal but has no gauge function, we could use this paper [8] which is an extension of the Lebesgue density theorem and this paper [9] which is an extension of the Hausdorff measure using Hyperbolic Cantor sets. Note, however, when A is non-fractal (e.g. countably infinite) or f is unbounded, there is a possibility that the expected value is infinite or undefined. Hence,
3.: In the case f is unbounded and fractal, we could use [10, p.19-47], which applies a Henstock-Kurzweil type integral (i.e., $μ$ -HK integral) on a measure Metric Space. This coincides with unbounded functions with finite improper Riemman integrals, including bounded functions with finite Lebesgue integrals, bounded function with finite integrals w.r.t the Hausdorff measure, or function with finite Henstock-Kurzweil integrals.

2.3. Examples

If $n \in N$ , set $A \subseteq R^{n}$ and function $f : A \to R$ , we want to apply the definitions of the next section for the following examples:

(a): $A = R ∖ {0}$ and $f (x) = 1 / x$ . This function is unbounded and has an undefined expected value since the average of $1 / x$ , using the improper Riemann integral on $R ∖ {0}$ :

$\begin{matrix} lim_{(x_{1}, x_{2}, x_{3}, x_{4}) \to (- \infty, 0^{-}, 0^{+}, + \infty)} \frac{1}{(x_{4} - x_{3}) + (x_{2} - x_{1})} (\int_{x_{1}}^{x_{2}} \frac{1}{x} d x + \int_{x_{3}}^{x_{4}} \frac{1}{x} d x) = \end{matrix}$

(5)

$\begin{matrix} lim_{(x_{1}, x_{2}, x_{3}, x_{4}) \to (- \infty, 0^{-}, 0^{+}, + \infty)} \frac{1}{(x_{4} - x_{3}) + (x_{2} - x_{1})} (ln (| x |) + C |_{x_{1}}^{x_{2}} + ln (| x |) + C |_{x_{3}}^{x_{4}}) = \end{matrix}$

(6)

$\begin{matrix} lim_{(x_{1}, x_{2}, x_{3}, x_{4}) \to (- \infty, 0^{-}, 0^{+}, + \infty)} \frac{1}{(x_{4} - x_{3}) + (x_{2} - x_{1})} (ln (| x_{2} |) - ln (| x_{1} |) + ln (| x_{4} |) - ln (| x_{3} |)) \end{matrix}$

(7)

is $+ \infty$ (when $x_{2} = 1 / x_{1}$ , $x_{3} = 1 / x_{4}$ , and $x_{1} = exp (x_{4}^{2})$ ) or $- \infty$ (when $x_{2} = 1 / x_{1}$ , $x_{3} = 1 / x_{4}$ , and $x_{4} = - exp (x_{1}^{2})$ ), making the average undefined.
(b): $A = Q$ , gcd is the greatest common divisor, and $f_{1}, f_{2} : R \to R$ where:

$f (x) = \{\begin{matrix} f_{1} (x) & x \in A_{1} : = \{r / q : r \in odd Z, q \in even Z, q \neq 0, gcd (r, q) = 1\} \\ f_{2} (x) & x \in A_{2} : = \{r_{1} / (q_{1}) : r_{1} \in Z, q_{1} \in odd Z, gcd (r_{1}, q_{1}) = 1\} \end{matrix}$

(8)

For instance, point $(1 / 4, f_{1} (1 / 4))$ is a point in the graph of f (since $1 / 4 \in Q$ and $1 / 4 \in A_{1}$ , making $f (1 / 4) = f_{1} (1 / 4)$ ). Also, point $(1 / 3, f_{2} (1 / 3))$ is a point in the graph of f (since $1 / 3 \in Q$ and $1 / 3 \in A_{2}$ , making $f (1 / 3) = f_{2} (1 / 3)$ ); however, point $(\sqrt{2}, 1)$ is not in the graph of f (since $\sqrt{2} \notin Q$ ).

Note the function in eq. 8 is bounded; however, the expected value & extensions are undefined. (Using def. 6, we know $\dim_{H} (A) = 0$ but $H^{\dim_{H} (A)} (A) = + \infty$ , which makes $E [f]$ :

$E [f] = \frac{1}{H^{\dim_{H} (A)} (A)} \int_{A} f d H^{\dim_{H} (A)}$

undefined by division of $+ \infty$ .) Further, we assume using §2.2, crit. 1, there is no (exact) dimension function of A nor could A be "fractal" enough for extensions of the Lebesgue Density Theorem [8], extensions of the Hausdorff measure using Hyperbolic Cantor Sets [9], or extension of the Henstock-Kurzweil integral on the Metric Space [10, p.19-47].

3. Attempt to Answer Thesis

Suppose for $n \in N$ , set $A \subseteq R^{n}$ and function $f : A \to R$ . Moreover, $H^{h}$ is the h-Hausdorff measure (§2.2, crit. 1) where h is the dimension function, and $B^{*}$ is the set of all Borel measurable functions in $R^{A}$ .

Definition 8

(★-Sequence of Sets). When we define a sequence of sets

{(F_{r}^{★})}_{r \in N}

, where h is the dimension function (§2.2, crit. 1), then if:

(a): The set theoretic limit of ${(F_{r}^{★})}_{r \in N}$ is the graph of f (i.e., ${(F_{r}^{★})}_{r \in N}$ converges to the graph of f) such that

$\begin{matrix} \underset{r \to \infty}{lim sup} F_{r}^{★} = ⋂_{r \geq 1} ⋃_{q \geq r} F_{q}^{★} \\ \underset{r \to \infty}{lim inf} F_{r}^{★} = ⋃_{r \geq 1} ⋂_{q \geq r} F_{q}^{★} \end{matrix}$

with the graph of f being:

$\{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}$

such that the set-theoretic limit of ${(F_{r}^{★})}_{r \in N}$ should be:

$\underset{r \to \infty}{lim sup} F_{r}^{★} = \underset{r \to \infty}{lim inf} F_{r}^{★} = \{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}$
(b): For all $r \in N$ , where $H^{h}$ is the h-Hausdorff measure (§2.2, crit. 1):

$0 < H^{h} (F_{r}^{★}) < + \infty$
(c): we define sequence of functions ${(f_{r}^{★})}_{r \in N}$ where $f_{r}^{★} : dom (F_{r}^{★}) \to range (F_{r}^{★})$ such that:

$\{(x_{1}, \cdot \cdot \cdot, x_{n}, f_{r}^{★} (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in dom (F_{r}^{★})\} = F_{r}^{★}$

we have

(F_{r}^{★})

is a ★-sequence of sets or starred-sequence of sets .

Example 1.

One ★-sequence of sets of

f (x) = 1 / x

R ∖ {0}

(§2.3, crit. 3a) is:

{(F_{r}^{★})}_{r \in N} = {(\{(x, 1 / x) : x \in [- r, - 1 / r] \cup [1 / r, r]\})}_{r \in N}

Example 2.

Another example of a ★-sequence of sets of

f : Q \to R

where:

f (x) = \{\begin{matrix} 1 & x \in A_{1} : = \{r / q : r \in odd Z, q \in even N, q \neq 0, gcd (r, q) = 1\} \\ 0 & x \in A_{2} : = \{r_{1} / (q_{1}) : r_{1} \in Z, q_{1} \in odd N, gcd (r_{1}, q_{1}) = 1\} \end{matrix}

(9)

using (§2.3, crit. 3b) is the following:

{(F_{r}^{★})}_{r \in N} = {((x, f (x)) : x \in \{c / (r!) : - r \cdot r! \leq c \leq r \cdot r!\})}_{r \in N}

(10)

another example is:

{(F_{r}^{★})}_{r \in N} = {((x, f (x)) : x \in \{c / d : d \leq r, - d \cdot r \leq c \leq d \cdot r\})}_{r \in N}

(11)

Note this leads to a new extension of the expected value where when there exists at least one starred-sequence of sets where the extended expected value is finite, the extension could be finite for all f in a non-shy subset of

B^{*}

(def. 7).

Definition 9

(Generalized Expected Value). If

{(F_{r}^{★})}_{r \in N}

is a ★-sequence of sets (def. 8), the generalized expected value of f w.r.t

{(F_{r}^{★})}_{r \in N}

E^{* *} [f, F_{r}^{★}]

(when it exists) where:

\begin{matrix} \forall (ϵ > 0) \exists (N \in N) \forall (r \in N) (r \geq N \Rightarrow |\frac{1}{H^{h} (dom (F_{r}^{★}))} \int_{dom (F_{r}^{★})} f_{r}^{★} d H^{h} - E^{* *} [f, F_{r}^{★}]| < ϵ) \end{matrix}

(12)

Example 3.

Using example 1, we find that when

{(F_{r}^{★})}_{r \in N} = {(\{(x, 1 / x) : x \in [- r, - 1 / r] \cup [1 / r, r]\})}_{r \in N}

(a): $dom (F_{r}^{★}) = {([- r, - 1 / r] \cup [1 / r, r])}_{r \in N}$
(b): $f_{r} (x) = 1 / x$ for $x \in [- r, - 1 / r] \cup [1 / r, r]$

and the generalized expected value is:

\begin{matrix} lim_{(x_{1}, x_{2}, x_{3}, x_{4}) \to (- \infty, 0^{-}, 0^{+}, + \infty)} \frac{1}{(x_{4} - x_{3}) + (x_{2} - x_{1})} & (\int_{x_{1}}^{x_{2}} \frac{1}{x} d x + \int_{x_{3}}^{x_{4}} \frac{1}{x} d x) = \end{matrix}

(13)

\begin{matrix} lim_{r \to \infty} \frac{1}{(r - 1 / r) + (- 1 / r - (- r))} (\int_{- r}^{- 1 / r} \frac{1}{x} d x + \int_{1 / r}^{r} \frac{1}{x} d x) = \end{matrix}

(14)

\begin{matrix} lim_{r \to \infty} \frac{1}{(r - 1 / r) + (- 1 / r + r)} & (ln (| x |) + C |_{- r}^{- 1 / r} + ln (| x |) + C |_{1 / r}^{r}) = \end{matrix}

(15)

\begin{matrix} lim_{r \to \infty} \frac{1}{(r - 1 / r) + (- 1 / r + r)} & (ln (| - r |) - ln (| - 1 / r |) + ln (| r |) - ln (| 1 / r |)) = \end{matrix}

(16)

\begin{matrix} lim_{r \to \infty} \frac{1}{2 r - 2 / r} & \cdot 4 ln (r) = \end{matrix}

(17)

\begin{matrix} 0 \end{matrix}

(18)

We can see from example 2.3 crit. 3a, the average was once undefined but now we’ve "chosen" a ★-sequence which gives a finite expected value.

3.1. Equivalent and Non-Equivalent ★-sequences of Sets

Suppose we define the following:

Definition 10

(Set $V^{'}$ ). Set

V^{'}

is the set of all f, where the generalized expected value—w.r.t at least one starred sequence—exists.

The following are definitions of equivelant and non-equivelant starred-sequences of sets:

Definition 11

(Non-Equivalent Starred-Sequences of Sets). All starred-sequences of sets (in a set of ★-sequences of sets) are non-equivalent, if there exists an

f \in V^{'}

(def. 10), where the generalized expected values of f (def. 9) w.r.t each starred-sequence of sets has two or more different values (e.g., defined and undefined values are different). See Figure 1.

Definition 12

(Equivalent Starred-Sequences of Sets). All starred-sequences of sets (in the set of ★-sequences of sets) are equivalent, if we get for all

f \in V^{'}

(def. 10); the generalized expected value of f (def. 9) w.r.t each starred-sequence of sets has the same value. See Figure 2.

However, proving that two or more starred-sequences of sets are non-equivalent or equivalent (using def. 12 or 11) is tedious, since we constantly compute def. 9. Therefore, we ask the following:

3.1.1. Question 1

Is there are a simpler definition of equivalent and non-equivalent ★-sequences of sets.

3.1.2. Possible Answer

For the sake of brevity, suppose starred-sequences $F_{r_{1}}^{(1)} = F_{r_{1}}^{★}$ (i.e., def. 8), such that $F_{r_{2}}^{(2)} = F_{r_{2}}^{★ ★}$ , $F_{r_{3}}^{(3)} = F_{r_{3}}^{★ ★ ★}$ , and $F_{r_{s}}^{(s)} = F_{r_{s}}^{★ - s times}$

Definition 13

(Equivalent Starred-Sequences of Sets [Revisited]). Starred-sequence of sets

{(F_{r_{1}}^{★})}_{r_{1} \in N}

and

{(F_{r_{2}}^{★ ★})}_{r_{2} \in N}

are equivalent, if there exists a

N^{'} \in N

, where for all

r_{1} \geq N^{'}

, there exists a

r_{2} \in N

, where if

h_{1}

is the dimension function (§2.2, crit. 1) of

F_{r_{1}}^{★}

H^{h_{1}} (F_{r_{1}}^{★} Δ F_{r_{2}}^{★ ★}) = 0

and also for all

r_{2} \geq N^{'}

, there exists a

r_{1} \in N

, where if

h_{2}

is the dimension function of

F_{r_{2}}^{★ ★}

then:

H^{h_{2}} (F_{r_{1}}^{★} Δ F_{r_{2}}^{★ ★}) = 0

Note we denote these equivalent starred-sequence of sets as

{(F_{r_{1}}^{★})}_{r_{1} \in N} \sim {(F_{r_{2}}^{★ ★})}_{r_{2} \in N}

Definition 14

(Multiple Equivalent Starred-Sequences of Sets [Revisited]). All starred-sequences of sets in:

\{{(F_{r_{1}}^{★})}_{r_{1} \in N}, {(F_{r_{2}}^{★ ★})}_{r_{1} \in N}, \cdot \cdot \cdot, {(F_{r_{j}}^{(j)})}_{r_{1} \in N}\}

are equivalent, if for all

k, v \in \{1, \cdot \cdot \cdot, j\}

where

k \neq v

{(F_{r_{k}}^{(k)})}_{r_{k} \in N}

and

{(F_{r_{v}}^{(v)})}_{r_{v} \in N}

are equivelant (def. 13). We also state the former as:

{(F_{r_{k}}^{(k)})}_{r_{k} \in N} \sim {(F_{r_{v}}^{(v)})}_{r_{v} \in N}

Theorem 5.

If starred-sequences of sets in:

\{{(F_{r_{1}}^{★})}_{r_{1} \in N}, {(F_{r_{2}}^{★ ★})}_{r_{1} \in N}, \cdot \cdot \cdot, {(F_{r_{j}}^{(j)})}_{r_{1} \in N}\}

are equivalent (def. 14), then for all

k, v \in \{1, \cdot \cdot \cdot, j\}

where

k \neq v

, the generalized means of f w.r.t the ★-sequences (def. 9) have the same mean value. In other words:

E^{* *} [f, F_{r_{k}}^{(k)}] = E^{* *} [f, F_{r_{v}}^{(v)}]

Definition 15

(Non-Equivalent Starred-Sequences of Sets [Revisited]). All starred-sequences of sets in

\{{(F_{r_{s}}^{(s)})}_{r_{s} \in N} : s \in N\}

are non-equivalent, if def. 14 is false.

3.2. Motivation For Sec. 3.4

For all f in a non-shy subset of $B^{*}$ , we could choose a ★-sequence of sets ${(F_{r}^{★})}_{r \in N}$ where the generalized expected value of f, w.r.t the chosen starred-sequence, is finite. However, consider the following problem:

Theorem 6.

The set of all f, where the generalized expected values of f w.r.t two or more non-equivalent ★-sequences of sets has different values, form a non-shy subset of all Borel measurable functions in

R^{A}

This means "almost all" measurable functions have several generalized expected values depending on the starred-sequence chosen. Therefore, we need to choose a unique ★-sequence of sets where the new extended expected value is an "natural" extension of the original expected value.

3.3. Essential Definitions for a "Natural" Expected Value

Suppose ${(F_{r}^{★})}_{r \in N}$ and ${(F_{j}^{★ ★})}_{j \in N}$ are non-equivelant starred-sequences of sets (def. 8 & 15): we have the following is essential for a "natural" extension of the expected value.

Definition 16

(Linear & Super-linear Convergence of a ★-Sequence of Sets To That Of Another ★-Sequence of Sets). If we define function

S : R \to R

, where

r \in N

and for any linear

j_{1} : N \to N

, where

j = j_{1} (r)

O

is the Big-O notation, and:

H^{h} (F_{r}^{★}) = O (S (H^{h} (F_{j}^{★ ★})))

where if the following is true:

0 < lim_{x \to \infty} S (x) / x

then

{(F_{r}^{★})}_{r \in N}

converges to the graph of f: i.e.,

\{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}

at a linear or super-linear rate compared to that of

{(F_{j}^{★ ★})}_{j \in N}

Now we may combine the previous definitions into a main question with an answer that solves the thesis 1.

3.4. Main Question

Does there exist a choice function that chooses a unique set (of equivalent ★-sequences of sets—def. 14) such that:

(a): The chosen starred-sequences of sets converge to $\{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}$ at a rate linear or super-linear (def. 16) to the rate non-equivalent ★-sequences of sets (def. 15) converge to $\{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}$
(b): The generalized expected value (def. 9) of f w.r.t the chosen (and equivalent) starred-sequences of sets (def. 14) is finite.
(c): The choice function chooses a unique set of equivalent ★-sequences of sets which satisfy (1) and (2), for all $f \in Q$ such that Q is a non-shy subset (def. 5) of $B^{*}$ (i.e., the set of all Borel measurable functions in $R^{A}$ ).
(d): Out of all the choice functions which satisfy (1), (2) and (3), we choose the one with the simplest form, meaning for each choice function fully expanded, we take the one with the fewest variables/numbers (excluding those with quantifiers)?

Note 7

(Notes On Question). Note, the unique set of equivalent and chosen starred-sequences of sets is defined using notation

\sim {(F_{k}^{★ ★ ★})}_{k \in N}

, where

{(F_{k}^{★ ★ ★})}_{k \in N}

is a starred-sequence in

\sim {(F_{k}^{★ ★ ★})}_{k \in N}

. Therefore, after we define the choice function, the answer should be

E^{* *} [f, F_{k}^{★ ★ ★}]

—using def. 9 (when it exists):

\begin{matrix} \forall (ϵ > 0) \exists (N \in N) \forall (k \in N) (k \geq N \Rightarrow |\frac{1}{H^{h} (dom (F_{k}^{★ ★ ★}))} \int_{dom (F_{k}^{★ ★ ★})} f_{k}^{★} d H^{h} - E^{* *} [f, F_{k}^{★ ★ ★}]| < ϵ) \end{matrix}

(19)

Also, consider the following: if the solution to the main question is extraneous, what other criteria can be included to get a unique choice function? (Note if the solution is always extraneous, we want to replace “equivelant starred-sequences of sets” with the following: ”the set of all ★-sequences of sets, where the generalized expected values of f w.r.t each starred-sequence is the same”.)

4. Solution To The Main Question Of Section 2.4

Suppose h is the dimension function, $H^{h}$ is the h-Hausdorff measure (§2.2, crit. 1), and ${(F_{r}^{★})}_{r \in N}$ is the starred-sequence of sets (def. 8). We will use an alternative approach to definition 16 so we can define a choice function which solves the main question. Read from the second sentence of the last paragraph of the intro of §1 for a summary. Also, refer to sec. 3 and 4 of [1] for examples: (the cited paper uses sets instead of functions).

4.1. Preliminary Definitions

Definition 17

(Uniform $ε$ coverings of each term of a ★-sequence of sets). We define uniform ε coverings of each term of

{(F_{r}^{★})}_{r \in N}

as a group of pair-wise disjoint sets which cover

F_{r}^{★}

(for some

r \in N

), such when taking dimension function h of

F_{r}^{★}

, we want

H^{h}

of each pair-wise disjoint set to have the same value

ε \in range (H^{h})

, where

ε > 0

and the total sum of

H^{h}

of the coverings is minimized. In shorter notation, if

The element $t \in N$
The set $T \supset N$ is arbitrary and uncountable.

and set Ω is defined as:

Ω = \{\begin{matrix} \{1, \cdot \cdot \cdot, t\} & if there are t ways of writing uniform ε coverings of F_{r}^{★} \\ N & if there are countably infinite ways of writing uniform ε coverings of F_{r}^{★} \\ T & if there are uncountable ways of writing uniform ε coverings of F_{r}^{★} \end{matrix}

(20)

then for every

ω \in Ω

, the set of uniform ε coverings is defined using

U (ε, F_{r}^{★}, ω)

where ω “enumerates" all possible uniform ε coverings of

F_{r}^{★}

for every

r \in N

Definition 18

(Sample of the uniform

ε

coverings of each term of a ★-sequence of sets). The sample of uniform ε coverings of each term of

{(F_{r}^{★})}_{r \in N}

is the set of points where for every

ε \in range (H^{h})

and

r \in N

, we take a point from each pair-wise disjoint set in the uniform ε coverings of

F_{r}^{★}

(def. 17). In shorter notation, if

The element $k \in N$
The set $K \supset N$ is arbitrary and uncountable.

and set

Ψ_{ω}

is defined as:

Ψ_{ω} = \{\begin{matrix} \{1, \cdot \cdot \cdot, k\} & if there are k ways of writing the sample of uniform ε coverings of F_{r}^{★} \\ N & if there are countably infinite ways of writing the sample of uniform ε coverings of F_{r}^{★} \\ K & if there are uncountable ways of writing the sample of uniform ε coverings of F_{r}^{★} \end{matrix}

(21)

then for every

ψ \in Ψ_{ω}

, the set of all samples of the set of uniform ε coverings is defined using

S (U (ε, F_{r}^{★}, ω), ψ)

, such that ψ “enumerates" all possible samples of

U (ε, F_{r}^{★}, ω)

Definition 19

(Entropy on the sample of uniform coverings of each term of ★-sequence of sets). Since there are finitely many points in the sample of the uniform ε coverings of each term of

{(F_{r}^{★})}_{r \in N}

(def. 18), we:

(a)

Take a "pathway" of line segments between all points in each sample (def. 18), such that if we define the following:

i.

⌈ \cdot ⌉

is the ceiling function

ii.

d (Q, R)

is the Euclidean-distance between points

Q \in R^{n}

and

R \in R^{n}

iii.

The sequence:

{x_{i - 1}}_{i = 1}^{⌈ H^{h} (F_{r}^{★}) / ε ⌉ - 1}

contains all points in the "original" sample

S (U (ε, F_{r}^{★}, ω), ψ)

where we define a "pathway" for which we:

A.: Choose a point $x_{0} \in S (U (ε, F_{r}^{★}, ω), ψ)$
B.: Take a point from $S (U (ε, F_{r}^{★}, ω), ψ)$ (excluding $x_{0}$ ) with smallest euclidean distance from point $x_{0} \in S (U (ε, F_{r}^{★}, ω), ψ)$ . We denote this point $x_{1}$ where we take $d (x_{0}, x_{1})$ . (If more than one point has the smallest Euclidean distance from $x_{0}$ , we take either point).
C.: Take a point in $S (U (ε, F_{r}^{★}, ω), ψ)$ (excluding $x_{0}$ and $x_{1}$ ) with smallest euclidean distance from $x_{1}$ . We denote this point $x_{2}$ , where we take $d (x_{1}, x_{2})$ . (If more than one point has the smallest Euclidean distance from $x_{1}$ , we take either point).
D.: Take a point in $S (U (ε, F_{r}^{★}, ω), ψ)$ (excluding $x_{0}$ , $x_{1}$ , and $x_{2}$ ) with smallest euclidean distance from $x_{2}$ . We denote this point $x_{3}$ then take $d (x_{2}, x_{3})$ . (If more than one point has the smallest Euclidean distance from $x_{2}$ , we take either point).
E.: Repeat the process excluding points $x_{0}, x_{1}, x_{2}, x_{3},$ etc. until all points in the sample are "denoted". (This should occur $⌈ H^{h} (F_{r}^{★}) / ε ⌉ - 1$ times.)

iv.

V

is a subset of

\{i \in N : 1 \leq i \leq ⌈ H^{h} (F_{r}^{*}) / ε ⌉ - 1\}

with the largest cardinality, where that we take the subset of i-values where

x_{i}

has the

r_{i}

-th smallest Euclidean distance from

x_{i - 1}

(compared to every point in

S (U (ε, F_{r}^{★}, ω), ψ) ∖ \{x_{i - 1}\}

) such that

r_{i}

is not an outlier [3] of

\{r_{t} : t \in N, 1 \leq t \leq ⌈ H^{h} (F_{r}^{★}) / ε ⌉ - 1\}

In other words:

A.: For all $w \in V$ , we want $V$ to be the largest subset of $\{i \in N : 1 \leq i \leq ⌈ H^{h} (F_{r}^{*}) / ε ⌉ - 1\}$ for which w-values are all i-values satisfying criteria 3(a)iv.

iv.

Combining everything in def. 19, crit. 3a, we ultimately want all lengths between every point in the "pathway" (def. 18) satisfying crit. 3(a)iv. We call this:

D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ)) = \{d (x_{w}, x_{w - 1}) : w \in V\}

(b)

Using def. 19, crit. 3(a)v, normalize

D

into a discrete probability distribution. This is defined as:

\begin{matrix} P (D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ))) = \\ \{y / (\sum_{z \in D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ))} z) : y \in D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ϵ, F_{r}^{★}, ω), ψ))\} \end{matrix}

(22)

(c)

Take the entropy of (2), (for further reading, see [5]). This is defined as:

E (D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ))) = - \sum_{x \in P (D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ)))} x {log}_{2} x

(23)

(d)

Take

x_{0} \in S (U (ε, F_{r}^{★}, ω), ψ))

where

E (D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ)))

is maximized. Call this,

E (D (S (U (ε, F_{r}^{★}, ω), ψ)))

where:

\begin{matrix} E (D (S (U (ε, F_{r}^{★}, ω), ψ))) = \\ sup_{x_{0} \in S (U (ε, F_{r}^{★}, ω), ψ)} E (D (x_{0}, {x_{w - 1}}_{w \in V}, S (U (ε, F_{r}^{★}, ω), ψ))) \end{matrix}

(24)

with eq. 24 the entropy of the sample of uniform ε coverings of

F_{r}^{★}

Definition 20

(Starred-Sequence of sets converging Sublinearly, Linearly, or Superlinearly to A compared to that of another ★-Sequence).Suppose we define starred-sequences of sets

{(F_{r}^{★})}_{r \in N}

and

{(F_{j}^{★ ★})}_{j \in N}

, where for a constant

ε \in range (H^{h})

greater than zero and variable

r \in N

, we say:

(a)

Using def. 18 and 19, suppose we have:

$\begin{matrix} \underset{̲}{| S (U (ε, F_{r}^{★}, ω), ψ) |} = \\ sup \{| S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}) | : j \in N, ω^{'} \in Ω, ψ^{'} \in Ψ_{ω}, E (D (S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}))) \leq E (D (S (U (ε, F_{r}^{★}, ω), ψ)))\} \end{matrix}$

(25)

then (using $\underset{̲}{| S (U (ϵ, F_{r}^{★}, ω), ψ) |}$ ) we get

$\bar{α} (ε, r, ω, ψ) = |S (U (ε, F_{r}^{★}, ω), ψ))| / sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{̲}{|S (U (ε, F_{r}^{★}, ω), ψ)|}$

(26)

(b)

From def. 18 and 19, suppose we have:

$\begin{matrix} \bar{| S (U (ε, F_{r}^{★}, ω), ψ) |} = \\ inf \{| S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}) | : j \in N, ω^{'} \in Ω, ψ^{'} \in Ψ_{ω}, E (D (S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}))) \geq E (D (S (U (ε, F_{r}^{★}, ω), ψ)))\} \end{matrix}$

(27)

then (using $\bar{| S (U (ε, F_{r}^{★}, ω), ψ) |}$ ) we have:

$\underset{̲}{α} (ε, r, ω, ψ) = |S (U (ε, F_{r}^{★}, ω), ψ)| / sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \bar{|S (U (ε, F_{r}^{★}, ω), ψ)|}$

(28)

If using $\bar{α} (ϵ, r, ω, ψ)$ and $\underset{̲}{α} (ϵ, r, ω, ψ)$ we have that:

$sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim sup} \underset{r \to \infty}{lim sup} \bar{α} (ε, r, ω, ψ) = inf_{ω \in Ω} inf_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim inf} \underset{r \to \infty}{lim inf} \underset{̲}{α} (ε, r, ω, ψ) = 0$

we say ${(F_{r}^{★})}_{r \in N}$ converges to A at a rate superlinear to that of ${(F_{j}^{★ ★})}_{j \in N}$ .
If using equations $\bar{α} (ε, j, ω, ψ)$ and $\underset{̲}{α} (ε, j, ω, ψ)$ (where we swap ${(F_{r}^{★})}_{r \in N}$ in $\bar{α} (ϵ, r, ω, ψ)$ and $\underset{̲}{α} (ϵ, r, ω, ψ)$ with ${(F_{j}^{★ ★})}_{j \in N}$ ) we have that:

$sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim sup} \underset{j \to \infty}{lim sup} \bar{α} (ε, j, ω, ψ) = inf_{ω \in Ω} inf_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim inf} \underset{j \to \infty}{lim inf} \underset{̲}{α} (ε, j, ω, ψ) = 0$

we then say ${(F_{r}^{★})}_{r \in N}$ converges to A at a rate sublinear to that of ${(F_{j}^{★ ★})}_{j \in N}$ .
If using equations $\bar{α} (ε, r, ω, ψ)$ , $\underset{̲}{α} (ε, r, ω, ψ)$ , $\bar{α} (ε, j, ω, ψ)$ , and $\underset{̲}{α} (ε, j, ω, ψ)$ (such for the two latter, we swap ${(F_{r}^{★})}_{r \in N}$ in $\bar{α} (ε, r, ω, ψ)$ and $\underset{̲}{α} (ε, r, ω, ψ)$ with ${(F_{j}^{★ ★})}_{j \in N}$ ) we have both :

(a)

$sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim sup} \underset{r \to \infty}{lim sup} \bar{α} (ε, r, ω, ψ)$ or $inf_{ω \in Ω} inf_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim inf} \underset{r \to \infty}{lim inf} \underset{̲}{α} (ε, r, ω, ψ)$ does not equal zero

(b)

$sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim sup} \underset{j \to \infty}{lim sup} \bar{α} (ε, j, ω, ψ)$ or $inf_{ω \in Ω} inf_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim inf} \underset{j \to \infty}{lim inf} \underset{̲}{α} (ε, j, ω, ψ)$ does not equal zero

and say

{(F_{r}^{★})}_{r \in N}

converges to A at a rate linear to that of

{(F_{j}^{★ ★})}_{j \in N}

5. Attempt to Answer Main Question Of Section 2.4

5.1. Choice Function

Suppose we define the following:

1.: ${(F_{k}^{★ ★ ★})}_{k \in N}$ is a starred-sequence of sets (def. 8) which satisfies (1), (2), and (3) of the main question in §3.4
2.: $S^{'} (G)$ , where G is the graph of f; i.e.,

$G = \{(x_{1}, \cdot \cdot \cdot, x_{n}, f (x_{1}, \cdot \cdot \cdot, x_{n})) : (x_{1}, \cdot \cdot \cdot, x_{n}) \in A\}$

is the set of the starred-sequences of sets that have finite generalized mean (def. 9).
3.: ${(F_{j}^{★ ★})}_{j \in N}$ is an element $S^{'} (G)$ but not an element in the set of equivalent starred-sequences of sets (def. 14) of ${(F_{k}^{★ ★ ★})}_{k \in N}$ where using note 7, we can represent this criteria as:

${(F_{j}^{★ ★})}_{j \in N} \in S^{'} (G) ∖ \sim {(F_{k}^{★ ★ ★})}_{k \in N}$

(29)

Further note, from def. 20, if we take:

\begin{matrix} \bar{| S (U (ε, F_{k}^{★ ★ ★}, ω), ψ) |} = \\ inf \{| S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}) | : j \in N, ω^{'} \in Ω, ψ^{'} \in Ψ_{ω}, E (D (S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}))) \geq E (D (S (U (ε, F_{k}^{★ ★ ★}, ω), ψ)))\} \end{matrix}

(30)

and from def. 20, we take:

\begin{matrix} \underset{̲}{| S (U (ε, F_{k}^{★ ★ ★}, ω), ψ) |} = \\ sup \{| S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}) | : j \in N, ω^{'} \in Ω, ψ^{'} \in Ψ_{ω}, E (D (S (U (ε, F_{j}^{★ ★}, ω^{'}), ψ^{'}))) \leq E (D (S (U (ε, F_{k}^{★ ★ ★}, ω), ψ)))\} \end{matrix}

(31)

Then, when we write def. 18, eq. 30 and eq. 31 as:

\begin{matrix} sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} | S (U (ε, F_{k}^{★ ★ ★}, ω), ψ) | = | S^{'} (ε, F_{k}^{★ ★ ★}) | = | S^{'} | \end{matrix}

(32)

\begin{matrix} sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \bar{| S (U (ε, F_{k}^{★ ★ ★}, ω), ψ) |} = \bar{| S^{'} (ε, F_{k}^{★ ★ ★}) |} = \bar{| S^{'} |} \end{matrix}

(33)

\begin{matrix} sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{̲}{| S (U (ε, F_{k}^{★ ★ ★}, ω), ψ) |} = \underset{̲}{| S^{'} (ε, F_{k}^{★ ★ ★}) |} = \underset{̲}{| S^{'} |} \end{matrix}

(34)

the choice function (which we’ll later define on pg. 16, thm. 8) should immediately choose

F_{k}^{★ ★ ★}

when:

1.

For all

m \in \{1, \cdot \cdot \cdot, n\}

when defining the set of all values of the m-th coordinate of

(c_{1}, c_{2}, \cdot \cdot \cdot, c_{n + 1}) \in F_{k}^{★ ★ ★}

(i.e.,

F_{k, m}^{★ ★ ★}

—where, unlike cit.[1, §4], we focus on the domain of

F_{k}^{★ ★ ★}

to get "n" instead of "

n + 1

"), then when

z > 0

, we either want:

(a): $sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = z$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = - z$ .
(b): $sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = 0$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = - z$ .
(c): $sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = z$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = 0$ .
(d): $sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = 0$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = 0$ .

2.

If the center of the universe is a chosen point

Z \in R^{n + 1}

, where:

Z = (z_{1}, z_{2}, \cdot \cdot \cdot, z_{n + 1})

(35)

then for all

m \in \{1, \cdot \cdot \cdot, n\}

, there exists

q \in N

, s.t.for all

k \geq q

, when set

F_{k, m}^{★ ★ ★}

is a collection of all the values of the m-th co-ordinate of

(c_{1}, c_{2}, \cdot \cdot \cdot, c_{n + 1}) \in F_{k}^{★ ★ ★}

, such that

x_{1} \in F_{k, m}^{★ ★ ★}

(again, unlike cit.[1, §4], we focus on the domain of

F_{k}^{★ ★ ★}

to get "n" instead of "

n + 1

"), we must get:

\frac{1}{H^{h} (F_{k, m}^{★ ★ ★})} \int_{F_{k, m}^{★ ★ ★}} x_{1} d H^{h} = z_{m}

(36)

where, using absolute value function

| | \cdot | |

and

m \in \{1, 2, \cdot \cdot \cdot, n\}

, when set

F_{k, m}^{★ ★ ★}

is a collection of all the values of the m-th co-ordinate of

(c_{1}, c_{2}, \cdot \cdot \cdot, c_{n + 1}) \in F_{k}^{★ ★ ★}

, for

z > 0

, when we define:

\begin{matrix} S (z, k, m) = | | z & - (sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★})) (inf (F_{k, m}^{★ ★ ★}) - inf (F_{k + 1, m}^{★ ★ ★})) \\ | | (inf (F_{k, m}^{★ ★ ★}) - inf (F_{k + 1, m}^{★ ★ ★})) (sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) - 1) | | | | \end{matrix}

(37)

and

\begin{matrix} T (z_{m}, k, m) = & ((sup (F_{k + 1, m}^{★ ★ ★}) - z_{m}) (inf (F_{k, m}^{★ ★ ★}) - z_{m}) - (sup (F_{k, m}^{★ ★ ★}) - z_{m}) (inf (F_{k + 1, m}^{★ ★ ★}) - z_{m})) \\ ((inf (F_{k, m}^{★ ★ ★}) - z_{m}) - (inf (F_{k + 1, m}^{★ ★ ★}) - z_{m}) + (sup (F_{k + 1, m}^{★ ★ ★}) - z_{m}) - (sup (F_{k, m}^{★ ★ ★}) - z_{m}) - 1) \\ ((inf (F_{k, m}^{★ ★ ★}) - z_{m}) - (inf (F_{k + 1, m}^{★ ★ ★}) - z_{m})) ((sup (F_{k + 1, m}^{★ ★ ★}) - z_{m}) - (sup (F_{k, m}^{★ ★ ★}) - z_{m})) \end{matrix}

(38)

criteria (1) is achieved, using eq. 37, when:

S^{'} (z, k) = \frac{1}{n} \sum_{m = 1}^{n} S (z, k, m)

(39)

such that, for all

k \in N

S^{'} (z, k) = 1

(40)

and criteria (2) is achieved, using eq. 35 and 38, when:

T^{'} (Z, k) = \frac{1}{n} \sum_{m = 1}^{n} T (z_{m}, k, m)

(41)

such that, for all

k \in N

T^{'} (Z, k) = 0

(42)

where we consider the following:

5.2. Question:

How do we create a choice function which solves the question in sec. 3.4 using

S^{'}

\bar{| S^{'} |}

\underset{̲}{| S^{'} |}

S^{'} (z, k)

, and

T^{'} (Z, k)

or equations 32, 33, 34, 39 and 41 resp.?

5.3. "Attempt" to answer the Question

(Note the attempt might be wrong but could offer hints to how the solution would appear).

Suppose

z = 1

and the chosen coordinate for the center of the universe (i.e., eq. 35) is the origin, where

z_{m} = 0

for all

m \in \{1, \cdot \cdot \cdot, n\}

\begin{matrix} Z = (z_{1}, z_{2}, \cdot \cdot \cdot, z_{n + 1}) \Rightarrow \\ Z = O = (\underset{n + 1 times}{\underset{︸}{0, 0, \cdot \cdot \cdot, 0}}) \end{matrix}

(43)

Using equations

S^{'}

\bar{| S^{'} |}

\underset{̲}{| S^{'} |}

S^{'} (z, k)

, and

T^{'} (Z, k)

(i.e., eq. 32, 33, 34, 39 and 41) with the absolute value function

| | \cdot | |

and the nearest integer function

[\cdot]

, we define:

\begin{matrix} K (ε, F_{k}^{★ ★ ★}) = \\ S^{'} (1, k) 5 (5 | 5 | \frac{| S^{'} | (1 + [\frac{| S^{'} | (\underset{̲}{| S^{'} |} + 2 | S^{'} |)}{(\underset{̲}{| S^{'} |} + | S^{'} |) (\underset{̲}{| S^{'} |} + | S^{'} | + \bar{| S^{'} |})}]) (1 + [\underset{̲}{| S^{'} |} / | S^{'} |])}{(1 + [| S^{'} | / \bar{| S^{'} |}]) (1 + [\underset{̲}{| S^{'} |} / \bar{| S^{'} |}])} - | S^{'} | 5 | 5 | + | S^{'} | 5) - T^{'} (O, k) \end{matrix}

(44)

where using

K (ε, F_{k}^{★ ★ ★})

, the choice function should be the following:

Theorem 8.

If we define:

M (ε, F_{k}^{★ ★ ★}) = | S^{'} (ε, F_{k}^{★ ★ ★}) | (K (ε, F_{k}^{★ ★ ★}) - | S^{'} (ε, F_{k}^{★ ★ ★}) |)

M (ε, F_{j}^{★ ★}) = | S^{'} (ε, F_{j}^{★ ★}) | (K (ε, F_{j}^{★ ★}) - | S^{'} (ε, F_{j}^{★ ★}) |)

where for

M (ε, F_{k}^{★ ★ ★})

, we define

M (ε, F_{k}^{★ ★ ★})

to be the same as

M (ε, F_{j}^{★ ★})

when swapping "

j \in N

" with "

k \in N

" (for eq. 33 & 34) and sets

F_{k}^{★ ★ ★}

with

F_{j}^{★ ★}

(for eq. 32–44), then for constant

v > 0

and variable

v^{*} > 0

, if:

\bar{S} (ε, k, v^{*}, F_{j}^{★ ★}) = inf (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \geq M (ε, F_{k}^{★ ★ ★}) \geq v^{*}\} \cup {v^{*}}) + v

(45)

and:

\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★}) = sup (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, v^{*} \leq M (ε, F_{j}^{★ ★}) \leq M (ε, F_{k}^{★ ★ ★})\} \cup {- v^{*}}) + v

(46)

then for all

{(F_{j}^{★ ★})}_{j \in N} \in S^{'} (G) ∖ \sim {(F_{k}^{★ ★ ★})}_{k \in N}

(§5.1, crit. 3), if:

\begin{matrix} \underset{ε \to 0}{lim inf} lim_{v^{*} \to \infty} lim_{k \to \infty} \frac{| S^{'} (ε, F_{k}^{★ ★ ★}) | + v}{\bar{S} (ε, k, v^{*}, F_{j}^{★ ★})} = \\ \underset{ε \to 0}{lim sup} lim_{v^{*} \to \infty} lim_{k \to \infty} \frac{| S^{'} (ε, F_{k}^{★ ★ ★}) | + v}{\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★})} = 0 \end{matrix}

(47)

we choose

{(F_{k}^{★ ★ ★})}_{k \in N}

satisfying eq. 47. (Note, we want

sup \emptyset = - \infty

inf \emptyset = + \infty

, and

{(F_{k}^{★ ★ ★})}_{k \in N}

to answer the main question of §3.4) where the answer to the focus2 is

E^{* *} [f, F_{k}^{★ ★ ★}]

in eq. 48—using def. 9 (when it exists):

\begin{matrix} \forall (ϵ > 0) \exists (N \in N) \forall (k \in N) (k \geq N \Rightarrow |\frac{1}{H^{h} (dom (F_{k}^{★ ★ ★}))} \int_{dom (F_{k}^{★ ★ ★})} f_{k}^{★} d H^{h} - E^{* *} [f, F_{k}^{★ ★ ★}]| < ϵ) \end{matrix}

(48)

Note 9

(Explanation of Theorem 8) . The theorem 8 is similar to the methods used in def. 20 crit. 0a and 0b—

\bar{α} (ε, r, ω, ψ)

and

\underset{̲}{α} (ε, r, ω, ψ)

—and def. 20 crit. 1 and crit. 3—linear/superlinear convergence—where:

sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim sup} \underset{r \to \infty}{lim sup} \bar{α} (ε, r, ω, ψ) = inf_{ω \in Ω} inf_{ψ \in Ψ_{ω}} \underset{ε \to 0}{lim inf} \underset{r \to \infty}{lim inf} \underset{̲}{α} (ε, r, ω, ψ) = 0

such that we replace:

\begin{matrix} E (D (S (U (ε, F_{r}^{★}, ω), ψ))) \mapsto M (ε, F_{k}^{★ ★ ★}) \\ E (D (S (U (ε, F_{j}^{★ ★}, ω), ψ))) \mapsto M (ε, F_{j}^{★ ★}) \\ |S (U (ε, F_{r}^{★}, ω), ψ))| \mapsto | S^{'} (ε, F_{j}^{★ ★}) | \\ sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \underset{̲}{|S (U (ε, F_{r}^{★}, ω), ψ)|} \mapsto \underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★}) \\ sup_{ω \in Ω} sup_{ψ \in Ψ_{ω}} \bar{|S (U (ε, F_{r}^{★}, ω), ψ)|} \mapsto \bar{S} (ε, k, v^{*}, F_{j}^{★ ★}) \end{matrix}

note the changes to def. 20, crit. 1 were made, so

M (ε, F_{k}^{★ ★ ★})

is "large enough" compared to

M (ε, F_{j}^{★ ★})

, with

{(F_{j}^{★ ★})}_{j \in N}

non-equivalent to

{(F_{k}^{★ ★ ★})}_{k \in N}

(e.g., when

A = Q

{(F_{k}^{★ ★ ★})}_{k \in N}

should be

{(\{c / k! : c \in N, 1 \leq c \leq k!\})}_{k \in N}

and never give

M (ε, F_{k}^{★ ★ ★})

which increases at a smaller rate than that of "small"

M (ε, F_{j}^{★ ★})

, e.g.:

{(F_{j}^{★ ★})}_{j \in N} = {(\{u / w : u \in Z, w \in N, w \leq j, - w \cdot j \leq u \leq w \cdot j\})}_{j \in N}

or smaller than that of "large"

M (ε, F_{j}^{★ ★})

; e.g.,

{(F_{j}^{★ ★})}_{j \in N} = {(\{u_{1} / (6 (j!)) : u_{1} \in Z, - 6 j \cdot j! \leq u_{1} \leq 6 j \cdot j!\})}_{j \in N}

Moreover, in

\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★})

and

\bar{S} (ε, k, v^{*}, F_{j}^{★ ★})

of thm. 8, we add constant

v > 0

and variable

v^{*} > 0

so if either

1.: $\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★}) - v = 0$ (i.e., using a related limit to eq. 47, division by zero is undefined).
2.: $\bar{S} (ε, k, v^{*}, F_{j}^{★ ★}) - v = 0$ (i.e., using a related limit to eq. 47, division by zero is undefined).
3.: $inf (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \geq M (ε, F_{k}^{★ ★ ★})\}) = + \infty$ (i.e., similar to $\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★})$ of eq. 45, with no variable $v^{*}$ such that $M (ε, F_{k}^{★ ★ ★}) = 0$ and $\exists (J > 0) \forall (j_{1} > 0) \exists (j \geq j_{1}) (M (ε, F_{j}^{★ ★}) \leq J)$ , where we apply a related limit to eq. 47 that’s undefined due to division by infinity.)
4.: $inf (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \geq M (ε, F_{k}^{★ ★ ★})\}) = \emptyset$ (i.e., similar to $\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★})$ of eq. 45, with no variable $v^{*}$ and $M (ε, F_{j}^{★ ★}) = 0$ , where we apply a related limit to eq. 47 that’s undefined since $inf (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \geq M (ε, F_{k}^{★ ★ ★})\})$ is an undefined empty set.)
5.: $sup (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \leq M (ε, F_{k}^{★ ★ ★})\}) = + \infty$ (i.e., similar to $\bar{S} (ε, k, v^{*}, F_{j}^{★ ★})$ of eq. 46, with no variable $v^{*}$ and $M (ε, F_{j}^{★ ★}) = 0$ , where we apply a related limit to eq. 47 that’s undefined due to division by infinity.)
6.: $sup (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \leq M (ε, F_{k}^{★ ★ ★})\}) = \emptyset$ (i.e., similar to $\underset{̲}{S} (ε, k, v^{*}, F_{j}^{★ ★})$ of eq. 45, with no variable $v^{*}$ and $M (ε, F_{k}^{★ ★}) = 0$ , where we apply a related limit to eq. 47 that’s undefined since $inf (\{| S^{'} (ε, F_{j}^{★ ★}) | : j \in N, M (ε, F_{j}^{★ ★}) \geq M (ε, F_{k}^{★ ★ ★})\})$ is an undefined empty set.)
7.: $| {z : j, z \in N, M (ε, F_{j + z}^{★ ★}) \leq M (ε, F_{j}^{★ ★})} | = + \infty$ (i.e., infinite number succeeding $F_{j}$ are smaller than original $F_{j}$ , where such $F_{j}$ should be eliminated).

the limit in eq. 47 still exists.

5.4. Question:

How do we use mathematica code to illustrate §4 and 5?

References

Krishnan, B. Mean of Unbounded Sets Using Method Similar To Conditional Expectation. ResearchGate. http://xxx.lanl.gov/abs/https://www.researchgate.net/publication/376597571_Mean_Of_Unbounded_Sets_Using_Conditional_Expectation_No_Programming_Just_Condensed_Version.
Ott, W.; Yorke, J.A. Prevelance. Bulletin of the American Mathematical Society 2005, 42, 263–290. https://www.ams.org/journals/bull/2005-42-03/S0273-0979-05-01060-8/S0273-0979-05-01060-8.pdf. [CrossRef]
John, R. Outlier. https://en.m.wikipedia.org/wiki/Outlier.
Emily. How do computers draw function graphs? Mathematics Stack Exchange. https://math.stackexchange.com/q/634338. https://math.stackexchange.com/q/634338.
M., G., 2nd ed.; Springer New York: New York [America], 2011; pp. 61–95. https://ee.stanford.edu/~gray/it.pdf. [CrossRef]
E., B.; M., E. Integration with Filters. https://arxiv.org/pdf/2004.09103.pdf.
Mathe. Mean of a function in Rn. Matchmaticians. https://matchmaticians.com/storage/answer/101942/matchmaticians-7gatrd-file-1.pdf https://matchmaticians.com/storage/answer/101942/matchmaticians-7gatrd-file-1.pdf.
B., B.; A., F. Analogues Of The Lebesgue Density Theorem For Fractal Sets Of Reals And Integers. https://www.ime.usp.br/~afisher/ps/Analogues.pdf.
B., B.; A., F. Ratio Geometry, Rigidity And The Scenery Process For Hyperbolic Cantor Sets. https://arxiv.org/pdf/math/9405217.pdf.
Corrao, G. AN HENSTOCK-KURZWEIL TYPE INTEGRAL ON A MEASURE METRIC SPACE. https://core.ac.uk/download/pdf/53287889.pdf.

1	We want to find an unique and "natural" extension of the expected value, w.r.t the Hausdorff measure on bounded functions to other bounded/unbounded f, that takes finite values for all f in a non-shy subset of $B^{*}$ (def. 7)
2	We want to find an unique and "natural" extension of the expected value, w.r.t the Hausdorff measure on bounded functions to other bounded/unbounded f, that takes finite values for all f in a non-shy subset of $B^{*}$ (def. 7)

Figure 1. Below

F_{r}^{★}

F_{k}^{★ ★}

F_{z}^{★ ★ ★}

are non-equivalent starred sequences of sets, where

V^{'}

is all circles and

E^{* *}

is the generalized expected value of f w.r.t either ★-sequence of sets (def. 8)

Figure 1. Below

F_{r}^{★}

F_{k}^{★ ★}

F_{z}^{★ ★ ★}

are non-equivalent starred sequences of sets, where

V^{'}

is all circles and

E^{* *}

is the generalized expected value of f w.r.t either ★-sequence of sets (def. 8)

Figure 2. Below

F_{r}^{★}

F_{k}^{★ ★}

F_{z}^{★ ★ ★}

are equivalent starred sequences of sets, where

V^{'}

is the entire circle and

E^{* *}

is the generalized expected value of f w.r.t either ★-sequence of sets (def. 8)

Figure 2. Below

F_{r}^{★}

F_{k}^{★ ★}

F_{z}^{★ ★ ★}

are equivalent starred sequences of sets, where

V^{'}

is the entire circle and

E^{* *}

is the generalized expected value of f w.r.t either ★-sequence of sets (def. 8)

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

MDPI Initiatives

Important Links

Choose an area of interest and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

Finding an Unique and “Natural” Extension of the Expected Value That Is Finite for All Functions in Non-Shy Subset of the Set of All Measurable Functions

Abstract

1. Introduction

2. Preliminary Definitons/Motivation

2.1. Preliminary Definitions

2.2. Extended Expected Values

2.3. Examples

3. Attempt to Answer Thesis

3.1. Equivalent and Non-Equivalent ★-sequences of Sets

3.1.1. Question 1

3.1.2. Possible Answer

3.2. Motivation For Sec. 3.4

3.3. Essential Definitions for a "Natural" Expected Value

3.4. Main Question

4. Solution To The Main Question Of Section 2.4

4.1. Preliminary Definitions

5. Attempt to Answer Main Question Of Section 2.4

5.1. Choice Function

5.2. Question:

5.3. "Attempt" to answer the Question

5.4. Question:

References

MDPI Initiatives

Important Links

Subscribe