← Latest papers
🔢 mathematics

Functional inequalities for Boolean entropy

This paper extends the framework of Boolean entropy by defining Boolean Fisher information and Stein discrepancy, establishing their monotonicity and associated functional inequalities (including logarithmic Sobolev and Berry-Esseen bounds) within the context of the Boolean Central Limit Theorem.

Original authors: Guillaume Cébron, Kewei Pan

Published 2026-03-02
📖 5 min read🧠 Deep dive

Original authors: Guillaume Cébron, Kewei Pan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a chef trying to perfect a soup. You have a "perfect" soup recipe (let's call it the Rademacher distribution, which is like a soup that is exactly half spicy and half sweet, perfectly balanced). You have a bunch of other soups (random variables) that are a bit messy, too salty, or not mixed well.

Your goal is to figure out:

  1. How far off is my soup from the perfect one?
  2. How fast will it become perfect if I keep stirring it?
  3. Can I measure the "chaos" or "order" of my soup in a way that helps me improve it?

This paper is about developing a new set of measuring cups and thermometers for a very specific, abstract type of math called Boolean Probability. Think of this as a new, quirky kitchen where the rules of mixing ingredients are different from our normal world (classical probability) or even a "free" world (free probability).

Here is the breakdown of their discoveries using everyday analogies:

1. The New Kitchen: Boolean Independence

In our normal world, if you mix two soups, the flavors blend together. In this "Boolean" kitchen, the rules are stricter. When you mix two ingredients, they don't really blend; they sit next to each other, and the total flavor is just a specific sum of their individual parts. It's like stacking two distinct blocks of cheese rather than melting them into a sauce.

The authors are building a theory of Entropy (a measure of disorder or uncertainty) and Fisher Information (a measure of how much information you have about the shape of the soup) specifically for this Boolean kitchen.

2. Two Ways to Measure the Soup: Microstates vs. Non-Microstates

The authors introduce two different ways to measure the "quality" of the soup.

  • The Microstates Approach (The "Detailed Inspection"):
    Imagine you are a food critic who looks at every single molecule in the soup to determine its quality. This method is very detailed and complex. It involves looking at how the soup behaves when you simulate it with giant, complex machines (random matrices).

    • The Result: They found a "Boolean Fisher Information" that acts like a thermometer. As you stir the soup (using a process called the Boolean Central Limit Theorem), this thermometer shows that the soup is getting more ordered and closer to the perfect recipe.
  • The Non-Microstates Approach (The "Quick Glance"):
    Imagine a simpler method where you just take a quick sample and do a quick calculation. This method ignores the complex machinery and looks at the soup's intrinsic properties.

    • The Result: Surprisingly, in this Boolean kitchen, the "Quick Glance" method is actually simpler and more rigid than the detailed one. The formulas turn into neat, exact equations rather than messy inequalities. It's like finding that in this specific kitchen, the soup always follows a perfect mathematical rhythm that you can predict instantly.

3. The "Stirring" Process: The Ornstein-Uhlenbeck Flow

To see if the soup gets better, the authors imagine a magical stirring process (the Ornstein-Uhlenbeck process).

  • You start with a messy soup.
  • You slowly add a bit of the "perfect" soup and stir.
  • Over time, your messy soup transforms into the perfect soup.

The authors proved that as you stir, the "disorder" (Entropy) goes down, and the "information" (Fisher Information) behaves in a predictable way. They established a Log-Sobolev Inequality, which is essentially a rule saying: "The faster your soup is currently changing (high Fisher Information), the faster it will reach perfection."

4. The "Stein Discrepancy": The Ultimate Quality Check

In the final section, the authors introduce a new tool called Stein Discrepancy.

  • The Metaphor: Imagine you have a "perfect mold" (the Rademacher distribution). You pour your soup into this mold. If the soup fits perfectly, the "discrepancy" is zero. If it spills over or leaves gaps, the discrepancy is high.
  • The Discovery: They proved that this "spillage" (discrepancy) is a powerful predictor.
    • If your soup has a low discrepancy, it is very close to the perfect soup.
    • They used this to prove a Berry-Esseen bound. In plain English: "We can now calculate exactly how many times you need to stir (or how many ingredients you need to mix) before your soup is indistinguishable from the perfect one."

5. The Big Picture: A Hierarchy of Rules

The paper draws a map (Figure 1 in the text) showing how all these measurements relate to each other.

  • Distance (Wasserstein): How far is the soup from the perfect recipe?
  • Entropy: How chaotic is the soup?
  • Fisher Information: How much "signal" is in the soup?
  • Stein Discrepancy: How much does the soup spill out of the perfect mold?

The authors showed that all these concepts are linked. If you know one (like the spillage), you can estimate the others (like the distance to perfection). They proved that in the Boolean world, these relationships look very similar to the rules in our normal world and the "free" world, suggesting a deep, universal structure to how randomness works.

Summary

This paper is about building a complete toolkit for measuring randomness in a specific, abstract mathematical world (Boolean probability).

  1. They defined Entropy and Fisher Information for this world.
  2. They showed how these quantities behave when you mix ingredients (the Central Limit Theorem).
  3. They proved that the "messiness" of the mixture decreases predictably as you mix more ingredients.
  4. They created a new "quality check" (Stein Discrepancy) that tells you exactly how close you are to the perfect result.

It's like writing the ultimate cookbook for a strange, new type of cooking, proving that even in this weird kitchen, there are strict, beautiful laws governing how flavors (and probabilities) mix together.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →