Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Properties of the mixing entropy

Proved
AssumptionsOfPhysics.mixingEntropy_properties

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

convexityfoundations-of-physicsmathematical-physics

The mixing entropy satisfies: (1) MS(a,b)≥0MS(a,b)\ge0MS(a,b)≥0; (2) MS(a,b)=0MS(a,b)=0MS(a,b)=0 iff a=ba=ba=b; (3) MS(a,b)≤I(12,12)MS(a,b)\le I(\tfrac12,\tfrac12)MS(a,b)≤I(21​,21​); (5) MS(a,b)=MS(b,a)MS(a,b)=MS(b,a)MS(a,b)=MS(b,a). (The book states (3) as MS≤1MS\le 1MS≤1 using the normalization I(12,12)=1I(\tfrac12,\tfrac12)=1I(21​,21​)=1 of Theorem 4.59, and also lists (4) MS=1  ⟺  a⊥bMS=1\iff a\perp bMS=1⟺a⊥b; (4) is not included here.)

Preamble
import Mathlib
import Definitions.Def_AoP_EnsembleSpaces
Formal statement
namespace AssumptionsOfPhysics
theorem mixingEntropy_properties {I : ℝ → ℝ → ℝ} {E : Type*} [TopologicalSpace E]
    (X : EnsembleSpace I E) :
    (∀ a b : E, 0 ≤ X.mixingEntropy a b) ∧ (∀ a b : E, X.mixingEntropy a b = 0 ↔ a = b) ∧
      (∀ a b : E, X.mixingEntropy a b ≤ I (1 / 2) (1 / 2)) ∧
      (∀ a b : E, X.mixingEntropy a b = X.mixingEntropy b a) := by sorry
end AssumptionsOfPhysics
Source
G. Carcassi, C. A. Aidala, Assumptions of Physics, Ver. 3.0 (Dec 31, 2025), https://assumptionsofphysics.org/book — Part II, Chapter 4 (pp. 197–284), Proposition 4.116, p. 245; Definition 4.115, p. 245
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements, with full knowledge of the source text and of the intended meaning. It was not produced by a blind, independent auditor, so it must not be mistaken for independent testimony; reviewers should compare the Lean code against the source themselves.

Setting (common to all statements of this mission). I:R×R→RI:\mathbb R\times\mathbb R\to\mathbb RI:R×R→R is an arbitrary function and EEE an arbitrary topological space. XXX is an ensemble space with bound III on EEE, consisting of:

  • the topology of EEE is T0T_0T0​ and second countable;
  • a mixing map (p,a,b)↦pa+pˉb(p,a,b)\mapsto pa+\bar pb(p,a,b)↦pa+pˉ​b for p∈[0,1]p\in[0,1]p∈[0,1] (pˉ=1−p\bar p=1-ppˉ​=1−p), jointly continuous on [0,1]×E×E[0,1]\times E\times E[0,1]×E×E, with 1a+0b=a1a+0b=a1a+0b=a, pa+pˉa=apa+\bar pa=apa+pˉ​a=a, pa+pˉb=pˉb+papa+\bar pb=\bar pb+papa+pˉ​b=pˉ​b+pa, and the associativity identity p1e1+pˉ1(1−p1−p3pˉ1e2+p3pˉ1e3)=pˉ3(p1pˉ3e1+1−p1−p3pˉ3e2)+p3e3p_1e_1+\bar p_1\big(\tfrac{1-p_1-p_3}{\bar p_1}e_2+\tfrac{p_3}{\bar p_1}e_3\big)=\bar p_3\big(\tfrac{p_1}{\bar p_3}e_1+\tfrac{1-p_1-p_3}{\bar p_3}e_2\big)+p_3e_3p1​e1​+pˉ​1​(pˉ​1​1−p1​−p3​​e2​+pˉ​1​p3​​e3​)=pˉ​3​(pˉ​3​p1​​e1​+pˉ​3​1−p1​−p3​​e2​)+p3​e3​ for p1,p3∈[0,1)p_1,p_3\in[0,1)p1​,p3​∈[0,1), p1+p3≤1p_1+p_3\le1p1​+p3​≤1;
  • a continuous entropy S:E→RS:E\to\mathbb RS:E→R such that for all p∈(0,1)p\in(0,1)p∈(0,1): S(pa+pˉb)≥pS(a)+pˉS(b)S(pa+\bar pb)\ge pS(a)+\bar pS(b)S(pa+pˉ​b)≥pS(a)+pˉ​S(b), with equality iff a=ba=ba=b; for all p∈[0,1]p\in[0,1]p∈[0,1]: S(pa+pˉb)≤I(p,pˉ)+pS(a)+pˉS(b)S(pa+\bar pb)\le I(p,\bar p)+pS(a)+\bar pS(b)S(pa+pˉ​b)≤I(p,pˉ​)+pS(a)+pˉ​S(b);
  • writing a⊥ba\perp ba⊥b for "S(qa+qˉb)=I(q,qˉ)+qS(a)+qˉS(b)S(qa+\bar qb)=I(q,\bar q)+qS(a)+\bar qS(b)S(qa+qˉ​b)=I(q,qˉ​)+qS(a)+qˉ​S(b) for every q∈(0,1)q\in(0,1)q∈(0,1)": for all p∈(0,1)p\in(0,1)p∈(0,1) and a,b,ca,b,ca,b,c, (a⊥ba\perp ba⊥b and a⊥ca\perp ca⊥c) iff a⊥(pb+pˉc)a\perp(pb+\bar pc)a⊥(pb+pˉ​c).

Component: ccc is a component of aaa if a=pc+pˉda=pc+\bar pda=pc+pˉ​d for some d∈Ed\in Ed∈E and some p∈(0,1]p\in(0,1]p∈(0,1]. Separate: no common component. Mixing entropy: MS(a,b)=S(12a+12b)−12S(a)−12S(b)MS(a,b)=S(\tfrac12a+\tfrac12b)-\tfrac12S(a)-\tfrac12S(b)MS(a,b)=S(21​a+21​b)−21​S(a)−21​S(b).

Statement. For every III, topological space EEE and ensemble space XXX with bound III on EEE, for all a,b∈Ea,b\in Ea,b∈E: (1) MS(a,b)≥0MS(a,b)\ge0MS(a,b)≥0; (2) MS(a,b)=0MS(a,b)=0MS(a,b)=0 iff a=ba=ba=b; (3) MS(a,b)≤I(12,12)MS(a,b)\le I(\tfrac12,\tfrac12)MS(a,b)≤I(21​,21​); (4) MS(a,b)=MS(b,a)MS(a,b)=MS(b,a)MS(a,b)=MS(b,a). Here MS(a,b)=S(12a+12b)−12S(a)−12S(b)MS(a,b)=S(\tfrac12a+\tfrac12b)-\tfrac12S(a)-\tfrac12S(b)MS(a,b)=S(21​a+21​b)−21​S(a)−21​S(b).

Human review
  • Endorsed by Shuze Chen · Oct 2, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 2, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me