Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite UV-subtracted D4 reduced action

Open
QAlgorithms.Papers.Independent.Intakethird100.P58.d4_uv_entropy

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

prove2quantum

Fix positive D4 coupling λ\lambdaλ and compactification radius R4R_4R4​, and an integer Nc≥1N_c\ge1Nc​≥1, with α′=1\alpha'=1α′=1. Put U0=4πλ/(9R42)U_0=4\pi\lambda/(9R_4^2)U0​=4πλ/(9R42​), Rcurv3=πλR_{\mathrm{curv}}^3=\pi\lambdaRcurv3​=πλ, GN(10)=8π6λ2/Nc2G_N^{(10)}=8\pi^6\lambda^2/N_c^2GN(10)​=8π6λ2/Nc2​, and K=π3Rcurv6U0R4/(2GN(10))K=\pi^3R_{\mathrm{curv}}^6U_0R_4/(2G_N^{(10)})K=π3Rcurv6​U0​R4​/(2GN(10)​). For any regular physical disk or cylinder inverse profile r(z)r(z)r(z) with boundary radius ρ>0\rho>0ρ>0 and endpoint depth bbb, use the actual reduced action

S(a)=K∫abr(z)2z31+z(1−z3)r′(z)2 dz.S(a)=K\int_a^b\frac{r(z)^2}{z^3}\sqrt{1+z(1-z^3)r'(z)^2}\,dz.S(a)=K∫ab​z3r(z)2​1+z(1−z3)r′(z)2​dz.

There exists a finite real remainder Sfinite(0)S_{\mathrm{finite}}(0)Sfinite​(0) such that

S(a)−K[ρ22a2−32a+log⁡a8ρ2]⟶Sfinite(0)(a→0+).S(a)-K\left[\frac{\rho^2}{2a^2}-\frac{3}{2a}+\frac{\log a}{8\rho^2}\right] \longrightarrow S_{\mathrm{finite}}(0)\qquad(a\to0^+).S(a)−K[2a2ρ2​−2a3​+8ρ2loga​]⟶Sfinite​(0)(a→0+).

This is the UV subtraction for the chosen reduced functional. It does not derive its disputed absolute geometric normalization or assert physical validity at arbitrarily high field-theory cutoff.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P58
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P58

open Set Filter MeasureTheory

open scoped Topology

/-- PDF pp.18--19, (4.17): finite UV remainder of the actual reduced D4 action
for either regular topology. K is exactly the chosen reduced-regulatedAction prefactor;
no assertion repairs the induced-metric normalization. -/
theorem d4_uv_entropy (P : D4Parameters) (N : ℕ) (hN : 0 < N)
    (rho b : ℝ) (r : ℝ → ℝ) (hr : IsProfile .d4 rho b r) :
    ∃ finite : ℝ,
      Tendsto (fun a => d4Entropy P N r a b - d4Prefactor P N * uv .d4 rho a)
        (nhdsWithin (0 : ℝ) (Ioi 0)) (nhds finite) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P58

end
Source
Topological Entanglement Entropy and Holography, arXiv:0805.1891v2, PDF p. 18, (4.17)
Read-back

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

For every parameter record PPP consisting of real numbers λ>0\lambda>0λ>0 and L>0L>0L>0, respectively its coupling and circle radius, every natural number N>0N>0N>0, every pair of real numbers ρ,b\rho,bρ,b, and every function r:R→Rr:\mathbb R\to\mathbb Rr:R→R satisfying the profile conditions below, there exists a real number FFF giving the stated limit. The common profile conditions are ρ>0\rho>0ρ>0, b>0b>0b>0, r(0)=ρr(0)=\rhor(0)=ρ, continuity and strict decrease of rrr on [0,b][0,b][0,b], twice continuous differentiability of rrr at every point of [0,b)[0,b)[0,b) as a function on R\mathbb RR, and, for every z∈(0,b)z\in(0,b)z∈(0,b),

r(z)>0,ddu(r(u)2u(1−u3)r′(u)u31+u(1−u3)r′(u)2)∣u=z=2r(z)z31+z(1−z3)r′(z)2.r(z)>0,\qquad \left.\frac{d}{du} \left( \frac{r(u)^2u(1-u^3)r'(u)} {u^3\sqrt{1+u(1-u^3)r'(u)^2}} \right)\right|_{u=z} = \frac{2r(z)}{z^3}\sqrt{1+z(1-z^3)r'(z)^2}.r(z)>0,dud​(u31+u(1−u3)r′(u)2​r(u)2u(1−u3)r′(u)​)​u=z​=z32r(z)​1+z(1−z3)r′(z)2​.

For every real aaa with 0<a<b0<a<b0<a<b, the function z↦r(z)21+z(1−z3)r′(z)2/z3z\mapsto r(z)^2\sqrt{1+z(1-z^3)r'(z)^2}/z^3z↦r(z)21+z(1−z3)r′(z)2​/z3 must be Lebesgue interval-integrable from aaa to bbb. In addition, at least one of two alternatives must hold: either b<1b<1b<1, r(b)=0r(b)=0r(b)=0, and

H(t)=inf⁡{z∈[0,b]:r(z)=t},H(t)=\inf\{z\in[0,b]:r(z)=t\},H(t)=inf{z∈[0,b]:r(z)=t},

with value 000 for an empty set, is twice continuously differentiable within [0,ρ)[0,\rho)[0,ρ) and has derivative 000 at 000 within [0,∞)[0,\infty)[0,∞); or b=1b=1b=1, r(1)>0r(1)>0r(1)>0, and rrr is twice continuously differentiable at 111 as a function on R\mathbb RR. Define the real prefactor

K=π3(πλ)2(4πλ9L2)L2(8π6λ2N2).K= \frac{ \pi^3(\pi\lambda)^2 \left(\frac{4\pi\lambda}{9L^2}\right)L }{ 2\left(\frac{8\pi^6\lambda^2}{N^2}\right) }.K=2(N28π6λ2​)π3(πλ)2(9L24πλ​)L​.

The conclusion is that some F∈RF\in\mathbb RF∈R, allowed to depend on all these data, satisfies

lim⁡a→0+K[∫abr(z)2z31+z(1−z3)r′(z)2 dz−(ρ22a2−32a+log⁡a8ρ2)]=F.\lim_{a\to0^+} K\left[ \int_a^b \frac{r(z)^2}{z^3}\sqrt{1+z(1-z^3)r'(z)^2}\,dz -\left( \frac{\rho^2}{2a^2} -\frac{3}{2a} +\frac{\log a}{8\rho^2} \right) \right] =F.a→0+lim​K[∫ab​z3r(z)2​1+z(1−z3)r′(z)2​dz−(2a2ρ2​−2a3​+8ρ2loga​)]=F.
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