Measuring on Lattices

Previous derivations of the sum and product rules of probability theory relied on the algebraic properties of Boolean logic. Here they are derived within a more general framework based on lattice theory. The result is a new foundation of probability theory that encompasses and generalizes both the Cox and Kolmogorov formulations. In this picture probability is a bi-valuation defined on a lattice of statements that quantifies the degree to which one statement implies another. The sum rule is a constraint equation that ensures that valuations are assigned so as to not violate associativity of the lattice join and meet. The product rule is much more interesting in that there are actually two product rules: one is a constraint equation arises from associativity of the direct products of lattices, and the other a constraint equation derived from associativity of changes of context. The generality of this formalism enables one to derive the traditionally assumed condition of additivity in measure theory, as well introduce a general notion of product. To illustrate the generic utility of this novel lattice-theoretic foundation of measure, the sum and product rules are applied to number theory. Further application of these concepts to understand the foundation of quantum mechanics is described in a joint paper in this proceedings.

💡 Research Summary

The paper presents a novel foundation for probability theory that is rooted in lattice theory rather than the traditional Boolean algebra or measure‑theoretic axioms. The authors introduce the concept of a bi‑valuation v(a, b), a real‑valued function defined on ordered pairs of elements of a lattice L, which quantifies the degree to which statement a implies statement b. In this framework the familiar probability p(A) appears as the special case v(⊤, A), where ⊤ is the lattice’s top element.

The first major result is a derivation of the sum rule directly from the associativity of the lattice join (⊔) and meet (⊓). By requiring that the bi‑valuation be consistent with the lattice’s distributive structure, the authors obtain

 v(a, b⊔c) = v(a, b) + v(a, c) – v(a, b⊓c).

When b and c are disjoint (b⊓c = ⊥) the correction term vanishes and the rule reduces to ordinary additivity. Thus the usual measure‑theoretic axiom of countable additivity emerges as a consequence of lattice algebra rather than an independent postulate.

The paper then identifies two distinct product rules, each arising from a different associativity condition:

1. Direct‑product lattice associativity – For two independent lattices L₁ and L₂, the bi‑valuation on their Cartesian product satisfies

 v₁×₂((a₁,a₂), (b₁,b₂)) = v₁(a₁, b₁)·v₂(a₂, b₂).

This is the natural generalisation of the classical rule P(A∧B)=P(A)P(B) for independent events, but it holds for any pair of lattices, even non‑Boolean or non‑commutative ones.

2. Context‑shift associativity – The authors introduce a transition kernel K(b, c) that encodes how the valuation changes when the underlying context (or conditioning statement) changes from b to c. Consistency with the associativity of successive context changes yields

 v(a, c) = Σ_b v(a, b) K(b, c).

When K is interpreted as a conditional probability, this equation reproduces Bayes’ theorem and the chain rule for conditional probabilities. The kernel must satisfy its own multiplicative associativity, K(b, c⊔d)=K(b, c)·K(b, d), ensuring that sequential context updates are order‑independent.

Together, these two product rules capture both the independence assumption and the full machinery of conditional probability within a single algebraic framework. The authors emphasize that the lattice‑based approach does not require an external measure space; the sum and product constraints are sufficient to guarantee a coherent probabilistic calculus.

To demonstrate the utility of the formalism, the paper applies the derived rules to number theory. By treating properties such as “being prime” and “being composite” as lattice elements, the sum rule yields a corrected counting formula for prime densities, while the direct‑product rule models independence between distinct arithmetic progressions. The context‑shift rule provides a systematic way to compute conditional prime probabilities (e.g., the likelihood that a number is prime given that it lies in a specific residue class), something that traditional probability theory handles only heuristically.

Finally, the authors outline a companion work in which the same lattice‑valued probability is employed to re‑examine the foundations of quantum mechanics. Because quantum observables generate non‑commutative lattices of projection operators, the bi‑valuation framework naturally accommodates non‑Boolean logical structures. The context‑shift product rule, in particular, aligns with the quantum update rule (state collapse) and offers a lattice‑theoretic derivation of the Born rule.

In summary, the paper establishes that probability can be understood as a bi‑valuation on a lattice of statements, with the sum rule emerging from join associativity and two distinct product rules arising from (i) direct‑product lattice associativity and (ii) associativity of context changes. This unifies and extends the Cox and Kolmogorov formulations, provides a rigorous basis for additivity without invoking external measure theory, and opens pathways to applications in number theory and quantum foundations.