Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Proposition 1.35 — monodecomposability and separateness

Proved
EnsembleSpaceDraft.monodecomposable_iff_mixtures_preserve_separateness

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

convexityfoundations-of-physicsmathematical-physicstopology

An ensemble space is monodecomposable if and only if mixtures preserve separateness in it.

The space is monodecomposable when every decomposable ensemble is monodecomposable: whenever e=pa+pˉbe=pa+\bar p be=pa+pˉ​b with p∈(0,1)p\in(0,1)p∈(0,1) and a≠ba\neq ba=b, there do not exist two decompositions

e=pa1+pˉa2=qb1+qˉb2e=p a_1+\bar p a_2=q b_1+\bar q b_2e=pa1​+pˉ​a2​=qb1​+qˉ​b2​

with coefficients in (0,1)(0,1)(0,1), distinct summands, and a1a_1a1​ separate from both b1b_1b1​ and b2b_2b2​ (Definitions 1.31 and 1.33).

Mixtures preserve separateness when eee separate from aaa and from bbb implies eee separate from pa+pˉbpa+\bar p bpa+pˉ​b for every p∈[0,1]p\in[0,1]p∈[0,1] (Definition 1.28).

This is Proposition 1.35, the convex characterization of that uniqueness of decomposition. No entropy, finite-dimensionality, or model hypothesis (classical or quantum) is used.

Preamble
import Definitions.Def_EnsembleSpaceDraft_axioms
import Mathlib

open scoped unitInterval
Formal statement
namespace EnsembleSpaceDraft

universe u

/-- Proposition 1.35. An ensemble space is monodecomposable if and only if mixtures
preserve separateness. -/
theorem monodecomposable_iff_mixtures_preserve_separateness {E : Type u} [TopologicalSpace E]
    (X : EnsembleSpace E) :
    X.Monodecomposable ↔ X.MixturesPreserveSeparateness := by
  sorry

end EnsembleSpaceDraft
Source
G. Carcassi, C. A. Aidala, Ensemble spaces, draft of 12 October 2026, Chapter 1. Generated from https://github.com/assumptionsofphysics/book (art_pm_EnsembleSpaces). Proposition 1.35, pp. 26–27; Definitions 1.28, 1.31 and 1.33.
Human review
  • Endorsed by Shuze Chen · Oct 18, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 18, 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