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

Preprint

Concept Paper

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

Altmetrics

Downloads

916

Views

269

Comments

Bharath Krishnan^*

This version is not peer-reviewed

Submitted:

13 December 2023

Posted:

15 December 2023

Read the latest preprint version here

Alerts

Abstract

Suppose for

Keywords:

Subject: Computer Science and Mathematics - Analysis

0. Introduction

According to an article in Quanta Magazine [3] Wood writes, "No known mathematical procedure can meaningfully average an infinite number of objects covering an infinite expanse of space in general. The path integral is more of a physics philosophy than an exact mathematical recipe." The cited paper [6] presents a constructive approach to Wood’s statement using filters over families of finite set; however, the average in the approach is not unique: the method determines the average value of functions with a range that lies in any algebraic structure for which the finite averages make sense. In this paper, we will explore a more constructive approach where the average is unique, finite, and "natural" (defined in

§

2.3 &

§

2.4) for a non-shy subset [11] of the set of measurable functions. (Note the functions must be measurable for application purposes).

We begin by describing "the infinite objects" which cover "an infinite expanse of space" as unbounded functions, since these functions are approachable from a mathematical standpoint. Moreover, if we define

n \in N

, where set

A \subseteq R^{n}

and function

f : A \to R

; suppose a prevalent subset of a function-space means "almost all" functions are in that space, a shy subset of a function-space means "almost no" functions are in that space and

B^{*}

is the set of all Borel measurable functions in

R^{A}

. We then get the set of unbounded f where the expected value is infinite or undefined, forms a non-shy (i.e., prevalent nor shy or prevelant) subset of

B^{*}

. Furthermore, the set of all f with a finite expected value forms only a shy subset of

B^{*}

, meaning only a "negligible" amount of measurable functions have finite expected values.

Therefore, when defining prevalent and shy sets using mathematics in

§

1.1; we’ll define four attempts to answer the thesis 1 of the first paragraph of

§

1.2. Note neither attempts give complete answers: they extend the Hausdorff measure of A to be positive and finite for "most" subsets of

R^{n}

but don’t guarantee that unbounded functions in a non-shy subset of measurable functions have finite expected values. Infact, the expected value from all attempts might be positive and finite for only a shy subset of

B^{*}

Hence, we define a sequence of sets called ★-sequence of sets (def. 8) whose properties allow for finite expected values for a non-shy subset of

M^{*}

. Note these ★-sequences of sets converge to the graph of f i.e.

\{(x, f (x)) : x \in A\}

rather than A; otherwise, the generalized expected value of f w.r.t to a ★-sequence (def. 9) cannot, in general, be finite for unbounded functions. Moreover, since there are functions with multiple ★-sequences of sets, where generalized expected values of f w.r.t each ★-sequence are different and non-unique—we must have a choice function which chooses a unique set of equivalent ★-sequences with the same, unique expected value.

For defining the choice function, we ask a question in

§

2.4 where with previous sections; we define equivalent & non-equivalent ★-sequences of sets for

§

2.1, as well as "natural" expected values for

§

2.3. We attempt to answer the question in

§

2.4 by redefining linear/super-linear convergence (def. 12) 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. Since all samples have finite points; we take a "pathway" of line segments between points in the sample, where in def. 15 we exclude segments with "extra-large" proportion to a chosen measure for each partition of ★-sequence of sets). The procedure is similar to the ones used in computers to graph functions [7]. 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 [9] w.r.t all "pathways" to redefine def. 12 as def. 16 such redefined definition is used to create a choice function in

§

4.1.

1. 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:

1.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.1.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)}

(1.1.2)

when

α \in N

and E is a Borel set we have that

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

(1.1.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}

(1.1.4)

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

Theorem 1.

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

Notes 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 sigma-algebra of the Hausdorff measure. (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 [11].

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

§

1.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 2.

The expected value

E [f]

is finite for all f in only a shy subset of

B^{*}

Note 4

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

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

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 setAwith 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 overA) letPdenote the one-dimensional subspace of

L^{0} (A)

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

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

(measurable functions overAwith no finite integral)

λ_{P}

denotes the Lebesgue measure over P, for any fixed

f \in F

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

MeaningPis a 1-dimensional probe ofF, soFis a 1-prevalent set. (In other terms, the set of measurable functions overAwith 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}

1.2. Extended Expected Values

Four solutions to getting a finite expected value for "larger" subset of

R^{A}

is:

(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 [1] which is an extension of the Lebesgue density theorem and this paper [2] 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 [5], 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.

1.3. Examples

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}$

(1.3.1)

$\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}$

(1.3.2)

$\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}$

(1.3.3)

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}$

(1.3.4)

For instance, point

(1 / 4, 1)

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, 0)

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. 1.3.4 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

§

1.2, crit. 1.2, there is no (exact) dimension function of A nor could A be "fractal" enough for extensions of the Lebesgue Density Theorem [1], extensions of the Hausdorff measure using Hyperbolic Cantor Sets [2], or extension of the Henstock-Kurzweil integral on the Metric Space [5].

2. 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 (

§

1.2, crit. 1.2) where h is the dimension function, and

B^{*}

is the set of all Borel measurable functions in

R^{A}

Definition 8

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

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

, where h is the dimension function, then when:

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

$\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 as:

$\{(x, f (x)) : x \in A\}$

the set-theoretic limit should be:

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

$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, f_{r}^{★} (x)) : x \in dom (F_{r}^{★})\} = F_{r}^{★}$

we have

(F_{r}^{★})

is a ★-sequence of setsorstarred-sequence of sets .

Example 8.1.

One ★-sequence of sets of

f (x) = 1 / x

R ∖ {0}

(

§

1.3, crit. 1.3) is:

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

Example 8.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}

(2.0.1)

using (

§

1.3, crit. 1.3) 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}

(2.0.2)

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}

(2.0.3)

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

R^{A}

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}

(2.0.4)

Example 9.1.

Using example 8.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}

$dom (F_{r}^{★}) = {([- r, - 1 / r] \cup [1 / r, r])}_{r \in N}$
$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}

(2.0.5)

\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}

(2.0.6)

\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}

(2.0.7)

\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}

(2.0.8)

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

(2.0.9)

\begin{matrix} 0 \end{matrix}

(2.0.10)

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

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

Next, we define set

V^{'}

, where we want the generalized expected value to exist for all

f \in V^{'}

w.r.t at least one sequence (in a set of ★-sequences of sets) where

Definition 10

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

f \in V^{'}

, where the generalized expected values of f w.r.t each starred-sequence of sets has two or more different values; e.g., defined vs undefined values.

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).

Definition 11

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

f \in V^{'}

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

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).

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

2.1.1. Question 1

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

2.2. Motivation for Question

For all f in a non-shy subset of

B^{*}

(def. 7), we may choose a ★-sequence of sets

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

where the generalized expected value of f w.r.t least one starred-sequence is finite. However, consider the following problem:

Theorem ;3.

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 also "natural" and unique:

2.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 & 10): we have the following is essential for a "natural" expected value.

Definition 12

(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, j \in N

such that:

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

where we have

O

as the Big-O notation and

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

, then

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

converges to the graph of f:

\{(x, f (x)) : x \in A\}

at alinear 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 2.

2.4. Main Question

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

(a): The chosen starred-sequences of sets converge to $\{(x, f (x)) : x \in A\}$ at a rate linear or super-linear (def. 12) to the rate non-equivalent ★-sequences of sets converge to $\{(x, f (x)) : x \in A\}$
(b): The generalized expected value (def. 9) of f w.r.t the chosen (and equivalent) starred-sequences of sets 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)?

Notes 6

[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}^{★ ★ ★}]

(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}

(2.4.1)

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”.)

3. Solution To The Main Question Of Section 2.4

Suppose h is the dimension function,

H^{h}

is the h-Hausdorff measure (

§

1.2, crit. 1.2), and

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

is the starred-sequence of sets (def. 8). We will use an alternative approach to definition 12 or def. 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

§

0 for a summary. Also, refer to sec. 3 and 4 of [8] for examples: (the cited paper uses sets instead of functions).

3.1. Preliminary Definitions

Definition 13

(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}

(3.1.1)

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 14

(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. 13). 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}

(3.1.2)

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 15

(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. 14), we:

(a)

Take a "pathway" of line segments between all points in each sample (def. 14), 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 anomaly [4] of

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

In other words:

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 1d.

(v)

Combining everything in

()

, we ultimately want all lengths between every point in the "pathway" (def. 14) satisfying crit. 1d. 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. 15, crit. 1e, 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}

(3.1.3)

(c)

Take the entropy of (2), (for further reading, see [9]). 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

(3.1.4)

(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}

(3.1.5)

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

F_{r}^{★}

Definition 16

(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 aconstant

ε \in range (H^{h})

greater than zero and variable

r \in N

, we say:

Using def. 14 and 15, 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}$

(3.1.6)

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

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

(3.1.7)
From def. 14 and 15, 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}$

(3.1.8)

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

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

(3.1.9)

(1)

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 ratesuperlinearto that of

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

(2)

If using equations

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

and

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

(where we swap

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

\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 ratesublinearto that of

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

(3)

If using equations

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

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

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

, and

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

(such for the two latter, we swap

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

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

and

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

with

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

) we haveboth:

$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
$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 ratelinearto that of

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

4. Attempt to Answer Main Question Of Section 2.4

4.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 $§$ 2.4
(2): $S^{'} (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^{'} (A)$ butnotan element in the set of equivalent starred-sequences of sets (def. 11) of ${(F_{k}^{★ ★ ★})}_{k \in N}$ where using note Section 2.4, we can represent this criteria as:

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

(4.1.1)

Further note, from def. 16, 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}

(4.1.2)

and from def. 16, 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}

(4.1.3)

Then, when we write def. 14, eq. 4.1.2 and eq. 4.1.3 as:

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

(4.1.4)

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

(4.1.5)

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

(4.1.6)

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

F_{k}^{★ ★ ★}

when

(1)

For all

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

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

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

(i.e.,

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

—where, unlike cit.[8], we focus on the domain of

F_{k}^{★ ★ ★}

to get "

n - 1

" instead of "n"), then when

z > 0

, we either want:

$sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = z$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = - z$ .
$sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = 0$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = - z$ .
$sup (F_{k + 1, m}^{★ ★ ★}) - sup (F_{k, m}^{★ ★ ★}) = z$ and $inf (F_{k + 1, m}^{★ ★ ★}) - inf (F_{k, m}^{★ ★ ★}) = 0$ .
$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}

, where:

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

(4.1.7)

then for all

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

, 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}) \in F_{k}^{★ ★ ★}

(again, unlike cit.[8], we focus on the domain of

F_{k}^{★ ★ ★}

to get "

n - 1

" instead of "n"), we must get:

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

(4.1.8)

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}) \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}

(4.1.9)

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}

(4.1.10)

criteria (4.1) is achieved, using eq. 4.1.9, when:

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

(4.1.11)

such that, for all

k \in N

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

(4.1.12)

and criteria (4.1) is achieved, using eq. 4.1.7 and 4.1.10, when:

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

(4.1.13)

such that, for all

k \in N

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

(4.1.14)

where we consider the following:

4.2 Question:

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

S^{'}

\bar{| S^{'} |}

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

S^{'} (z, k)

, and

T^{'} (Z, k)

or equations 4.1.4, 4.1.5, 4.1.6, 4.1.11 and 4.1.13 resp.?

4.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. 4.1.7) 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}) \Rightarrow \\ O = (\underset{n times}{\underset{︸}{0, 0, \cdot \cdot \cdot, 0}}) \end{matrix}

(4.3.1)

Using equations

S^{'}

\bar{| S^{'} |}

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

S^{'} (z, k)

, and

T^{'} (Z, k)

(i.e., eq. 4.1.4, 4.1.5, 4.1.6, 4.1.11 and 4.1.13) with 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}

(4.3.2)

where using

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

, the choice function should be the following:

Theorem 4.

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. & ) and sets

F_{k}^{★ ★ ★}

with

F_{j}^{★ ★}

(for eq. 4.1.4–4.3.2), 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

(4.3.3)

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

(4.3.4)

then for all

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

(

§

4.1, crit.4.1), 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}

(4.3.5)

we choose

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

satisfying eq. 4.3.5. (Note, we want

sup \emptyset = - \infty

inf \emptyset = + \infty

, and

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

to answer the main question of

§

2.4) where the answer to the focus3 is

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

in eq. (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}

(4.3.6)

[Explanation of Theorem 4] The theorem 4 is similar to the methods used in def. 16 crit. aa and ab or

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

and

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

and def. 16 crit. b, 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. 16, crit. b 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}^{★ ★ ★})

smaller than "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 larger than "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. 4, 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. 4.3.5, division by zero is undefined).
(2): $\bar{S} (ε, k, v^{*}, F_{j}^{★ ★}) - v = 0$ (i.e., using a related limit to eq. 4.3.5, 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. 4.3.3, 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. 4.3.5 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. 4.3.3, with no variable $v^{*}$ and $M (ε, F_{j}^{★ ★}) = 0$ , where we apply a related limit to eq. 4.3.5 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. 4.3.4, with no variable $v^{*}$ and $M (ε, F_{j}^{★ ★}) = 0$ , where we apply a related limit to eq. 4.3.5 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. 4.3.3, with no variable $v^{*}$ and $M (ε, F_{k}^{★ ★}) = 0$ , where we apply a related limit to eq. 4.3.5 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. 4.3.5 still exists.

4.4 Question:

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

References

Bedford, B.; Fisher, A. Analogues of the lebesgue density theorem for fractal sets of reals and integers. https://www.ime.usp.br/~afisher/ps/Analogues.pdf.
Bedford, B.; Fisher, A. Ratio geometry, rigidity and the scenery process for hyperbolic cantor sets. https://arxiv.org/pdf/math/9405217.pdf.
Wood, C. Mathematicians prove 2d version of quantum gravity really works. Quanta Magazine. https://www.quantamagazine.org/mathematicians-prove-2d-version-of-quantum-gravity-really-works-20210617/. Quanta Magazine, 2021. [Google Scholar]
Varun Chandola, Arindam Banerjee, and Vipin Kumar. Anomaly detection: A survey. ACM Comput. Surv. 2009; 41, jul 2009. [CrossRef]
Giuseppa Corrao. An henstock-kurzweil type integral on a measure metric space. https://core.ac.uk/download/pdf/53287889.pdf.
Bottazi, E. and Eskew M. Integration with filters. https://arxiv.org/pdf/2004.09103.pdf.
Emily. How do computers draw function graphs? Mathematics Stack Exchange. https://math.stackexchange.com/q/634338.
Bharath Krishnan. Mean of unbounded sets using method similar to conditional expectation. ResearchGate. https://www.researchgate.net/publication/373486897_Mean_Of_Unbounded_Sets_Using_A_Method_Similar_To_Conditional_Expectation.
Gray, M. Springer New York, New York [America];, 2 edition, 2011. https://ee.stanford.edu/~gray/it.pdf.
Mathe. Mean of a function in rn. Matchmaticians. https://matchmaticians.com/storage/answer/101942/matchmaticians-7gatrd-file-1.pdf.
William, O.; James, A.Y. Prevelance. Bulletin of the American Mathematical Society 2005, 42, 263–290. [Google Scholar]

1	We want to find an unique and "natural" extension of the expected value, w.r.t the Hausdorff measure, that takes finite values for all f in a non-shy subset of all Borel measurable functions in $R^{A}$
2	We want to find unique and "natural" extension of the expected value, w.r.t the Hausdorff measure, that takes finite values for all f in a non-shy subset of all Borel measurable functions in $R^{A}$
3	We want to find an unique and "natural" extension of the expected value, w.r.t the Hausdorff measure, that takes finite values for all f in a non-shy subset of all Borel measurable functions in $R^{A}$

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.

© 2023 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 Takes a Finite Value for All Functions in Non-Shy Subset of the Set of All Functions

Abstract

0. Introduction

1. Preliminary Definitons/Motivation

1.1. Preliminary Definitions

1.2. Extended Expected Values

1.3. Examples

2. Attempt to Answer Thesis

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

2.1.1. Question 1

2.2. Motivation for Question

2.3. Essential Definitions for a "Natural" Expected Value

2.4. Main Question

3. Solution To The Main Question Of Section 2.4

3.1. Preliminary Definitions

4. Attempt to Answer Main Question Of Section 2.4

4.1 Choice Function

4.2 Question:

4.3 "Attempt" to answer the Question

4.4 Question:

References

MDPI Initiatives

Important Links

Subscribe