Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Linear mutual Renyi response and quadratic mutual information at a product state

Open
QAlgorithms.Papers.Independent.Intakethird100.P41.mutualRenyi_firstOrder

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let AAA and BBB be arbitrary finite regulated Hilbert factors, let ρ^A\widehat\rho_Aρ​A​ and ρ^B\widehat\rho_Bρ​B​ be positive trace-one density matrices, and set ρ0=ρ^A⊗ρ^B\rho_0=\widehat\rho_A\otimes\widehat\rho_Bρ0​=ρ​A​⊗ρ​B​. Let ρ(t)=ρ0+tρ1\rho(t)=\rho_0+t\rho_1ρ(t)=ρ0​+tρ1​ be normalized and positive with unchanged occupied support for sufficiently small real ttt of either sign, where ρ1\rho_1ρ1​ is Hermitian, has trace zero, and has image in the occupied support of ρ0\rho_0ρ0​. Define the actual marginals by ρA(t)=Tr⁡Bρ(t)\rho_A(t)=\operatorname{Tr}_B\rho(t)ρA​(t)=TrB​ρ(t) and ρB(t)=Tr⁡Aρ(t)\rho_B(t)=\operatorname{Tr}_A\rho(t)ρB​(t)=TrA​ρ(t), and put Iα(t)=Sα(ρA(t))+Sα(ρB(t))−Sα(ρ(t))I_\alpha(t)=S_\alpha(\rho_A(t))+S_\alpha(\rho_B(t))-S_\alpha(\rho(t))Iα​(t)=Sα​(ρA​(t))+Sα​(ρB​(t))−Sα​(ρ(t)). For fixed α>0\alpha>0α>0, α≠1\alpha\ne1α=1, define

DX=ρ^Xα−1Tr⁡ρ^Xα−1X(X=A,B).D_X=\frac{\widehat\rho_X^{\alpha-1}}{\operatorname{Tr}\widehat\rho_X^\alpha}-\mathbf1_X\quad(X=A,B).DX​=Trρ​Xα​ρ​Xα−1​​−1X​(X=A,B).

Then

Iα(t)=tαα−1Tr⁡ ⁣[ρ1(DA⊗DB)]+O(t2),I1(t)=O(t2).I_\alpha(t)=t\frac{\alpha}{\alpha-1}\operatorname{Tr}\!\left[\rho_1(D_A\otimes D_B)\right]+O(t^2), \qquad I_1(t)=O(t^2).Iα​(t)=tα−1α​Tr[ρ1​(DA​⊗DB​)]+O(t2),I1​(t)=O(t2).

All logarithms are natural, powers are on occupied support, and the error estimates are two-sided at zero for fixed data. This distinguishes the possible linear Renyi response from the quadratic onset of mutual information. No universal nonzero quadratic coefficient is asserted.

Formalization Note Both marginals are computed using the frozen partial-trace definitions at each parameter. The theorem concerns the regulated finite-rank interpretation, not an unqualified infinite-dimensional extension.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P41
Formal statement
namespace QAlgorithms.Papers.Independent.Intakethird100.P41

open Filter

open QAlgorithms.Papers.Independent.Information100.P56 (entropy)

open scoped Topology

/-- PDF pp.7-8, (2.11)-(2.13): MRI has the displayed linear response about a product
state and MI has a quadratic remainder. Marginals are computed by partial trace at each
parameter, not held fixed. This states the regulated finite-rank interpretation; it makes
no assertion that the quadratic coefficient is nonzero for every perturbation. -/
theorem mutualRenyi_firstOrder {A B : Type*} [Fintype A] [Fintype B]
    [DecidableEq A] [DecidableEq B]
    (rhoA : Matrix A A ℂ) (rhoB : Matrix B B ℂ)
    (hA : QAlgorithms.IsDensityMatrix rhoA) (hB : QAlgorithms.IsDensityMatrix rhoB)
    (rho1 : Matrix (A × B) (A × B) ℂ)
    (hpert : IsSupportPreservingPerturbation (Matrix.kronecker rhoA rhoB) rho1)
    (a : ℝ) (ha : 0 < a) (ha1 : a ≠ 1) :
    Asymptotics.IsBigO (𝓝 (0 : ℝ))
      (fun t : ℝ => mutualRenyiNats a
        (densityPerturbation (Matrix.kronecker rhoA rhoB) rho1 t) -
        t * (a / (a - 1) *
          (rho1 * Matrix.kronecker (centeredPower a rhoA)
            (centeredPower a rhoB)).trace.re))
      (fun t : ℝ => t ^ 2) ∧
    Asymptotics.IsBigO (𝓝 (0 : ℝ))
      (fun t : ℝ => mutualRenyiNats 1
        (densityPerturbation (Matrix.kronecker rhoA rhoB) rho1 t))
      (fun t : ℝ => t ^ 2) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P41
Source
Entanglement Renyi entropies in holographic theories, arXiv:1006.0047v3, PDF p. 8, §2.2, (2.11)–(2.13)
Read-back

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

For every pair of finite index types A,BA,BA,B with decidable equality, let ρA,ρB\rho_A,\rho_BρA​,ρB​ be positive semidefinite matrices of trace 111 on their respective types, and let ρ1\rho_1ρ1​ be a complex matrix on A×BA\times BA×B. Put ρ0=ρA⊗ρB\rho_0=\rho_A\otimes\rho_Bρ0​=ρA​⊗ρB​, and assume that ρ1\rho_1ρ1​ is Hermitian of trace 000, ker⁡ρ0⊆ker⁡ρ1\ker\rho_0\subseteq\ker\rho_1kerρ0​⊆kerρ1​, and ρ(t)=ρ0+tρ1\rho(t)=\rho_0+t\rho_1ρ(t)=ρ0​+tρ1​ is positive semidefinite of trace 111 with kernel ker⁡ρ0\ker\rho_0kerρ0​ for every sufficiently small real ttt. For any real a>0a>0a>0, a≠1a\ne1a=1, define Pb(X)P_b(X)Pb​(X) by continuous functional calculus using 0↦00\mapsto00↦0 and x≠0↦xbx\ne0\mapsto x^bx=0↦xb, and put

Ca(X)=Pa−1(X)Re⁡tr⁡Pa(X)−I.C_a(X)=\frac{P_{a-1}(X)}{\operatorname{Re}\operatorname{tr}P_a(X)}-I.Ca​(X)=RetrPa​(X)Pa−1​(X)​−I.

Define Rb(X)R_b(X)Rb​(X), after the specified finite reindexing, as log⁡(Re⁡tr⁡1{x≠0}(X))\log(\operatorname{Re}\operatorname{tr}\mathbf1_{\{x\ne0\}}(X))log(Retr1{x=0}​(X)) for b=0b=0b=0, as −Re⁡tr⁡[(x↦xlog⁡x)(X)]-\operatorname{Re}\operatorname{tr}[(x\mapsto x\log x)(X)]−Retr[(x↦xlogx)(X)] for b=1b=1b=1, and otherwise as log⁡(Re⁡tr⁡(x↦xb)(X))/(1−b)\log(\operatorname{Re}\operatorname{tr}(x\mapsto x^b)(X))/(1-b)log(Retr(x↦xb)(X))/(1−b). Write Jb(X)=Rb(tr⁡BX)+Rb(tr⁡AX)−Rb(X)J_b(X)=R_b(\operatorname{tr}_B X)+R_b(\operatorname{tr}_A X)-R_b(X)Jb​(X)=Rb​(trB​X)+Rb​(trA​X)−Rb​(X), where (tr⁡BX)u,v=∑bX(u,b),(v,b)(\operatorname{tr}_B X)_{u,v}=\sum_bX_{(u,b),(v,b)}(trB​X)u,v​=∑b​X(u,b),(v,b)​ and (tr⁡AX)u,v=∑aX(a,u),(a,v)(\operatorname{tr}_A X)_{u,v}=\sum_aX_{(a,u),(a,v)}(trA​X)u,v​=∑a​X(a,u),(a,v)​. Then

Ja(ρ(t))−t aa−1Re⁡tr⁡(ρ1[Ca(ρA)⊗Ca(ρB)])=O(t2),J1(ρ(t))=O(t2)J_a(\rho(t)) -t\,\frac{a}{a-1}\operatorname{Re}\operatorname{tr} \bigl(\rho_1[C_a(\rho_A)\otimes C_a(\rho_B)]\bigr) =O(t^2), \qquad J_1(\rho(t))=O(t^2)Ja​(ρ(t))−ta−1a​Retr(ρ1​[Ca​(ρA​)⊗Ca​(ρB​)])=O(t2),J1​(ρ(t))=O(t2)

as real t→0t\to0t→0. Each estimate bounds the absolute value by a constant times ∣t∣2|t|^2∣t∣2 on a two-sided neighborhood of 000. Logarithms and reciprocals use their total conventions at zero. Singular density matrices are permitted; an empty AAA or BBB makes the corresponding trace-111 hypothesis impossible.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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