The universal logic of repeated experiments

This paper constructs a universal logic $\mathsf{U}_{\kappa}(\mathsf{E})$ representing the event space of a $\kappa$-times repeated experiment for any general orthocomplemented complete lattice $\mathsf{E}$, extending the classical Boolean result to non-distributive logics and defining tensor products for families of such lattices.

The Gist

The Big Question: What happens when you repeat a test?

Imagine you have a simple experiment, like flipping a coin.

• The Event Space: This is the list of all possible things you can say about the result. For a coin, your "logic" might just be: "Heads," "Tails," "Heads or Tails," and "Nothing happened."
• The Classical Case: If your experiment is simple and predictable (like a coin), the rules of logic are standard. If you flip the coin 10 times, the new list of possibilities is just a giant grid of all the combinations (Heads-Heads, Heads-Tails, etc.). This is well-understood math.

The Problem: What if your experiment is weird? What if it's a quantum physics experiment where the rules of logic are broken (non-distributive)? In the quantum world, "A or B" doesn't always behave like "A plus B."

The paper asks: If you take a weird, non-standard experiment and repeat it over and over again (even infinitely), what does the new "logic" look like?

The Solution: Building a "Universal" Logic Machine

The author, Sergio Grillo, builds a mathematical machine called $U_\kappa(E)$. Think of this as a "Universal Logic Factory."

1. The Input ($E$): You feed in the rules of your original experiment (the "event space"). This could be a normal coin flip or a weird quantum particle.
2. The Process: The machine takes that single experiment and simulates it being repeated $\kappa$ times (where $\kappa$ is any number, from 1 to infinity).
3. The Output ($U_\kappa(E)$): The machine spits out a brand new, complete set of rules for the repeated experiment.

Why is it "Universal"?
Imagine you are building a house. You have a specific blueprint for the foundation ($E$). You want to know what the whole house looks like if you stack 100 floors on top of it.

• Grillo's machine builds the most complete possible version of that 100-story house.
• If someone else claims to have a different version of the 100-story house, Grillo's version is the "master copy." Their version is just a simplified or "shrunken" version of his. You can always map his master copy onto their version, but not necessarily the other way around.

The Magic Ingredients

To build this machine, Grillo uses a few clever tricks:

• The "Or" Operation (Join): In normal logic, if you say "Heads OR Tails," you get a big set. In his machine, he creates a new way to combine events from different repetitions. He treats the repeated experiment like a giant puzzle where every piece is a sequence of outcomes.
• The "Not" Operation (Negation): This is the hardest part. In quantum logic, "Not A" is tricky. Grillo defines a special "negation" for the repeated experiment. He shows that if you take an event, negate it, and then negate it again, you might not get exactly what you started with (unless the original logic was simple).
• The "Closure" (The Filter): Because the machine creates so many complex combinations, some are redundant or "impossible" in a logical sense. Grillo applies a filter (a "closure operator") to clean up the list. He keeps only the events that are logically stable. This cleaned-up list is the final Universal Logic.

The Key Discovery: The "Distributive" Test

The paper proves a very important "If and Only If" rule:

• If your original experiment follows standard, simple logic (distributive, like a coin), then the repeated experiment will also follow standard logic.
• If your original experiment is weird and breaks the rules (non-distributive, like quantum mechanics), then the repeated experiment will also be weird and break the rules.

The Analogy:
Think of the original experiment as a type of clay.

• If the clay is Play-Doh (flexible, standard), making a tower of Play-Doh will still be Play-Doh.
• If the clay is Glass (brittle, weird), making a tower of glass will still be glass. You can't turn glass into Play-Doh just by stacking it. The fundamental nature of the material (the logic) stays the same, no matter how many times you repeat the experiment.

The "Tensor Product" (The Multi-Flavor Machine)

The paper also extends this idea. What if the experiment changes every time you repeat it?

• Trial 1: Flip a coin.
• Trial 2: Roll a die.
• Trial 3: Spin a wheel.

Grillo shows how to build a machine that handles this too. He calls this a Tensor Product. It's like a universal adapter that takes different types of logic (coins, dice, wheels) and mashes them together into one giant, coherent logic system for the whole sequence.

Why Does This Matter? (According to the Paper)

The author mentions that this work is a stepping stone for Subjective Probability.

• In the real world, we often try to guess the future based on past events (reasonable expectation).
• Famous mathematician R.T. Cox showed how to derive the rules of probability for simple, classical experiments.
• Grillo suggests that his "Universal Logic" machine can help us figure out the rules of probability for weird, quantum-like experiments where the standard rules don't apply. He wants to use this to understand how we form "reasonable expectations" in a universe that might not follow simple logic.

Summary in One Sentence

Sergio Grillo has built a mathematical "universal translator" that takes any experiment (simple or quantum), repeats it infinitely, and generates the perfect, complete set of logical rules for that sequence, proving that the fundamental nature of the logic never changes, no matter how many times you repeat the test.

Technical Summary

1. Problem Statement

The paper addresses a fundamental question in the logic of experiments: Given an experiment with an event space $E$, what is the event space of the same experiment repeated $\kappa$ times (where $\kappa$ is a cardinal)?

• Classical Context: If $E$ is a classical logic (a complete Boolean algebra), the answer is well-known: the event space of the repeated experiment is the complete Boolean algebra generated by the Cartesian product $E^\kappa$.
• General Context: The paper tackles the case where $E$ is a general logic, defined as a complete orthocomplemented lattice (which may be non-distributive, as in Quantum Logic).
• The Challenge: In non-distributive lattices, the standard set-theoretic product does not naturally yield a logic that preserves the structural properties of the original event space while correctly modeling the "OR" and "NOT" operations for repeated trials. The author seeks a constructive, universal solution that works for any countable (or arbitrary) cardinal $\kappa$ and any complete orthocomplemented lattice $E$.

2. Methodology

The author employs a constructive approach based on lattice theory, specifically utilizing free terms, equivalence relations, and closure operators. The methodology proceeds in four main stages:

A. Construction of the Free Lattice $D_\kappa(E)$

1. Terms: The author defines a set of "free terms" $T(E_\kappa)$, which are formal unions (joins) of elements from the Cartesian product $E_\kappa = \prod_{n \in \kappa} E$. Elements of $E_\kappa$ represent sequences of events $(a_1, a_2, \dots)$ where $a_n$ occurs in the $n$-th repetition.
2. Equivalence Relation: An equivalence relation $\sim$ is defined on these terms to enforce logical consistency (e.g., $A \lor A \sim A$, and if $A \subseteq B$, then $A \lor B \sim B$).
3. Quotient Lattice: The quotient $D_\kappa(E) = T(E_\kappa) / \sim$ forms a completely distributive lattice. This lattice serves as an intermediate structure where the join operation is well-defined, but the orthocomplementation (negation) is not yet an involution.

B. Defining Negation and Closure

1. Negation Operation ($*$): A negation operation is defined on $D_\kappa(E)$. For an element $A = (a_1, \dots)$, the negation is constructed using the distributive law to distribute the complement over the sequence.
2. Closure Operator: The operation $A \mapsto A^{**}$ (applying negation twice) is shown to be a closure operator on $D_\kappa(E)$. It is order-preserving, extensive ($A \leq A^{**}$), and idempotent.
3. Universal Logic $U_\kappa(E)$: The universal logic is defined as the image of this closure operator:
   $$U_\kappa(E) = \{ A \in D_\kappa(E) \mid A = A^{**} \}$$
   This subset inherits a complete orthocomplemented lattice structure from $D_\kappa(E)$, where the supremum is given by $(\bigvee S)^{**}$.

C. Extension to Tensor Products

The construction is generalized to the case where the event space changes between repetitions (a family $\{E_\alpha\}_{\alpha \in \kappa}$). This leads to the definition of a tensor product of orthocomplemented complete lattices, denoted $\bigotimes_{\alpha \in \kappa} E_\alpha$, which coincides with $U_\kappa(E)$ when all $E_\alpha$ are identical.

D. Event Space Completion

The paper also addresses the case where the initial event space $L$ is not complete (e.g., a $\sigma$-algebra). A completion procedure $L \to E_L$ is defined using the $\kappa=1$ case of the construction, embedding $L$ into a complete orthocomplemented lattice without adding "artificial" events.

3. Key Contributions and Results

• Universal Construction: The paper provides a rigorous construction of $U_\kappa(E)$, the universal logic of the $\kappa$-times repeated experiment. It is "universal" in the sense that any other logic $F$ representing the repeated experiment must be a quotient (epimorphic image) of $U_\kappa(E)$.
• Distributivity Preservation: A central theorem (Theorem 24) proves that $U_\kappa(E)$ is distributive if and only if $E$ is distributive. This confirms that the construction does not artificially impose classical logic on quantum systems; it preserves the non-distributive nature of quantum event spaces.
• Isomorphism for Single Repetition: For $\kappa = 1$, $U_1(E)$ is isomorphic to the original lattice $E$, ensuring consistency with the base case.
• Tensor Product Presentation: The paper establishes a tensor product formalism for families of logics, satisfying a universal property regarding logic embeddings and meet-join distributivity.
• Epimorphism to Classical Case: If $E$ is a classical Boolean algebra, the constructed $U_\kappa(E)$ maps surjectively (via an epimorphism) to the standard classical event space of repeated experiments (the Boolean algebra generated by $E^\kappa$).

4. Significance

• Foundations of Quantum Probability: The construction provides the necessary mathematical framework to extend Cox's axioms of subjective probability (which currently rely on Boolean algebras) to general non-distributive event spaces. This is crucial for developing a consistent theory of "reasonable expectation" or probability in quantum mechanics.
• Handling Infinite Repetitions: By using the universal logic $U_\kappa(E)$, the paper offers a way to handle the event space of indefinitely repeated experiments. This is particularly relevant for the "density assumption" required in axiomatic probability derivations, which often fails for finite classical experiments but becomes viable in the context of infinite repetitions.
• Unification: It unifies the treatment of classical and quantum experiments under a single lattice-theoretic framework, demonstrating that the logic of repeated experiments is a natural extension of the single-experiment logic, regardless of whether the underlying system is classical or quantum.

5. Conclusion

Sergio Grillo successfully constructs a universal logic $U_\kappa(E)$ for repeated experiments that respects the orthocomplemented structure of the original event space. The work bridges the gap between classical probability theory and quantum logic, offering a robust algebraic tool for future research into the foundations of probability in non-classical physical systems. The construction is shown to be the "most general" solution, with all other valid event spaces for repeated experiments being quotients of this universal structure.