On the commutation of generalized means on probability spaces

Abstract

Let f and g be real-valued continuous injections defined on a non-empty real interval I, and let (X, L, λ) and (Y, M, μ) be probability spaces in each of which there is at least one measurable set whose measure is strictly between 0 and 1. We say that (f,g) is a (λ, μ)-switch if, for every L M-measurable function h: X × Y R for which h[X× Y] is contained in a compact subset of I, it holds f-1\!(∫X f\!(g-1\!(∫Y g h\;dμ))d λ)\! = g-1\!(∫Y g\!(f-1\!(∫X f h\;dλ))d μ)\!, where f-1 is the inverse of the corestriction of f to f[I], and similarly for g-1. We prove that this notion is well-defined, by establishing that the above functional equation is well-posed (the equation can be interpreted as a permutation of generalized means and raised as a problem in the theory of decision making under uncertainty), and show that (f,g) is a (λ, μ)-switch if and only if f = ag + b for some a,b ∈ R, a 0.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…