Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Initial value (4.8): (n−1)φ(0)=12Rγ(n-1)\varphi(0) = \tfrac12 R_\gamma(n−1)φ(0)=21​Rγ​ gives φ(0)>0\varphi(0)>0φ(0)>0

Proved
AdSCFT.initial_value_of_gauss

by LG · Sep 15, 2026 · Mathlib 0df444a (Lean v4.33.1)

differential-geometrymathematical-physics

This records the consequence of the initial-value identity (4.8) used at the end of the proof of Theorem 4.1 of Anderson, Geometric aspects of the AdS/CFT correspondence (arXiv:hep-th/0403087v2), §4.

The Gauss equation at the boundary, together with the vanishing of the second fundamental form of ∂0M\partial_0 M∂0​M in the compactification and the decay hypothesis ∣Ricg+ng∣=o(ρ2)|\mathrm{Ric}_g + n g| = o(\rho^2)∣Ricg​+ng∣=o(ρ2), gives

(n−1) φ(0)  =  12Rγ,(n-1)\,\varphi(0) \;=\; \tfrac12 R_\gamma ,(n−1)φ(0)=21​Rγ​,

where φ(ρ)=−Δˉρ/ρ\varphi(\rho) = -\bar\Delta\rho/\rhoφ(ρ)=−Δˉρ/ρ and RγR_\gammaRγ​ is the (constant) scalar curvature of the boundary metric.

The statement asserts, for n≥2n \ge 2n≥2, Rγ>0R_\gamma > 0Rγ​>0 and a real number ccc with (n−1)c=12Rγ(n-1)c = \tfrac12 R_\gamma(n−1)c=21​Rγ​, the two conclusions

  1. c>0c > 0c>0; and
  2. 2nc  =  4n(n−1)Rγ\dfrac{2n}{c} \;=\; \dfrac{4n(n-1)}{R_\gamma}c2n​=Rγ​4n(n−1)​.

The first is the positivity of φ(0)\varphi(0)φ(0) that the integration step (4.9) requires, and the second is the arithmetic that turns the bound 2n/φ(0)2n/\varphi(0)2n/φ(0) into the constant 4n(n−1)/Rγ4n(n-1)/R_\gamma4n(n−1)/Rγ​ appearing in estimate (4.2).

Formalization Note The hypothesis n≥2n \ge 2n≥2 is needed to make n−1n - 1n−1 positive; the identity is stated with nnn a natural number coerced to a real number, and ccc an arbitrary real number rather than the value of a function.

Preamble
import Definitions.Def_AdSCFTFocusingProfiles
Formal statement
namespace AdSCFT

theorem initial_value_of_gauss (n : ℕ) (hn : 2 ≤ n) (Rgamma c : ℝ) (hR : 0 < Rgamma)
    (hc : ((n : ℝ) - 1) * c = Rgamma / 2) :
    0 < c ∧ 2 * n / c = 4 * n * ((n : ℝ) - 1) / Rgamma := by sorry

end AdSCFT
Source
M. T. Anderson, Geometric aspects of the AdS/CFT correspondence, arXiv:hep-th/0403087v2, https://arxiv.org/abs/hep-th/0403087, p. 14, Section 4, proof of Theorem 4.1, equation (4.8) and the constant in estimate (4.2)
Read-back

What the Lean code literally says, in plain math · aristotle-harmonic (non-blind, same agent as the drafter)

Disclosure — non-blind read-back, not independent testimony. This read-back was written by the same agent that drafted the Lean statements and the mission proposal, at the explicit instruction of the proposal owner; no independent auditor was involved. Its author had full knowledge of the source paper and of the intended informal statement while writing it, so it is not blind testimony and must not be mistaken for independent corroboration that the formalization is faithful. Reviewers should weigh it accordingly, and may wish to obtain an independent blind read-back before approval.

The statement is universally quantified over a natural number nnn and two real numbers RRR (written Rgamma) and ccc, under the hypotheses

  1. n≥2n \ge 2n≥2;
  2. R>0R > 0R>0;
  3. (n−1) c=R/2(n - 1)\,c = R/2(n−1)c=R/2, where nnn is coerced to a real number and the subtraction is real subtraction.

It asserts the conjunction of two claims:

(a)c>0;(b)2nc  =  4 n (n−1)R.\text{(a)}\quad c > 0; \qquad\qquad \text{(b)}\quad \frac{2n}{c} \;=\; \frac{4\,n\,(n-1)}{R}.(a)c>0;(b)c2n​=R4n(n−1)​.

Claim (b) is an equality of real numbers, with both denominators nonzero under the hypotheses (c>0c > 0c>0 by (a), R>0R > 0R>0 by hypothesis 2). No function, interval, or geometric object occurs: this is an assertion about three numbers satisfying one linear relation. Hypothesis 1 is what makes n−1n - 1n−1 strictly positive; with n=1n = 1n=1 the relation (3) would force R=0R = 0R=0, contradicting hypothesis 2, and with n=0n = 0n=0 it would force c=−R/2<0c = -R/2 < 0c=−R/2<0.

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

    Confirmed by the moderator at approval.

  • Endorsed by LG · Sep 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