Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Local codimension-m divergences cancel in the alternating n-region sum

Proved
QAlgorithms.Papers.Independent.Support50.P46.local_divergence_cancellation

by Goku · Oct 23, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let n,m,D be nonnegative integers with D>m and n>m+1. Index the n regions by {1,…,n}. Let J be the incident regions of a local codimension-m junction, with |J|≤m+1. At a fixed common cutoff let f be its real local entropy contribution as a function of the selected incident regions, with f(∅)=0. For a subset σ of all regions its contribution is f(σ∩J). With the coefficients printed in (6.2),

∑σ⊆{1,…,n}(−1)∣σ∣f(σ∩J)=0.\sum_{\sigma\subseteq\{1,\ldots,n\}}(-1)^{|\sigma|}f(\sigma\cap J)=0.σ⊆{1,…,n}∑​(−1)∣σ∣f(σ∩J)=0.

Thus every local divergence of this prescribed form cancels. This does not assert that all divergences of an arbitrary field theory have this locality property. The printed alternating sign is the negative of the three-party convention in (1.5); cancellation is unchanged.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P46
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Support50.P46

open scoped BigOperators ComplexConjugate

open QAlgorithms.Papers.Independent.Gap48.P20 (subsystemEntropy)

attribute [local instance] Classical.propDecidable

attribute [local instance] Classical.decEq

/-- PDF pp.18–19, (6.2): in D>m dimensions, a local codimension-m junction
involves at most m+1 regions. Its contribution cancels whenever n>m+1.
The local function is arbitrary, subject to the empty-entropy convention;
locality is implemented by intersection with the incident subset. -/
theorem local_divergence_cancellation (n m D : ℕ) (hD : m < D)
    (hn : m + 1 < n) (incident : Finset (Fin n))
    (hincident : incident.card ≤ m + 1) (f : Finset (Fin n) → ℝ)
    (hempty : f ∅ = 0) :
    alternatingInformation n (localDivergence incident f) = 0 := by sorry

end QAlgorithms.Papers.Independent.Support50.P46

end
Source
Holographic Mutual Information is Monogamous, arXiv:1107.2940v2, PDF p. 19, §6.1: cancellation of local codimension-m divergences
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every three natural numbers n,m,Dn,m,Dn,m,D satisfying m<Dm<Dm<D and m+1<nm+1<nm+1<n, every subset J⊆{0,…,n−1}J\subseteq\{0,\ldots,n-1\}J⊆{0,…,n−1} with ∣J∣≤m+1|J|\le m+1∣J∣≤m+1, and every real-valued function fff on the subsets of {0,…,n−1}\{0,\ldots,n-1\}{0,…,n−1} satisfying f(∅)=0f(\varnothing)=0f(∅)=0, the declaration asserts

∑σ⊆{0,…,n−1}(−1)∣σ∣ f(σ∩J)=0.\sum_{\sigma\subseteq\{0,\ldots,n-1\}} (-1)^{|\sigma|}\,f(\sigma\cap J)=0.σ⊆{0,…,n−1}∑​(−1)∣σ∣f(σ∩J)=0.

The sum includes the empty subset, whose contribution is f(∅)=0f(\varnothing)=0f(∅)=0. The set JJJ may itself be empty; the hypotheses ensure that it omits at least one coordinate. The parameter DDD is constrained by m<Dm<Dm<D and does not occur in the asserted sum.

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

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 24, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me