These are some notes relating to my talk about convex spaces and probability theory.
Intuitively, a convex space is a space closed under convex combinations. Precisely, we consider a set X equipped with a mixture operation μ:ΔX→X from the space ΔX≜{f:X→R≥0:|supp(f)|<∞and∑xf(x)=1} of formal finitary convex combinations of X's elements to X. We say that X is a convex space provided that μ(x↦δx,y)=y for each y∈Y and that μ(∑i∈Icifi)=μ(x↦∑i∈Iciδx,μ(fi)) for all finite I and all sequences of ci∈R≥0 and fi for which the two sides are defined. Each valid μ is determined by its restriction to functions with size-2 support, so we will sometimes conflate μ and this restriction, and for convenience we will sometimes write μ(x↦αδx,v+(1−α)δx,w)∈X as αv+(1−α)w∈X when v,w∈X.
The morphisms in the category of convex spaces are those that preserve μ. More precisely, we observe that Δ is an endofunctor on the category of Sets, and we declare the morphisms from (X,μX) to (Y,μY) to be those functions T:X→Y such that T∘μX=μY∘Δ(T). We have defined a category. We could have defined the category in fewer words --- as the Eilenberge Moore category for Δ --- but we choose here to be very concrete.
Not every convex space is a subspace of some Rn. A source of examples comes from the semilattices, i.e. the posets X with binary joins ∨: a canonical mixture operation on X is determined by is determined by the rule αv+(1−α)w≜v∨w as v,w range through X and α ranges through (0,1). For example, say X={no,maybe,yes}, where no,yes<maybe. Then we have (1/3)no+(2/3)yes=maybe and (4/7)no+(3/7)maybe=maybe. This is a space not of probabilities but of possibilities! Likewise, if X={zero,poly,exp} with zero<poly<exp, then we have (2/5)zero+(3/5)poly=poly and (5/6)poly+(1/6)exp=exp: we have a space of sizes.
I figured out this stuff by myself and for fun. As usual, I found out that others had thought of isomorphic ideas before me:
FILL IN