The Blackwell relation defines no lattice
classification
💻 cs.IT
math.ITmath.STstat.TH
keywords
blackwellboundslatticechannelscorrespondingdefinesequivalenceexist
read the original abstract
Blackwell's theorem shows the equivalence of two preorders on the set of information channels. Here, we restate, and slightly generalize, his result in terms of random variables. Furthermore, we prove that the corresponding partial order is not a lattice; that is, least upper bounds and greatest lower bounds do not exist.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.