Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Purity / Araki–Lieb complementarity: a region and its boundary

Proved
EmergentGeometry.entropy_complement

by raver1975 · Sep 11, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-catalognovelty

Purity / Araki–Lieb complementarity: a region and its boundary complement carry the same entropy.

theorem EmergentGeometry.entropy_complement(M : HoloModel V) (A : Region V) :
    entropy M (fun v => M.bdry v && !(A v)) = entropy M A := by sorry

Formalization Note Transplanted verbatim from the Aether Catalog source Novelty/EmergentGeometryEntropyCone.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.

Preamble
-- Thm stub generated from Novelty/EmergentGeometryEntropyCone.lean
import Mathlib
import Definitions.Def_Novelty_EmergentGeometryEntropyCone

/-!
# Emergent geometry from entanglement: the min-cut entropy cone

This file develops, from scratch, the mathematics behind the slogan
*"spacetime geometry is built out of entanglement"* in a finite, fully rigorous
setting.

A **bulk geometry** is a finite weighted graph (symmetric, nonnegative weights):
this is the discrete stand-in for a spatial slice of an asymptotically AdS
geometry, the weight of an edge playing the role of the area of the surface
element separating two bulk cells.  Some vertices are declared **boundary**
vertices; these carry the CFT degrees of freedom.

The **entanglement entropy** of a boundary region `A` is the *min-cut*
(Ryu–Takayanagi) prescription: the minimum cut weight over all bulk regions
whose boundary trace is exactly `A`.

The main results proved here are the *holographic entropy inequalities* of this
model, obtained from purely combinatorial (Boolean) pointwise inequalities on
separation indicators:

* `entropy_subadditive`         : `S(A ∪ B) ≤ S(A) + S(B)`
* `entropy_strong_subadditive`  : `S(A∪B) + S(B∪C) ≥ S(A∪B∪C) + S(B)`
* `entropy_monogamy` (**MMI**)  : `S(A∪B)+S(B∪C)+S(A∪C) ≥ S(A)+S(B)+S(C)+S(A∪B∪C)`
* `entropy_complement`          : purity, `S(A) = S(bdry \ A)`

The key technical engine is `cutWeight_comb`: a family of cuts dominates another
family as soon as the corresponding Boolean separation indicators do so
pointwise.  Strong subadditivity comes from submodularity of the cut function
(`sepBit_submodular`), and monogamy from a *minority/union* recombination of
three cuts, whose 64-case Boolean verification is `sepBit_mmi`.
-/

noncomputable section

open EmergentGeometry

open Finset

variable {V : Type*} [Fintype V]

/-! ## Boolean separation indicators -/








/-! ## Bulk geometries and cuts -/










/-! ## Holographic models and min-cut entropy -/

variable [DecidableEq V]
Formal statement
theorem EmergentGeometry.entropy_complement(M : HoloModel V) (A : Region V) :
    entropy M (fun v => M.bdry v && !(A v)) = entropy M A := by sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Novelty/EmergentGeometryEntropyCone.lean#L254

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me