Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

First-order entropy response on a regulated finite occupied support

Open
QAlgorithms.Papers.Independent.Intakethird100.P41.entropy_firstOrder

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

prove2quantum

Let ρ(t)=ρ0+tρ1\rho(t)=\rho_0+t\rho_1ρ(t)=ρ0​+tρ1​ be a density operator on an arbitrary finite occupied-support realization of a regulated system. Assume ρ0≥0\rho_0\ge0ρ0​≥0, Tr⁡ρ0=1\operatorname{Tr}\rho_0=1Trρ0​=1, ρ1\rho_1ρ1​ is Hermitian, Tr⁡ρ1=0\operatorname{Tr}\rho_1=0Trρ1​=0, and im⁡ρ1⊆im⁡ρ0\operatorname{im}\rho_1\subseteq\operatorname{im}\rho_0imρ1​⊆imρ0​. For all sufficiently small real ttt of either sign, assume ρ(t)\rho(t)ρ(t) remains positive and has the same occupied support as ρ0\rho_0ρ0​. For every fixed real α>0\alpha>0α>0, α≠1\alpha\ne1α=1, the Renyi entropy Sα(ρ)=log⁡Tr⁡(ρα)/(1−α)S_\alpha(\rho)=\log\operatorname{Tr}(\rho^\alpha)/(1-\alpha)Sα​(ρ)=logTr(ρα)/(1−α) and von Neumann entropy S(ρ)=−Tr⁡(ρlog⁡ρ)S(\rho)=-\operatorname{Tr}(\rho\log\rho)S(ρ)=−Tr(ρlogρ), both in nats, satisfy

Sα(ρ(t))=Sα(ρ0)+tα1−αTr⁡(ρ1ρ0α−1)Tr⁡(ρ0α)+O(t2),S(ρ(t))=S(ρ0)−tTr⁡(ρ1log⁡ρ0)+O(t2).S_\alpha(\rho(t))=S_\alpha(\rho_0)+t\frac{\alpha}{1-\alpha}\frac{\operatorname{Tr}(\rho_1\rho_0^{\alpha-1})}{\operatorname{Tr}(\rho_0^\alpha)}+O(t^2), \qquad S(\rho(t))=S(\rho_0)-t\operatorname{Tr}(\rho_1\log\rho_0)+O(t^2).Sα​(ρ(t))=Sα​(ρ0​)+t1−αα​Tr(ρ0α​)Tr(ρ1​ρ0α−1​)​+O(t2),S(ρ(t))=S(ρ0​)−tTr(ρ1​logρ0​)+O(t2).

Powers and logarithms are taken on the occupied support. Each remainder is two-sided as t→0t\to0t→0, with constants allowed to depend on the fixed state, perturbation and order. These responses compare ordinary and Renyi entropy under a support-preserving perturbation.

Formalization Note The index type is arbitrary and finite, rather than a prescribed matrix dimension. This is the plan's regulated finite-rank interpretation; it does not assert an infinite-rank trace-class differentiability theorem.

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 p.7, (2.9)-(2.10): both first-order entropy responses, with quadratic
remainders, for the regulated finite-rank interpretation. The dimension is arbitrary,
zero eigenvalues are allowed, and no commutation hypothesis is imposed on rho0 and rho1.
The infinite-rank interpretation requires additional trace/differentiability domains. -/
theorem entropy_firstOrder {I : Type*} [Fintype I] [DecidableEq I]
    (rho0 rho1 : Matrix I I ℂ) (hpert : IsSupportPreservingPerturbation rho0 rho1)
    (a : ℝ) (ha : 0 < a) (ha1 : a ≠ 1) :
    Asymptotics.IsBigO (𝓝 (0 : ℝ))
      (fun t : ℝ => regulatedRenyiNats a (densityPerturbation rho0 rho1 t) -
        regulatedRenyiNats a rho0 - t * (a / (1 - a) *
          (rho1 * occupiedPower (a - 1) rho0).trace.re /
            (occupiedPower a rho0).trace.re))
      (fun t : ℝ => t ^ 2) ∧
    Asymptotics.IsBigO (𝓝 (0 : ℝ))
      (fun t : ℝ => entropy (densityPerturbation rho0 rho1 t) -
        entropy rho0 + t * (rho1 * cfc Real.log rho0).trace.re)
      (fun t : ℝ => t ^ 2) := by sorry

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

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

For every finite index type III with decidable equality, complex I×II\times II×I matrices ρ0,ρ1\rho_0,\rho_1ρ0​,ρ1​, and real a>0a>0a>0 with a≠1a\ne1a=1, assume that ρ0\rho_0ρ0​ is positive semidefinite of trace 111, ρ1\rho_1ρ1​ is Hermitian of trace 000, ker⁡ρ0⊆ker⁡ρ1\ker\rho_0\subseteq\ker\rho_1kerρ0​⊆kerρ1​, and every sufficiently small real ttt makes ρ(t)=ρ0+tρ1\rho(t)=\rho_0+t\rho_1ρ(t)=ρ0​+tρ1​ positive semidefinite of trace 111 with exactly the same kernel as ρ0\rho_0ρ0​. Let Pb(X)P_b(X)Pb​(X) apply the function 0↦00\mapsto00↦0, x≠0↦xbx\ne0\mapsto x^bx=0↦xb, by real continuous functional calculus; let Ra(X)=log⁡(Re⁡tr⁡(x↦xa)(X))/(1−a)R_a(X)=\log(\operatorname{Re}\operatorname{tr}(x\mapsto x^a)(X))/(1-a)Ra​(X)=log(Retr(x↦xa)(X))/(1−a), with the specified finite reindexing understood; and let S(X)=−Re⁡tr⁡[(x↦xlog⁡x)(X)]S(X)=-\operatorname{Re}\operatorname{tr}[(x\mapsto x\log x)(X)]S(X)=−Retr[(x↦xlogx)(X)]. Then both estimates hold as real t→0t\to0t→0:

Ra(ρ(t))−Ra(ρ0)−t a1−a Re⁡tr⁡(ρ1Pa−1(ρ0))Re⁡tr⁡Pa(ρ0)=O(t2),R_a(\rho(t))-R_a(\rho_0) -t\,\frac{a}{1-a}\, \frac{\operatorname{Re}\operatorname{tr}(\rho_1P_{a-1}(\rho_0))} {\operatorname{Re}\operatorname{tr}P_a(\rho_0)} =O(t^2),Ra​(ρ(t))−Ra​(ρ0​)−t1−aa​RetrPa​(ρ0​)Retr(ρ1​Pa−1​(ρ0​))​=O(t2), S(ρ(t))−S(ρ0)+t Re⁡tr⁡(ρ1log⁡(ρ0))=O(t2).S(\rho(t))-S(\rho_0) +t\,\operatorname{Re}\operatorname{tr}\bigl(\rho_1\log(\rho_0)\bigr) =O(t^2).S(ρ(t))−S(ρ0​)+tRetr(ρ1​log(ρ0​))=O(t2).

Here log⁡(ρ0)\log(\rho_0)log(ρ0​) uses the real continuous functional calculus with the total convention log⁡0=0\log0=0log0=0. Each O(t2)O(t^2)O(t2) assertion means that the absolute value of the displayed expression is bounded by a constant times ∣t∣2|t|^2∣t∣2 throughout some neighborhood of 000, including negative ttt. Singular ρ0\rho_0ρ0​ is allowed; empty III makes the density 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