Proofs Section 1.2 (Mixtures, Updates, Pushforwards)

The previous proofs are here.

Proposition 5: If $B^{min} \subseteq M^{a} (X)$ , then the condition "there is a $λ^{⊙}$ where, $\forall (λ μ, b) \in B^{min} : λ \leq λ^{⊙}$ " is equivalent to "there is a compact $C$ s.t. $B^{min} \subseteq C$ "

Proof sketch: One direction is immediate from the Compactness Lemma. For showing that just a bound on the $λ$ values suffices to be contained in a compact set, instead of a bound on the $λ$ and $b$ values to invoke the Compactness Lemma, we use a proof by contradiction where we can get a bound on the $b$ values of the minimal points from just a bound on the $λ$ values.

Proof: In one direction, assume there's a compact $C$ s.t. $B^{min} \subseteq C$ , and yet there's no upper-bounding $λ^{⊙}$ on the $λ$ values. This is impossible by the Compactness Lemma, since $(λ μ)^{+} (1) = λ μ^{+} (1) = λ μ (1) = λ$ .

In the other direction, assume there's a $λ^{⊙}$ bound on $λ$ for the minimal points. Fix some arbitrary $(λ μ, b) \in B^{min}$ for the rest of the proof. Now, we will show that all minimal points $(λ^{'} μ^{'}, b^{'}) \in B^{min}$ have $λ^{'} \leq λ^{⊙}$ , and $b^{'} \leq λ^{⊙} + b,$ letting us invoke the Compactness Lemma to get that everything is in a suitable compact set $C$ . The first bound is obvious. Since $λ^{'}$ came from a minimal point, it must have $λ^{⊙}$ as an upper bound.

For the other one, by contradiction, let's assume that there's a minimal point $(λ^{'} μ^{'}, b^{'})$ where $b^{'} > λ^{⊙} + b$ . Then, we can write $(λ^{'} μ^{'}, b^{'})$ as: $(λ μ, b) + (- λ μ, λ^{⊙}) + (λ^{'} μ^{'}, b^{'} - λ^{⊙} - b)$

The first component, $(λ μ, b)$ is our fixed minimal point of interest. The second component is an sa-measure, because $λ^{⊙} - λ \geq 0$ , due to the $λ^{⊙}$ upper bound on the $λ$ value of minimal points. The third component is also a nonzero sa-measure, because $λ^{'}$ is nonnegative (it came from a minimal point), and by assumption, $b^{'} > λ^{⊙} + b$ . Hang on, we wrote a minimal point $(λ^{'} μ^{'}, b^{'})$ as another minimal point $(λ μ, b)$ , plus two sa-measures (one of which is nonzero), so $(λ^{'} μ^{'}, b^{'})$ can't be minimal, and we have a contradiction.

Therefore, all $(λ^{'} μ^{'}, b^{'}) \in B^{min}$ have $b^{'} \leq λ^{⊙} + b$ . Now that we have bounds on $λ$ and $b$ for minimal points, we can invoke the Compactness Lemma to conclude that everything is in a compact set.

Proposition 6: $E_{B} (0) = E_{B} (1)$ only occurs when there's only one minimal point of the form $(0, b)$ .

Proof: Unpacking the expectations, and in light of Proposition 3,

$E_{B} (1) = {inf}_{(λ μ, b) \in B^{min}} (λ μ (1) + b) = {inf}_{(λ μ, b) \in B^{min}} (λ + b)$ and $E_{B} (0) = {inf}_{(λ μ, b) \in B^{min}} (λ μ (0) + b) = {inf}_{(λ μ, b) \in B^{min}} b$

So, take a minimal a-measure $(λ μ, b)$ that minimizes $λ + b$ . One must exist because we have $λ$ and $b$ bounds, so by the Compactness Lemma, we can restrict our attention to an actual compact set, and continuous functions from a compact set to $R$ have a minimum, so there's an actual minimizing minimal point.

$λ$ must be 0, because otherwise $E_{B} (1) = λ + b > b \geq E_{B} (0)$ which contradicts $E_{B} (1) = E_{B} (0)$ . Further, since $b = λ + b = E_{B} (1) = E_{B} (0)$ , said $b$ must be the lowest $b$ possible amongst minimal points.

So, we have a minimal point of the form $(0, b)$ where $b$ is the lowest possible $b$ amongst the minimal points. Any other distinct minimal point must be of the form $(λ^{'} μ^{'}, b^{'})$ , where $b^{'} \geq b$ . This other minimal point can be written as $(0, b) + (λ^{'} μ^{'}, b^{'} - b)$ , where the latter component is an sa-measure, so it's not minimal. Thus, there's only one minimal a-measure and it's of the form $(0, b)$ .

Proposition 7: Renormalizing a bounded inframeasure produces a bounded infradistribution, if renormalization doesn't fail.

Proof sketch: Our first order of business is showing that our renormalization process doesn't map anything outside the cone of sa-measures. A variant of this argument establishes that the preimage of a minimal point in $B^{R}$ must be a minimal point in $B$ , which quickly establishes positive-minimals and bounded-minimals for $B^{R}$ . Then, we verify the other conditions of a bounded infradistribution. Nonemptiness, closure, and convexity are very easy, upper-closure is shown by adding appropriately-scaled sa-measures such that, after renormalization, they hit whatever sa-measure you want. Then, finally, we just have to verify that our renormalization procedure is the right one to use, that it makes $E_{B^{R}} (1) = 1$ and $E_{B^{R}} (0) = 0$ .

Proof: First up, we need to show that after renormalization, nothing gets mapped outside the cone of sa-measures. Observe that the renormalization process is injective. If two points are distinct, after a scale-and-shift, they'll still be distinct.

Let B be our original set and $B^{R}$ be our renormalized set. Take a point in $B^{R}$ , given by $(m, b)$ . Undoing the renormalization, we get $(E_{B} (1) - E_{B} (0)) (m, b) + (0, E_{B} (0)) \in B$ .

By decomposition into a minimal point and something else via Theorem 2, we get that

$(E_{B} (1) - E_{B} (0)) (m, b) + (0, E_{B} (0)) = (m^{min}, b^{min}) + (m^{*}, b^{*})$

where $(m^{min}, b^{min}) \in B^{min}$ . Renormalizing back, we get that

$(m, b) = \frac{1}{E_{B} (1) - E_{B} (0)} ((m^{min}, b^{min} - E_{B} (0)) + (m^{*}, b^{*}))$

$b^{'} \geq E_{B} (0)$ , obviously, because $E_{B} (0)$ is the minimal $b$ value amongst the minimal points. So, the first component is an a-measure, the second component is an sa-measure, so adding them is an sa-measure, and then we scale by a nonnegative constant, so $(m, b)$ is an sa-measure as well.

This general line of argument also establishes positive-minimals and bounded-minimals, as we'll now show. If the $(m^{*}, b^{*})$ isn't 0, then we just wrote $(m, b)$ as

$\frac{1}{E_{B} (1) - E_{B} (0)} (m^{min}, b^{min} - E_{B} (0)) + \frac{1}{E_{B} (1) - E_{B} (0)} (m^{*}, b^{*})$

And the first component lies in $B^{R}$ , but the latter component is nonzero, witnessing that $(m, b)$ isn't minimal. So, if $(m, b)$ is minimal in $B^{R}$ , then $(m^{*}, b^{*}) = 0$ , so it must be the image of a single minimal point $(m^{min}, b^{min}) \in B^{min}$ by injectivity. Ie, the preimage of a minimal point in $B^{R}$ is a minimal point in $B$ .

Scale-and-shift maps a-measures to a-measures, showing positive-minimals, and the positive scale constant of $(E_{B} (1) - E_{B} (0))^{- 1}$ just scales up the $λ^{⊙}$ upper bound on the $λ$ values of the minimal points in $B$ , showing bounded-minimals.

For the remaining conditions, nonemptiness, closure, and convexity are trivial. We're taking a nonempty closed convex set and doing a scale-and-shift so it's nonempty closed convex.

Time for upper-completeness. Letting $B$ be our original set and $B^{R}$ be our renormalized set, take a point $M^{R} + M^{*}$ in $(B^{R})^{u c}$ . By injectivity, $M^{R}$ has a single preimage point $M \in B$ . Undoing the renormalization by multiplying by $E_{B} (1) - E_{B} (0)$ (our addition of $E_{B} (0)$ is paired with $B^{R}$ to undo the renormalization on that one), consider $M + (E_{B} (1) - E_{B} (0)) M^{*}$ This lies in $B$ by upper-completeness, and renormalizing it back produces $M^{R} + M^{*}$ , which is in $B^{R}$ , so $B^{R}$ is upper-complete.

That just leaves showing that after renormalizing, we're normalized.

$E_{B^{R}} (1) = {inf}_{(λ μ, b) \in B^{R}} (λ + b) = {inf}_{(λ^{'} μ^{'}, b^{'}) \in B} \frac{1}{E_{B} (1) - E_{B} (0)} (λ^{'} + b^{'} - E_{B} (0))$

$= \frac{1}{E_{B} (1) - E_{B} (0)} ({inf}_{(λ^{'} μ^{'}, b^{'}) \in B} (λ^{'} + b^{'}) - E_{B} (0)) = \frac{E_{B} (1) - E_{B} (0)}{E_{B} (1) - E_{B} (0)} = 1$

For the other part,

$E_{B^{R}} (0) = {inf}_{(λ μ, b) \in B^{R}} b = {inf}_{(λ^{'} μ^{'}, b^{'}) \in B} \frac{1}{E_{B} (1) - E_{B} (0)} (b^{'} - E_{B} (0))$

$= \frac{1}{E_{B} (1) - E_{B} (0)} ({inf}_{(λ^{'} μ^{'}, b^{'}) \in B} b^{'} - E_{B} (0)) = \frac{E_{B} (0) - E_{B} (0)}{E_{B} (1) - E_{B} (0)} = 0$

And we're done.

Lemma 6: $g_{*}$ is a continuous linear operator.

Proof sketch: First show linearity, then continuity, for the operator that just maps a signed measure through $g$ , using some equation-crunching and characterizations of continuity. Then, since $g_{*}$ is just the pair of that and the identity function, it's trivial to show that it's linear and continuous.

We'll use $g_{*}^{'}$ to refer to the function $M^{\pm} (X) \to M^{\pm} (Y)$ defined by $(g_{*}^{'} (m)) (Z) = m (g^{- 1} (Z))$ , where $Z$ is a measurable subset of $Y$ and $g \in C (X, Y)$ . Ie, this specifies what the measure $g_{*}^{'} (m)$ is in terms of telling you what value it assigns to all measurable subsets of $Y$ .

We'll use $g_{*}$ to refer to the function $M^{\pm} (X) \oplus R \to M^{\pm} (X) \oplus R$ given by $g_{*} (m, b) = (g_{*}^{'} (m), b)$ .

Our first order of business is establishing the linearity of $g_{*}^{'}$ . Observe that, for all measurable $Z \subseteq Y$ , and $a, a^{'}$ being real numbers, and $m, m^{'}$ being signed measures over $X$ ,

$(g_{*}^{'} (a m + a^{'} m^{'})) (Z) = (a m + a^{'} m^{'}) (g^{- 1} (Z)) = a m (g^{- 1} (Z)) + a^{'} m^{'} (g^{- 1} (Z))$

$= a g_{*}^{'} (m) (Z) + a^{'} g_{*}^{'} (m^{'}) (Z) = (a g_{*}^{'} (m) + a^{'} g_{*}^{'} (m^{'})) (Z)$

So, $g_{*}^{'} (a m + a^{'} m^{'}) = a g_{*}^{'} (m)) + a^{'} g_{*}^{'} (m^{'})$ and we have linearity of $g_{*}^{'}$ .

Now for continuity of $g_{*}^{'}$ . Let $m_{n}$ limit to $m$ . The sequence $g_{*}^{'} (m_{n})$ converging to $g_{*}^{'} (m)$ in our metric on $M^{\pm} (Y)$ is equivalent to: $\forall f \in C (Y) : {lim}_{n \to \infty} g_{*}^{'} (m_{n}) (f) = g_{*}^{'} (m) (f)$

So, if $g_{*}^{'} (m_{n})$ fails to converge to $g_{*}^{'} (m)$ , then there is some continuous function $f \in C (Y)$ that witnesses the failure of convergence. But, because $g$ is a continuous function $X \to Y$ , then $f \circ g \in C (X)$ , and also $m_{n} (f \circ g) = g_{*}^{'} (m_{n}) (f)$ , so:

${lim}_{n \to \infty} g_{*}^{'} (m_{n}) (f) = {lim}_{n \to \infty} m_{n} (f \circ g) = m (f \circ g) = g_{*}^{'} (m) (f)$

The key step in the middle is that $m_{n}$ limits to $m$ , so $m_{n} (f \circ g)$ limits to $m (f \circ g)$ , by our characterization of continuity. Thus, we get a contradiction, our $f$ that witnesses the failure of convergence actually does converge. Therefore, $g_{*}^{'} (m_{n})$ limits to $g_{*}^{'} (m)$ if $m_{n}$ limits to $m$ , so $g_{*}^{'}$ is continuous.

To finish up, continuity for $g_{*}$ comes from the product of two continuous functions being continuous ( $g_{*}^{'}$ which we showed already, and $i d_{R}$ because duh), and linearity comes from:

$g_{*} (a (m, b) + a^{'} (m^{'}, b^{'})) = g_{*} (a m + a^{'} m^{'}, a b + a^{'} b^{'}) = (g_{*}^{'} (a m + a^{'} m^{'}), a b + a b^{'})$

$= (a g_{*}^{'} (m) + a^{'} g_{*}^{'} (m), a b + a b^{'}) = a (g_{*}^{'} (m) + b) + a^{'} (g_{*}^{'} (m^{'}) + b^{'}) = a g_{*} (m, b) + a^{'} g_{*} (m^{'}, b^{'})$

Proposition 8: If $f \in C (X, [0, 1])$ and $g$ is a continuous function $X \to Y$ , then $E_{g_{*} (H)} (f) = E_{H} (f \circ g)$

$E_{g_{*} (H)} (f) = {inf}_{(m, b) \in (g_{*} (H))} (m (f) + b) = {inf}_{(m, b) \in H} (g_{*}^{'} (m) (f) + b)$

$= {inf}_{(m, b) \in H} (m (f \circ g) + b) = E_{H} (f \circ g)$

Proposition 9: $g_{*} (H)$ is a (bounded) inframeasure if $H$ is, and it doesn't require upper completion if $g$ is surjective.

Proof sketch: Nonemptiness is obvious, and showing that it maps sa-measures to sa-measures is also pretty easy. Closure takes a rather long argument that the image of any closed subset of sa-measures over $X$ , through $g_{*}$ , is closed, which is fairly tedious. We may or may not invoke upper completion afterwards, but if we do, we can just appeal to the lemma that the upper completion of a closed set is closed. Convexity is immediate from linearity of $g_{*}$ .

For upper completion, we can just go "we took the upper completion" if $g$ isn't surjective, but we also need to show that we don't need to take the upper completion if $g$ is surjective, which requires crafting a measurable inverse function to g via the Kuratowski-Ryll-Nardzewski selection theorem, in order to craft suitable preimage points.

Then we can use LF-Duality to characterize the induced $h$ function, along with Proposition 8, which lets us get positive-minimals, bounded-minimals, and normalization fairly easily, wrapping up the proof.

Proof: Nonemptiness is obvious. For showing that it takes sa-measures to sa-measures, take an $(m, b) \in H$ , and map it through to get $(g_{*}^{'} (m), b) \in g_{*} (H)$ . $(m, b)$ is an sa-measure, so $b + m^{-} (1) \geq 0$ . Now, we can use Lemma 5 to get:

$b + (g_{*}^{'} (m))^{-} (1) = b + {inf}_{f \in C (Y, [0, 1])} g_{*}^{'} (m) (f) = b + {inf}_{f \in C (Y, [0, 1])} m (f \circ g)$

$\geq b + {inf}_{f^{'} \in C (X, [0, 1])} m (f) = b + m^{-} (1) \geq 0$

So the $b$ term is indeed big enough that the image of $(m, b)$ is an sa-measure.

For closure, fix a sequence of $(m_{n}, b_{n}) \in g_{*} (H)$ limiting to some $(m, b)$ , with preimage points $(m_{n}^{'}, b_{n}^{'}) \in H$ . Due to convergence of $(m_{n}, b_{n})$ there must be some $b^{◯}$ bound on the $b_{n}$ . $g_{*}$ preserves those values, so $b^{◯}$ is an upper bound on the $b_{n}^{'}$ . Since the $(m_{n}^{'}, b_{n}^{'})$ are sa-measures, $- b^{◯}$ is a lower bound on the $m_{n}^{^{'} -} (1)$ values. Since $m_{n}$ converges to $m$ , $m_{n} (1)$ converges to $m (1)$ , so there's a $λ^{◯}$ upper bound on the $m_{n} (1)$ values. Further,

$λ^{◯} \geq m_{n} (1) = g_{*}^{'} (m_{n}^{'}) (1) = m_{n}^{'} (1 \circ g) = m_{n}^{'} (1) = m_{n}^{^{'} +} (1) + m_{n}^{^{'} -} (1) \geq m_{n}^{^{'} +} (1) - b^{◯}$

So, for all n, $m_{n}^{^{'} +} (1) \leq λ^{◯} + b^{◯}$ , so we have an upper bound on the $b_{n}^{'}$ and $m_{n}^{^{'} +} (1)$ values. Now we can invoke the Compactness Lemma to conclude that there's a convergent subsequence of the $(m_{n}^{'}, b_{n}^{'})$ , with a limit point $(m^{'}, b^{'})$ , which must be in $H$ since $H$ is closed. By continuity of $g_{*} (H)$ from Lemma 6, $g^{*} (m^{'}, b^{'})$ must equal $(m, b)$ , witnessing that $(m, b) \in g_{*} (H)$ . So, $g_{*} (H)$ is closed. Now, if we take upper completion afterwards, we can just invoke Lemma 2 to conclude that the upper completion of a closed set of sa-measures is closed.

Also, $g_{*}$ is linear from Lemma 6, so it maps convex sets to convex sets getting convexity.

Now for upper completion. Upper completion is immediate if $g$ isn't surjective, because we had to take the upper completion there. Showing we don't need upper completion if $g$ is surjective is trickier. We must show that $g_{*}$ is a surjection from $M^{s a} (X)$ to $M^{s a} (Y)$ .

First, we'll show that $g_{*} (U)$ where $U$ is an open subset of $X$ is a measurable subset of $Y$ . In metrizable spaces (of which $X$ is one), every open set is a $F_{σ}$ set, ie, it can be written as a countable union of closed sets. Because our space is compact, all those closed sets are compact. And the continuous image of a compact set is a compact set, ie closed. Therefore, $g_{*} (U)$ is a countable union of closed sets, ie, measurable.

$X$ is a Polish space (all compact metric spaces are Polish), it has the Borel $σ$ -algebra, and we'll use the function $g^{- 1}$ . Note that $g^{- 1} (y)$ is closed and nonempty for all $y \in Y$ due to $g$ being a continuous surjection. Further, the set ${y : g^{- 1} (y) \cap U \neq \emptyset}$ equals $g (U)$ for all open sets $U$ . In one direction, if the point $y$ is in the first set, then there's some point $x \in U$ where $g (x) = y$ . In the other direction, if a point $y$ is in $g (U)$ , then there's some point $x \in U$ where $g (x) = y$ so $g^{- 1} (y) \cap U$ is nonempty.

Thus, $g^{- 1}$ is weakly measurable, because for all open sets $U$ of $X$ , ${y : g^{- 1} (y) \cap U \neq \emptyset} = g (U)$ and $g (U)$ is measurable. Now, by the Kuratowski-Ryll-Nardzewski Measurable Selection Theorem, we get a measurable function $g^{◊}$ from $Y$ to $X$ where $g^{◊} (y) \in g^{- 1} (y)$ so $g (g^{◊} (y)) = y$ , and $g^{◊}$ is an injection.

So, we can push any sa-measure of interest $(m^{*}, b^{*})$ through $g_{*}^{◊}$ (which preserves the amount of negative measure due to being an injection), to get an sa-measure that, when pushed through $g_{*}$ recovers $(m^{*}, b^{*})$ exactly. Thus, if $g_{*} (m, b) \in g_{*} (H)$ , and you want to show $g_{*} (m, b) + (m^{*}, b^{*}) \in g_{*} (H)$ , just consider

$g_{*} ((m, b) + g_{*}^{◊} (m^{*}, b^{*})) = g_{*} (m, b) + g_{*} (g_{*}^{◊} (m^{*}, b^{*})) = g_{*} (m, b) + (m^{*}, b^{*})$

So, since $(m, b) + g_{*}^{◊} (m^{*}, b^{*}) \in H$ due to upper-completeness, then $g_{*} ((m, b) + g_{*}^{◊} (m^{*}, b^{*})) = g_{*} (m, b) + (m^{*}, b^{*}) \in g_{*} (H)$ And we have shown upper-completeness of $g_{*} (H)$ if $g$ is a surjection.

We should specify something about using LF-Duality here. If you look back through the proof of Theorem 5 carefully, the only conditions you really need for isomorphism are (on the set side) $g_{*} (H)$ being closed, convex, and upper complete (in order to use Proposition 2 to rewrite $g_{*} (H)$ appropriately for the subsequent arguments, we have these properties), and (on the functional side), $f \mapsto E_{g_{*} (H)} (f)$ being concave (free), $- \infty$ if $range (f) ⊈ [0, 1]$ (by proof of Theorem 4, comes from upper completeness), and continuous over $f \in C (Y, [0, 1])$ (showable by Proposition 8 that $E_{g_{*} (H)} (f) = E_{H} (f \circ g)$ , and the latter being continuous since $H$ is an infradistribution)

It's a bit of a pain to run through this argument over and over again, so we just need to remember that if you can show closure, convexity, upper completeness, and the expectations to be continuous, that's enough to invoke LF-Duality and clean up the minimal point conditions. We did that, so we can invoke LF-Duality now.

Time for normalization. From Proposition 8, the $g_{*} (h)$ function we get from $f \mapsto E_{g_{*} (H)} (f)$ is uniquely characterized as: $g_{*} (h) (f) = h (f \circ g)$ . So,

$E_{g_{*} (H)} (1) = g_{*} (h) (1) = h (1 \circ g) = h (1) = E_{H} (1) = 1$

$E_{g_{*} (H)} (0) = g_{*} (h) (0) = h (0 \circ g) = h (0) = E_{H} (0) = 0$

and normalization is taken care of.

For bounded-minimals/weak-bounded-minimals, since $g_{*} (H)$ is the LF-dual of $g_{*} (h)$ , we can appeal to Theorem 5 and just check whether $g_{*} (h)$ is Lipschitz/uniformly continuous. if $d (f, f^{'}) < δ$ , then $d (f \circ g, f^{'} \circ g) < δ$ according to the sup metric on $C (Y, [0, 1])$ and $C (X, [0, 1])$ , respectively, which (depending on whether we're dealing with Lipschitzness or uniform continuity), implies that $| h (f \circ g) - h (f^{'} \circ g) | < λ^{⊙} δ$ , or $ϵ$ for uniform continuity. So, we get: $| g_{*} (h) (f) - g_{*} (h) (f^{'}) | = | h (f \circ g) - h (f^{'} \circ g) | < λ^{⊙} δ$ (or $ϵ$ for uniform continuity), thus establishing that $f$ and $f^{'}$ being sufficiently close means that $g_{*} (h)$ doesn't change much, which, by Theorem 5, implies bounded-minimals/weak-bounded-minimals in $g_{*} (H)$ .

For positive-minimals it's another Theorem 5 argument. If $f^{'} \geq f$ , then $f^{'} \circ g \geq f \circ g$ , so: $g_{*} (h) (f^{'}) - g_{*} (h) (f) = h (f^{'} \circ g) - h (f \circ g) \geq 0$ And we have monotonicity for $g_{*} (h)$ , which, by Theorem 5, translates into positive-minimals on $g_{*} (H)$ .

Lemma 7: If $M \in (E_{ζ} H_{i})^{min}$ , then for all decompositions of $M$ into $M_{i}$ , $M_{i} \in (H_{i})^{min}$

This is easy. Decompose $M$ into $E_{ζ} M_{n}$ . To derive a contradiction, assume there exists a nonminimal $M_{i}$ that decomposes into $M_{i}^{min} + M_{i}^{*}$ where $M_{i}^{*} \neq 0$ . Then,

$M = E_{ζ} M_{i} = E_{ζ} (M_{i}^{min} + M_{i}^{*}) = E_{ζ} (M_{i}^{min}) + E_{ζ} (M_{i}^{*})$

Thus, we have decomposed our minimal point into another point which is also present in $E_{ζ} H_{i}$ , and a nonzero sa-measure because there's a nonzero $M_{i}^{*}$ so our original "minimal point" is nonminimal. Therefore, all decompositions of a minimal point in the mixture set must have every component part being minimal as well.

Proposition 10: $E_{E_{ζ} H_{i}} (f) = E_{ζ} (E_{H_{i}} (f))$

$E_{E_{ζ} H_{n}} (f) = {inf}_{(m, b) \in E_{ζ} H_{i}} (m (f) + b) = {inf}_{(m_{i}, b_{i}) \in Π_{i} H_{i}} ((E_{ζ} m_{i}) (f) + E_{ζ} b_{i})$

$= {inf}_{(m_{i}, b_{i}) \in Π_{i} H_{i}} (E_{ζ} (m_{i} (f)) + E_{ζ} (b_{i})) = {inf}_{(m_{i}, b_{i}) \in Π_{i} H_{i}} E_{ζ} (m_{i} (f) + b_{i})$

$= E_{ζ} ({inf}_{(m_{i}, b_{i}) \in H_{i}} (m_{i} (f) + b_{i})) = E_{ζ} (E_{H_{i}} (f))$

Done.

Proposition 11: A mixture of infradistributions is an infradistribution. If it's a mixture of bounded infradistributions with Lipschitz constants on their associated $h$ functions of $λ_{i}^{⊙}$ , and $\sum_{i} ζ_{i} λ_{i}^{⊙} < \infty$ , then the mixture is a bounded infradistribution.

Proof sketch: Nonemptiness, convexity, upper completion, and normalization are pretty easy to show. Closure is a nightmare.

The proof sketch of Closure is: Take a sequence $(m_{n}, b_{n})$ limiting to $(m, b)$ . Since each approximating point is a mixture of points from the $H_{i}$ , we can shatter each of these $(m_{n}, b_{n}) \in E_{ζ} H_{i}$ into countably many $(m_{i, n}, b_{i, n}) \in H_{i}$ . This defines a sequence in each $H_{i}$ (not necessarily convergent). Then, we take some bounds on the $(m_{n}, b_{n})$ and manage to translate them into (rather weak) i-dependent bounds on the $(m_{i, n}, b_{i, n})$ sequence. This lets us invoke the Compactness Lemma and view everything as wandering around in a compact set, regardless of $H_{i}$ . Then, we take the product of these compact sets to view everything as a single sequence in the product of compact sets, which is compact by Tychonoff's theorem. This is only a countable product of compact metric spaces, so we don't need full axiom of choice. Anyways, we isolate a convergent subsequence in there, which makes a convergent subsequence in each of the $H_{i}$ . And then, we can ask "what happens when we mix the limit points in the $H_{i}$ according to $ζ$ ?" Well, what we can do is just take a partial sum of the mixture of limit points, like the i from 0 to 1 zillion. We can establish that $(m, b)$ gets arbitrarily close to the upper completion of a partial sum of the mixture of limit points, so $(m, b)$ lies above all the partial sums of our limit points. We show that the partial sums don't have multiple limits, then, we just do one more invocation of Lemma 3 to conclude that the mixture of limit points lies below $(m, b)$ . Finally, we appeal to upper completion to conclude that $(m, b)$ is in our mixed set of interest. Whew!

Once those first 4 are out of the way, we can then invoke Theorem 5 to translate to the $h$ view, and mop up the remaining minimal-point conditions.

First, nonemptiness. By Theorem 5, we can go "hm, the $h_{i}$ are monotone on $C (X, [0, 1])$ , and $- \infty$ everywhere else, and $h_{i} (1) = 1$ , so the affine functional $ϕ : ϕ (f) = 1$ lies above the graph of $h_{i}$ ". This translates to the point $(0, 1)$ being present in all the $H_{i}$ . Then, we can just go: $E_{ζ} (0, 1) = (0, 1)$ , so we have a point in our $E_{ζ} H_{i}$ set.

For normalization, appeal to Proposition 10 and normalization for all the $H_{i}$ . $E_{E_{ζ} H_{i}} (1) = E_{ζ} (E_{H_{i}} (1)) = E_{ζ} (1) = 1$ and $E_{E_{ζ} H_{i}} (0) = E_{ζ} (E_{H_{i}} (0)) = E_{ζ} (0) = 0$ .

Convexity is another easy one. Take a $M, M^{'} \in E_{ζ} H_{i}$ . They shatter into $M_{i}, M_{i}^{'} \in H_{i}$ . Then, we can just go:

$p M + (1 - p) (m^{'}, b^{'}) = p E_{ζ} (m_{i}, b_{i})) + (1 - p) E_{ζ} (m_{i}^{'}, b_{i}^{'})) = E_{ζ} (p (m_{i}, b_{i}) + (1 - p) (m_{i}^{'}, b_{i}^{'}))$

and then, by convexity of the $H_{i}$ , $p (m_{i}, b_{i}) + (1 - p) (m_{i}^{'}, b_{i}^{'}) \in H_{i}$ , so we wrote $p (m, b) + (1 - p) (m^{'}, b^{'})$ as a mixture of points in $H_{i}$ .

Upper completion is another easy one, because, if $(m, b) \in E_{ζ} H_{i}$ , then you can go

$(m, b) + (m^{*}, b^{*}) = E_{ζ} (m_{i}, b_{i}) + E_{ζ} (m^{*}, b^{*}) = E_{ζ} ((m_{i}, b_{i}) + (m^{*}, b^{*}))$

And $((m_{i}, b_{i}) + (m^{*}, b^{*})) \in H_{i}$ by upper completion.

That leaves the nightmare of closure. Fix a sequence $M_{n} \in E_{ζ} (H_{i})$ limiting to $M$ . You can think of the $M_{n}$ as $(m_{n}, b_{n})$ . We can shatter the $M_{n}$ into $M_{i, n} \in H_{i}$ , where $M_{i, n}$ can be thought of as $(m_{i, n}, b_{i, n})$ .

Now, since $M_{n}$ converge to something, there must be an upper bound on the $b_{n}$ and $m_{n} (1)$ terms of the sequence, call those $b^{◯}$ and $λ^{◯}$ . Now, for all n and all $i^{'}$ , $b^{◯} \geq b_{n} = \sum_{i} ζ_{i} b_{i, n} \geq ζ_{i^{'}} b_{i^{'}, n}$ so, for all n and i, $b_{i, n} \leq \frac{b^{◯}}{ζ_{i}}$ .

Also, for all n and $i^{'}$ , $λ^{◯} + b^{◯} \geq m_{n} (1) + b_{n} = \sum_{i} (ζ_{i} (m_{i, n} (1) + b_{i, n})) \geq ζ_{i^{'}} (m_{i^{'}, n} (1) + b_{i^{'}, n})$ and reshuffling, we get $\frac{λ^{◯} + b^{◯}}{ζ_{i^{'}}} \geq m_{i^{'}, n} (1) + b_{i^{'}, n}$ which then makes $\frac{λ^{◯} + b^{◯}}{ζ_{i^{'}}} \geq m_{i^{'}, n}^{+} (1) + (m_{i^{'}, n}^{-} (1) + b_{i^{'}, n})$ . Further, due to $(m_{i^{'}, n}, b_{i^{'}, n})$ being a sa-measure, $b_{i^{'}, n} + m_{i, n}^{-} (1) \geq 0$ , so for all n and i, $m_{i, n}^{+} (1) \leq \frac{λ^{◯} + b^{◯}}{ζ_{i}}$ .

Ok, so taking stock of what we've shown so far, it's that for all i, the sequence $M_{i, n}$ is roaming about within $H_{i} \cap {(m, b) | b \leq \frac{b^{◯}}{ζ_{i}}, m^{+} (1) \leq \frac{λ^{◯} + b^{◯}}{ζ_{i}}}$ And, by the Compactness Lemma, this set is compact, since it's got bounds (weak bounds, but bounds nonetheless). Defining

${¯ ¯¯¯¯ ¯ M}_{n} \in \prod_{i} (H_{i} \cap {(m, b) | b \leq \frac{b^{◯}}{ζ_{i}}, m^{+} (1) \leq \frac{λ^{◯} + b^{◯}}{ζ_{i}}})$

where ${¯ ¯¯¯¯ ¯ M}_{n} (i) := M_{i, n}$ , we can view everything as one single sequence ${¯ ¯¯¯¯ ¯ M}_{n}$ wandering around in the product of compact sets. By Tychonoff's theorem (we've only got a countable product of compact metric spaces, so we don't need full axiom of choice, dependent choice suffices), we can fix a convergent subsequence of this, and the projections of this subsequence to every $H_{i}$ converge.

Ok, so we've got a subsequence of n where, regardless of i, $M_{i, n}$ converge to some $M_{i} \in H_{i}$ (by closure of $H_{i}$ ). How does that help us? We don't even know if mixing these limit points converges to something or runs off to infinity. Well... fix any j you like, we'll just look at the partial sum of the first j components. Also fix any $ϵ$ you please. On our subsequence of interest, the $M_{n}$ converge to $M$ , and in all i, the $M_{i, n}$ converge to $M_{i}$ . So, let n be large enough (and in our subsequence) that $d (M_{n}, M) < ϵ$ , and $\forall i \leq j : d (M_{i, n}, M_{i}) < ϵ$ , we can always find such an n.

Now, $\sum_{i \leq j} ζ_{i} M_{i} + \sum_{i > j} ζ_{i} M_{i, n}$ is a well-defined point (because it's a finite sum of points plus a convergent sequence as witnessed by the well-definedness of $M_{n}$ which breaks down as $\sum_{i} ζ_{i} M_{i, n}$ ) It also lies in the upper completion of the single point $\sum_{i \leq j} ζ_{i} M_{i}$ . We'll show that this point is close to $M$ . Since we're working in a space with a norm,

$d (M + M^{*}, M^{'} + M^{*}) = | | (M + M^{*}) - (M^{'} + M^{*}) | | = | | M - M^{'} | | = d (M, M^{'})$

This will come in handy in the later equations.

$d (\sum_{i \leq j} ζ_{i} M_{i} + \sum_{i > j} ζ_{i} M_{i, n}, M) \leq d (\sum_{i \leq j} ζ_{i} M_{i} + \sum_{i > j} ζ_{i} M_{i, n}, M_{n}) + d (M_{n}, M)$

$< d (\sum_{i \leq j} ζ_{i} M_{i} + \sum_{i > j} ζ_{i} M_{i, n}, \sum_{i} ζ_{i} M_{i, n}) + ϵ = d (\sum_{i \leq j} ζ_{i} M_{i}, \sum_{i \leq j} ζ_{i} M_{i, n}) + ϵ$

$\leq \sum_{i \leq j} d (ζ_{i} M_{i}, ζ_{i} M_{i, n}) + ϵ = \sum_{i \leq j} | | ζ_{i} M_{i} - ζ_{i} M_{i, n} | | + ϵ = \sum_{i \leq j} ζ_{i} | | M_{i} - M_{i, n} | | + ϵ$

$= \sum_{i \leq j} ζ_{i} d (M_{i}, M_{i, n}) + ϵ < \sum_{i \leq j} ζ_{i} ϵ + ϵ \leq ϵ + ϵ = 2 ϵ$

So, $M$ is less than $2 ϵ$ away from the upper completion of the point $\sum_{i \leq j} ζ_{i} M_{i}$ , which is a closed set (Minkowski sum of a closed and compact set is closed). $ϵ$ can be shrank to 0 with increasing n, so $M$ has distance 0 from the upper completion of said partial sum, and thus lies above the partial sum!

Abbreviating $\sum_{i \leq j} ζ_{i} M_{i}$ as $M_{j}$ , we get that all the $M_{j}$ lie in ${M} - M^{s a} (X)$ , and are all sa-measures. Thus, if the sequence $M_{j}$ converges to a unique point, then said limit point is $\sum_{i} ζ_{i} M_{i}$ , and all the $M_{i} \in H_{i}$ , so $\sum_{i} ζ_{i} M_{i}$ would lie in $E_{ζ} H_{i}$ . Further, by Lemma 3, $\sum_{i} ζ_{i} M_{i} \in {M} - M^{s a} (X)$ , since that set is compact, so $M$ lies above $\sum_{i} ζ_{i} M_{i}$ , and would lie in $E_{ζ} H_{i}$ by upper-completeness.

So, all that's left to wrap up our closure argument is showing that the sequence $M_{j}$ has a single limit point. Since it's wandering around in $({M} - M^{s a} (X)) \cap M^{s a} (X)$ which is compact by Lemma 3, there are convergent subsequences. All we have to show now is that all convergent subsequences must have the same limit point.

Assume this is false, and there's two distinct limit points of the sequence $M_{j}$ , call them $M_{\infty}$ and $M_{\infty}^{'}$ . Because it's impossible for two points to both be above another (in the minimal-point/adding-points sense), without both points being identical, either $M_{\infty} \notin {M_{\infty}^{'}} - M^{s a} (X)$ , or vice-versa. Without loss of generality, assume $M_{\infty} \notin {M_{\infty}^{'}} - M^{s a} (X)$ . Since the latter is a closed set, $M_{\infty}$ must be $ϵ$ away for some $ϵ > 0$ . Fix some j from the subsequence that $M_{\infty}$ is a limit point of, where $d (M_{j}, M_{\infty}) < \frac{ϵ}{2}$ . There must be some strictly greater $j^{'}$ from the subsequence that $M_{\infty}^{'}$ is a limit point of.

$M_{j^{'}} = \sum_{i \leq j^{'}} ζ_{i} M_{i} = \sum_{i \leq j} ζ_{i} M_{i} + \sum_{j < i \leq j^{'}} ζ_{i} M_{i} = M_{j} + \sum_{j < i \leq j^{'}} ζ_{i} M_{i}$

Further, the $ζ_{i}$ are nonzero. Also, no $M_{i}$ can be the 0 point, because $M_{i} \in H_{i}$ , and if $M_{i} = (0, 0)$ , then $E_{H_{i}} (1) = 0$ , which is impossible by normalization. So, $M_{j}$ lies strictly below $M_{j^{'}}$ . Also, $M_{j^{'}}$ lies below $M_{\infty}^{'}$ , because for all the $j^{*} > j^{'}$ ,

$M_{j^{*}} = \sum_{i \leq j^{*}} ζ_{i} M_{i} = \sum_{i \leq j^{'}} ζ_{i} M_{i} + \sum_{j^{'} < i \leq j^{*}} ζ_{i} M_{i} = M_{j^{'}} + \sum_{j^{'} < i \leq j^{*}} ζ_{i} M_{i}$

so $M_{j^{*}} \in {M_{j^{'}}} + M^{s a} (X)$ for all $j^{*} > j^{'}$ . The sequence that limits to $M_{\infty}^{'}$ is roaming around in this set, which is closed because the sum of a compact set (a single point) and a closed set is closed. So, $M_{\infty}^{'}$ lies above $M_{j^{'}}$ which lies above $M_{j}$ . Thus, $M_{j} \in {M_{\infty}^{'}} - M^{s a} (X)$ . However, $M_{j}$ is $\frac{ϵ}{2}$ or less distance from $M_{\infty}$ , which must be $ϵ$ distance from ${M_{\infty}^{'}} - M^{s a} (X)$ , and we have a contradiction.

Ok, so the sequence of partial sums $M_{j}$ has a single limit point, which is $\sum_{i} ζ_{i} M_{i}$ , and all the $M_{i} \in H_{i}$ , so $\sum_{i} ζ_{i} M_{i} \in E_{ζ} H_{i}$ , and by Lemma 3, $\sum_{i} ζ_{i} M_{i} \in {M} - M^{s a} (X)$ , since that set is compact, so $M$ lies above $\sum_{i} ζ_{i} M_{i}$ , and lies in $E_{ζ} H_{i}$ by upper-completeness. We're done!

For minimals, by our argument about what it takes to invoke LF-Duality in Proposition 9, we only need convexity, closure, and upper completion (which we have), and that the $h$ induced by $E_{ζ} H_{i}$ is continuous. By Proposition 10, $E_{E_{ζ} H_{i}} (f) = E_{ζ} (E_{H_{i}} (f)) = E_{ζ} (h_{i} (f)) = (E_{ζ} h_{i}) (f)$ . We might as well go for uniform continuity since all the $H_{i}$ are infradistributions, and so fulfill weak-bounded-minimals, so their $h_{i}$ are uniformly continuous. Then, this continuity lets you invoke LF-Duality, and transfer uniform continuity for the $h$ induced by $E_{ζ} H_{i}$ to weak-bounded-minimals for $E_{ζ} H_{i}$

For uniform continuity/weak-bounded-minimals, given an arbitrary $ϵ$ , we can pick a finite j where $\sum_{i > j} ζ_{i} < \frac{ϵ}{2}$ , and a finite $δ$ where, for all $h_{i}$ with $i \leq j$ , $d (f, f^{'}) < δ$ implies $| h_{i} (f) - h_{i} (f^{'}) | < \frac{ϵ}{2}$ . Monotonicity and normalization for the $h_{i}$ ensures that, no matter what, $h_{i} (f) \in [0, 1]$ , so regardless of the $f, f^{'}$ , $| h_{i} (f) - h_{i} (f^{'}) | \leq 1$ . Then, we can go: Ok, if $| f - f^{'} | < δ$ , then

$| E_{ζ} (h_{i} (f)) - E_{ζ} (h_{i} (f^{'})) | \leq E_{ζ} | h_{i} (f) - h_{i} (f^{'}) |$

$= \sum_{i \leq j} ζ_{i} | h_{i} (f) - h_{i} (f^{'}) | + \sum_{i > j} ζ_{i} | h_{i} (f) - h_{i} (f^{'}) |$

$< \sum_{i \leq j} ζ_{i} \frac{ϵ}{2} + \sum_{i > j} ζ_{i} < \sum_{i} ζ_{i} \frac{ϵ}{2} + \frac{ϵ}{2} = \frac{ϵ}{2} + \frac{ϵ}{2} = ϵ$

And by our earlier argument, we invoke LF-Duality and pick up weak-bounded-minimals.

For positive-minimals, we can just observe that, if $f^{'} \geq f$ , then

$(E_{ζ} h_{i}) (f^{'}) = E_{ζ} (h_{i} (f^{'})) \geq E_{ζ} (h_{i} (f)) = (E_{ζ} h_{i}) (f)$

By monotonicity for the $h_{i}$ because $H_{i}$ had positive-minimals. Going back to $E_{ζ} H_{i}$ , since its associated $h$ is monotone, it must have positive-minimals as well.

For bounded minimals assuming the Lipschitz constants aren't too big, fix some $ϵ$ . We know that $\sum_{i} ζ_{i} λ_{i}^{⊙} < \infty$ , where $λ_{i}^{⊙}$ is the Lipschitz constant of $h_{i}$ . So, if $d (f, f^{'}) < ϵ$ , then:

$| E_{ζ} (h_{i} (f)) - E_{ζ} (h_{i} (f^{'})) | \leq E_{ζ} | h_{i} (f) - h_{i} (f^{'}) | = \sum_{i} ζ_{i} | h_{i} (f) - h_{i} (f^{'}) | < \sum_{i} ζ_{i} λ_{i}^{⊙} ϵ$

So, $\sum_{i} ζ_{i} λ_{i}^{⊙}$ is a finite constant, and is an upper bound on the Lipschitz constant of the mixture of the $h_{i}$ , so the $h$ corresponding to $E_{ζ} H_{i}$ has a Lipschitz constant, which, by Theorem 5, translates to bounded-minimals. And we're done.

Proposition 12: $g_{*} (E_{ζ} (H_{i})) = E_{ζ} (g_{*} (H_{i}))$

Let's use Theorem 5 to translate this into the concave functional setting. We want to show that $g_{*} (E_{ζ} h_{i}) = E_{ζ} (g_{*} (h_{i}))$ Now, given any function $f \in C (Y, [0, 1])$ ,

$(g_{*} (E_{ζ} h_{i})) (f) = (E_{ζ} h_{i}) (f \circ g) = E_{ζ} (h_{i} (f \circ g)) = E_{ζ} (g_{*} (h_{i}) (f)) = (E_{ζ} (g_{*} (h_{i}))) (f)$

and we're done! The two concave functionals corresponding to those two sets are the same, so the sets themselves are the same.

Lemma 8: The "raw update" $u_{L}^{g} : M^{s a} (X) \to M^{s a} (L)$ defined by $(m, b) \mapsto (m \cdot L, b + m (0 ★^{L} g))$ is a continuous linear operator.

For linearity,

$u_{L}^{g} (a (m, b) + a^{'} (m^{'}, b^{'})) = u_{L}^{g} (a m + a^{'} m^{'}, a b + a^{'} b)$

$= ((a m + a^{'} m^{'}) \cdot L, a b + a^{'} b^{'} + (a m + a^{'} m^{'}) (0 ★^{L} g))$

$= (a (m \cdot L) + a^{'} (m^{'} \cdot L), a b + a^{'} b^{'} + a m (0 ★^{L} g) + a^{'} m^{'} (0 ★^{L} g))$

$= a (m \cdot L, b + m (0 ★^{L} g)) + a^{'} (m^{'} \cdot L, b^{'} + m^{'} (0 ★^{L} g)) = a u_{L}^{g} (m, b) + a^{'} u_{L}^{g} (m, b)$

Now for continuity. $m_{n} \cdot L$ limits to $m \cdot L$ if, for all $f \in C (¯ ¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯ ¯ supp (L))$ , $(m_{n} \cdot L) (f)$ limits to $(m \cdot L) (f)$ . Observe that $(m \cdot L) (f) = m (f ★^{L} 0)$ , and $f ★^{L} 0$ is continuous.

Now, for any $f$ we can go

${lim}_{n \to \infty} ((m_{n} \cdot L) (f)) = {lim}_{n \to \infty} (m_{n} (f ★^{L} 0)) = m (f ★^{L} 0) = (m \cdot L) (f)$

establishing continuity in the first vector component, by $m_{n}$ limiting to $m$ . For the second vector component,

$m (f ★^{L} g) + b = {lim}_{n \to \infty} (m_{n} (f ★^{L} g)) + {lim}_{n \to \infty} b_{n} = {lim}_{n \to \infty} (m_{n} (f ★^{L} g) + b_{n})$

So we have continuity in the second vector component as well, and we're done.

Lemma 9: $(u_{L}^{g} (H))^{min} \subseteq u_{L}^{g} (H^{min})$

As a recap, the raw update function $u_{L}^{g}$ is: $(m, b) \mapsto (m \cdot L, b + m (0 ★^{L} g))$

Take a point $(m, b) \in (u_{L}^{g} (H))^{min}$ . Now there must be a preimage point $(m^{'}, b^{'}) \in H$ that, when we apply $u_{L}^{g}$ , produces $(m, b)$ . Because $(m^{'}, b^{'})$ is in an infradistribution, we can decompose it into a minimal point and something else, $(m^{'}, b^{'}) = (m^{min}, b^{min}) + (m^{*}, b^{*})$ . Then,

$(m, b) = u_{L}^{g} ((m^{'}, b^{'})) = u_{L}^{g} ((m^{min}, b^{min}) + (m^{*}, b^{*})) = u_{L}^{g} (m^{min}, b^{min}) + u_{L}^{g} (m^{*}, b^{*})$

This was done by using linearity of $u_{L}^{g}$ via Lemma 8.

Note that, since we have written $(m, b)$ as a sum of a different point also in $u_{L}^{g} (H)$ and an sa-measure, but $(m, b)$ is minimal in $u_{L}^{g} (H)$ , the sa-measure must be 0, so $(m, b) = u_{L}^{g} (m^{min}, b^{min}) \in u_{L}^{g} (H^{min})$ , and we're done.

Proposition 13: When updating a bounded infradistribution over $M^{s a} (X)$ , if the renormalization doesn't fail, you get a bounded infradistribution over the set $M^{s a} (L)$ . (for infradistributions in general, you may have to take the closure)

Proof sketch: It doesn't matter whether you take upper-completion before or after renormalization, so we can appeal to Proposition 7: Renormalizing a bounded inframeasure produces a bounded infradistribution (if the renormalization doesn't fail).

So, we just have to show nonemptiness, convexity, upper-completion (trivial), positive-minimals/bounded minimals (by Lemma 9, the preimage of a minimal point contains a minimal point, so we can transfer over the properties from the minimal point in the preimage), and closure. The set of minimal points in $H$ is contained in a compact set, so we can take a sequence in $(u_{L}^{g} (H))^{u c}$ , split into a component in $u_{L}^{g} (H)$ and something else, take preimage points, get minimals below all of them, isolate a convergent subsequence, map the limit point back through, and show that the limit point lands under your point of interest. That establishes all conditions for a bounded inframeasure, so then we just have to check that our renormalization is the right one to do.

Proof: Nonemptiness is trivial, $u_{L}^{g}$ isn't a partial function. Upper-completion is also trivial, because we explicitly took the upper completion. For convexity, observe that $u_{L}^{g}$ is a linear operator by Lemma 7, so it maps convex sets to convex sets, and the Minkowski sum of two convex sets is convex. $u_{L}^{g}$ maps sa-measures to sa-measures, because

$b + m (0 ★^{L} g) + (m \cdot L)^{-} (1) = b + m (0 ★^{L} g) + (m^{-} \cdot L) (1)$

$= b + m (0 ★^{L} g) + m^{-} (1 ★^{L} 0) = b + m^{+} (0 ★^{L} g) + m^{-} (0 ★^{L} g) + m^{-} (1 ★^{L} 0)$

$\geq b + m^{-} (1 ★^{L} g) \geq b + m^{-} (1) \geq 0$

For positive-minimals and bounded-minimals, we invoke Lemma 9, $(u_{L}^{g} (H))^{min} \subseteq u_{L}^{g} (H^{min})$ . All minimal points in $u_{L}^{g} (H)$ must have a preimage minimal in $H$ , which is an a-measure. Chopping down a measure by $L$ keeps it a measure, so we still have no negative components post-update, and all minimal points in $u_{L}^{g} (H)$ are a-measures. Similarly, chopping down a measure by $L$ reduces the $λ$ value, and we had an upper bound of $λ^{⊙}$ originally, so the upper bound still works post-update. This gets bounded-minimals.

This just leaves closure. Fix a sequence $M_{n}$ in $u_{L}^{g} (H)^{u c}$ limiting to $M$ . The $M_{n}$ break down into $u_{g}^{f} (M_{n}^{'}) + M_{n}^{*}$ , where $M_{n}^{'} \in H$ . $M_{n}^{'}$ further breaks down into $M_{n}^{min} + M_{n}^{* *}$ , where $M_{n}^{min} \in H^{min}$ . By Proposition 5, the $M_{n}^{min}$ sequence is wandering around in a compact set since we have bounded-minimals on $H$ , so there's a convergent subsequence which has a limit point $M^{min}$ . Map that convergent subsequence and limit point through $u_{L}^{g}$ which is continuous by Lemma 8 to get a sequence of points $u_{L}^{g} (M_{n}^{min})$ limiting to $u_{L}^{g} (M^{min}) \in u_{L}^{g} (H)$ . Fix some really big n where $d (M, M_{n}) < ϵ$ and $d (u_{L}^{g} (M_{n}^{min}), u_{L}^{g} (M^{min})) < ϵ$ .

Now, $u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}) + M_{n}^{*}$ lies in the upper completion of the point $u_{L}^{g} (M^{min})$ . We'll show that this sum of 3 terms is close to $M$ . Since we're working in a Banach space, $d (x + y, z + y) = d (x, z)$ , by norm arguments.

$d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}) + M_{n}^{*}, M) \leq d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}) + M_{n}^{*}, M_{n}) + d (M_{n}, M)$

$< d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}) + M_{n}^{*}, u_{g}^{f} (M_{n}^{'}) + M_{n}^{*}) + ϵ$

$= d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}), u_{L}^{g} (M_{n}^{'})) + ϵ = d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}), u_{L}^{g} (M_{n}^{min} + M_{n}^{* *})) + ϵ$

$= d (u_{L}^{g} (M^{min}) + u_{L}^{g} (M_{n}^{* *}), u_{L}^{g} (M_{n}^{min}) + u_{L}^{g} (M_{n}^{* *})) + ϵ = d (u_{L}^{g} (M^{min}), u_{L}^{g} (M_{n}^{min})) + ϵ < 2 ϵ$

So, $M$ is within $2 ϵ$ of the upper completion of ${u_{L}^{g} (M^{min})}$ for all $ϵ$ , and it's a closed set, so $M$ lies above $u_{L}^{g} (M^{min}) \in u_{L}^{g} (H)$ , so $M \in (u_{L}^{g} (H))^{u c}$ , and we have closure.

Now that all prerequisite conditions have been established, we just need to show that $\frac{1}{P_{H}^{g} (L)}$ and $E_{H} (0 ★^{L} g)$ are the proper renormalization constants to use.

The proper renormalization to use is: $\frac{1}{E_{(u_{L}^{g} (H))^{u c}} (1) - E_{(u_{L}^{g} (H))^{u c}} (0)}$ for the scale, and $E_{(u_{L}^{g} (H))^{u c}} (0)$ for the shift. So let's unpack these quantities.

$E_{(u_{L}^{g} (H))^{u c}} (0) = E_{u_{L}^{g} (H)} (0) = {inf}_{(m, b) \in u_{L}^{g} (H)} b = {inf}_{(m, b) \in H} (b + m (0 ★^{L} g)) = E_{H} (0 ★^{L} g)$

So, our shift constant checks out, it's the proper shift constant to use. In the other direction,

$E_{(u_{L}^{g} (H))^{u c}} (1) = E_{u_{L}^{g} (H)} (1) = {inf}_{(m, b) \in u_{L}^{g} (H)} (m (1) + b)$

$= {inf}_{(m, b) \in H} ((m^{'} \cdot L) (1) + b + m (0 ★^{L} g)) = {inf}_{(m, b) \in H} (m (1 ★^{L} 0) + b + m (0 ★^{L} g))$

$= {inf}_{(m, b) \in H} (m (1 ★^{L} g) + b) = E_{H} (1 ★^{L} g)$

For the scale constant, observe that $\frac{1}{E_{(u_{L}^{g} (H))^{u c}} (1) - E_{(u_{L}^{g} (H))^{u c}} (0)} = \frac{1}{E_{H} (1 ★^{L} g) - E_{H} (0 ★^{L} g)} = \frac{1}{P_{H}^{g} (L)}$

So our scale constant is also the right scale constant to use. Now, we can invoke Proposition 7: Renormalizing a bounded inframeasure produces a bounded infradistribution if the renormalization doesn't fail.

Proposition 14: $E_{H} (f ★^{L} g) = E_{H} (0 ★^{L} g) + P_{H}^{g} (L) E_{H |^{g} L} (f)$

Proof: if $P_{H}^{g} (L) \neq 0$ , then

$E_{H} (0 ★^{L} g) + P_{H}^{g} (L) E_{H |^{g} L} (f) = E_{H} (0 ★^{L} g) + P_{H}^{g} (L) ({inf}_{(m, b) \in H |^{g} L} (m (f) + b))$

$= E_{H} (0 ★^{L} g) + P_{H}^{g} (L) ({inf}_{(m, b) \in H} ((\frac{1}{P_{H}^{g} (L)} m \cdot L) (f) + \frac{1}{P_{H}^{g} (L)} (b + m (0 ★^{L} g) - E_{H} (0 ★^{L} g))))$

$= E_{H} (0 ★^{L} g) + {inf}_{(m, b) \in H} ((m \cdot L) (f) + b + m (0 ★^{L} g) - E_{H} (0 ★^{L} g))$

$= {inf}_{(m, b) \in H} ((m \cdot L) (f) + b + m (0 ★^{L} g))$

$= {inf}_{(m, b) \in H} (m (f ★^{L} 0) + b + m (0 ★^{L} g)) = {inf}_{(m, b) \in H} (m (f ★^{L} g) + b) = E_{H} (f ★^{L} g)$

Now, if $P_{H}^{g} (L) = 0$ , then $E_{H} (1 ★^{L} g) = E_{H} (0 ★^{L} g)$ so, for any $f \in C (X, [0, 1])$ , $(1 ★^{L} g) \geq (f ★^{L} g) \geq (0 ★^{L} g)$ by monotonicity for the $h$ induced by $H$ , and $h (1 ★^{L} g) = h (0 ★^{L} g)$ , so $h (f ★^{L} g) = h (0 ★^{L} g)$ . Therefore,

$E_{H} (0 ★^{L} g) + P_{H}^{g} (L) E_{H |^{g} L} (f) = E_{H} (0 ★^{L} g) + 0 = E_{H} (f ★^{L} g)$

and we get our same result.

Proposition 15: $(H |^{g} L) |^{g^{'}} L^{'} = H |^{⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠} L L^{'}$

Proof sketch: First, we do some shuffling around of the stars to get a lemma that will help. Then, we can use the link between updated sets and their associated concave functionals h, getting the identity purely on the concave functional level, where it's much easier to approach.

Proof: First, the star shuffling. For any $f, g, g^{'}, L, L^{'} \in C (X, [0, 1])$ , we'll show that

$f ★^{L L^{'}} (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'}) = (f ★^{L^{'}} g^{'}) ★^{L} g$ .

Let's begin. First, let's deal with points $x$ where $L (x) = L^{'} (x) = 1$ , because that gets you a divide-by-zero error.

$(f ★^{L L^{'}} (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'})) (x) = L (x) L^{'} (x) f (x) + (1 - L (x) L^{'} (x)) (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'}) (x)$

$= L (x) L^{'} (x) f (x) + 0 + 0 = L (x) L^{'} (x) f (x) + L (x) \cdot 0 \cdot g^{'} (x) + 0 \cdot g (x)$

$= L (x) L^{'} (x) f (x) + L (x) (1 - L^{'} (x)) g^{'} (x) + (1 - L (x)) g (x)$

$= L (x) (L^{'} (x) f (x) + (1 - L^{'} (x)) g^{'} (x)) + (1 - L (x)) g (x)$

$= ((L^{'} f + (1 - L^{'}) g^{'}) ★^{L} g) (x) = ((f ★^{L^{'}} g^{'}) ★^{L} g) (x)$

and we're done with the divide-by-zero case. In the other case, we can safely assume there's no divide-by-zero errors.

$f ★^{L L^{'}} (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'}) = L L^{'} f + (1 - L L^{'}) (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'})$

$= L L^{'} f + (1 - L L^{'}) (\frac{1 - L}{1 - L L^{'}} g + (1 - \frac{1 - L}{1 - L L^{'}}) g^{'})$

$= L L^{'} f + (1 - L L^{'}) (\frac{1 - L}{1 - L L^{'}} g + (\frac{1 - L L^{'} - 1 + L}{1 - L L^{'}}) g^{'})$

$= L L^{'} f + (1 - L) g + (1 - L L^{'} - 1 + L) g^{'} = L L^{'} f + (1 - L) g + L (1 - L^{'}) g^{'}$

$= L (L^{'} f + (1 - L^{'}) g^{'}) + (1 - L) g = (L^{'} f + (1 - L^{'}) g^{'}) ★^{L} g = (f ★^{L^{'}} g) ★^{L} g$

Ok, so we've established our crucial $f ★^{L L^{'}} (g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'}) = (f ★^{L^{'}} g^{'}) ★^{L} g$ identity. Let's proceed. Updates for concave functionals are: $(h |^{g} L) (f) = \frac{h (f ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (1 ★^{L} g)}$

Importing Proposition 14, $E_{H} (f ★^{L} g) = E_{H} (0 ★^{L} g) + P_{H}^{g} (L) E_{H |^{g} L} (f)$ and rearranging it (and unpacking the definition of $P_{H}^{g} (L)$ ), we get $E_{H |^{g} L} (f) = \frac{E_{H} (f ★^{L} g) - E_{H} (0 ★^{L} g)}{E_{H} (1 ★^{L} g) - E_{H} (0 ★^{L} g)}$

So, updating fulfills the positive functional definition of update, because this transfers into $(h |^{g} L) (f) = \frac{h (f ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (0 ★^{L} g)}$ which is exactly our concave functional definition of updating. So, in order to verify that the two updates equal the one big update, we could just show that their concave functional definitions are equivalent. $(H |^{g} L) |^{g^{'}} L^{'}$ would, on the concave functional level, turn into:

$((h |^{g} L) |^{g^{'}} L) (f) = \frac{(h |^{g} L) (f ★^{L^{'}} g^{'}) - (h |^{g} L) (0 ★^{L^{'}} g^{'})}{(h |^{g} L) (1 ★^{L^{'}} g^{'}) - (h |^{g} L) (0 ★^{L^{'}} g^{'})}$

$= \frac{\frac{h ((f ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (0 ★^{L} g)} - \frac{h ((0 ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (0 ★^{L} g)}}{\frac{h ((1 ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (0 ★^{L} g)} - \frac{h ((0 ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g)}{h (1 ★^{L} g) - h (0 ★^{L} g)}}$

$= \frac{h ((f ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g) - h ((0 ★^{L^{'}} g^{'}) ★^{L} g) + h (0 ★^{L} g)}{h ((1 ★^{L^{'}} g^{'}) ★^{L} g) - h (0 ★^{L} g) - h ((0 ★^{L^{'}} g^{'}) ★^{L} g) + h (0 ★^{L} g)}$

$= \frac{h ((f ★^{L^{'}} g^{'}) ★^{L} g) - h ((0 ★^{L^{'}} g^{'}) ★^{L} g)}{h ((1 ★^{L^{'}} g^{'}) ★^{L} g) - h ((0 ★^{L^{'}} g^{'}) ★^{L} g)}$

and now we can use our earlier star identity to rewrite as:

$= \frac{h ⎛ ⎝ f ★^{L L^{'}} ⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠ ⎞ ⎠ - h ⎛ ⎝ 0 ★^{L L^{'}} ⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠ ⎞ ⎠}{h ⎛ ⎝ 1 ★^{L L^{'}} ⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠ ⎞ ⎠ - h ⎛ ⎝ 0 ★^{L L^{'}} ⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠ ⎞ ⎠}$

$= ⎛ ⎜ ⎜ ⎝ h |^{⎛ ⎝ g ★^{\frac{1 - L}{1 - L L^{'}}} g^{'} ⎞ ⎠} L L^{'} ⎞ ⎟ ⎟ ⎠ (f)$

establishing our identity of updating twice, vs one big update of a different form.

Corollary 2: Regardless of L and $L^{'}$ and $g$ , then $(H |^{g} L) |^{g} L^{'} = H |^{g} (L L^{'})$

Just use Proposition 15, and notice that: $g ★^{\frac{1 - L}{1 - L L^{'}}} g = \frac{1 - L}{1 - L L^{'}} g + (1 - \frac{1 - L}{1 - L L^{'}}) g = g$ getting us our result.

Corollary 3: If $Y$ and $Z$ are clopen sets, then, abusing notation by glossing over the difference between indicator functions and sets, $(H |^{g} Y) |^{g} Z = H |^{g} (Y \cap Z)$

Invoke Corollary 2, and observe that $1_{Y} \cdot 1_{Z} = 1_{Y \cap Z}$ .

Lemma 10: $P_{E_{ζ} H_{i}}^{g} (L) = E_{ζ} (P_{H_{i}}^{g} (L))$

Proof: Invoke Proposition 10 to go:

$P_{E_{ζ} H_{i}}^{g} (L) = E_{E_{ζ} H_{n}} (1 ★^{L} g) - E_{E_{ζ} H_{i}} (0 ★^{L} g) = E_{ζ} (E_{H_{i}} (1 ★^{L} g)) - E_{ζ} (E_{H_{i}} (0 ★^{L} g))$

$= E_{ζ} (E_{H_{i}} (1 ★^{L} g) - E_{H_{i}} (0 ★^{L} g)) = E_{ζ} (P_{H_{n}}^{g} (L))$

Theorem 6: $(E_{ζ} H_{i}) |^{g} L = \frac{E_{ζ} (P_{H_{i}}^{g} (L) \cdot (H_{i} |^{g} L))}{E_{ζ} (P_{H_{i}}^{g} (L))}$ If the update doesn't fail.

Proof: Let $ζ^{'}$ be defined as $ζ_{i}^{'} := \frac{ζ_{i} P_{H_{i}}^{g} (L)}{\sum_{j} ζ_{j} P_{H_{j}}^{g} (L)}$ It is a probability distribution, because if all $P_{H_{i}}^{g} (L) = 0$ , then $E_{ζ} P_{H_{i}}^{g} (L) = 0$ , and so by Lemma 10, $P_{E_{ζ} H_{i}}^{g} (L) = 0$ , which would cause the update to fail.

The left-hand-side corresponds to $(E_{ζ} h_{i}) |^{g} L$ on the concave functional level, and the right-hand-side corresponds to $E_{ζ^{'}} (h_{i} |^{g} L)$ on the concave functional level. Let's begin unpacking. Lemma 10 will be used throughout, as well as the definition of $P_{H_{i}}^{g} (L)$ .

$(E_{ζ^{'}} (h_{i} |^{g} L)) (f) = E_{ζ^{'}} ((h_{i} |^{g} L) (f)) = \sum_{i} (\frac{ζ_{i} P_{H_{i}}^{g} (L)}{\sum_{j} ζ_{j} P_{H_{j}}^{g} (L)} \frac{h_{i} (f ★^{L} g) - h_{i} (0 ★^{L} g)}{h_{i} (1 ★^{L} g) - h_{i} (0 ★^{L} g)})$

$= \sum_{i} (\frac{ζ_{i} P_{H_{i}}^{g} (L)}{\sum_{j} ζ_{j} P_{H_{j}}^{g} (L)} \frac{h_{i} (f ★^{L} g) - h_{i} (0 ★^{L} g)}{P_{H_{i}}^{g} (L)}) = \sum_{i} (\frac{ζ_{i} (h_{i} (f ★^{L} g) - h_{i} (0 ★^{L} g))}{\sum_{j} ζ_{j} P_{H_{j}}^{g} (L)})$

$= \frac{\sum_{i} ζ_{i} (h_{i} (f ★^{L} g) - h_{i} (0 ★^{L} g))}{E_{ζ} P_{H_{j}}^{g} (L)} = \frac{E_{ζ} (h_{i} (f ★^{L} g) - h_{i} (0 ★^{L} g))}{P_{E_{ζ} H_{i}}^{g} (L)}$

$= \frac{E_{ζ} (h_{i} (f ★^{L} g)) - E_{ζ} (h_{i} (0 ★^{L} g))}{E_{ζ} (h_{i} (1 ★^{L} g)) - E_{ζ} (h_{i} (0 ★^{L} g))} = \frac{(E_{ζ} h_{i}) (f ★^{L} g) - (E_{ζ} h_{i}) (0 ★^{L} g)}{(E_{ζ} h_{i}) (1 ★^{L} g) - (E_{ζ} h_{i}) (0 ★^{L} g)} = ((E_{ζ} h_{i}) |^{g} L) (f)$

So, $(E_{ζ} h_{i}) |^{g} L = E_{ζ^{'}} (h_{i} |^{g} L)$ as desired, which shows our result.

AI ALIGNMENT FORUM
AF

AI ALIGNMENT FORUM
AF

4

Proofs Section 1.2 (Mixtures, Updates, Pushforwards)

4