Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Variation of −h\sqrt{-h}−h​ with respect to habh^{ab}hab

Proved
PolyakovAction.sqrt_neg_det_variation

by Lucas · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

mathematical-physicsstring-theory

Let habh^{ab}hab be a symmetric 2×22\times22×2 matrix with negative determinant and habh_{ab}hab​ its inverse, so h=det⁡hab<0h=\det h_{ab}<0h=dethab​<0. For every variation δhab\delta h^{ab}δhab,

δ−h=−12−h hab δhab,\delta\sqrt{-h}=-\frac12\sqrt{-h}\,h_{ab}\,\delta h^{ab},δ−h​=−21​−h​hab​δhab,

in the sense that t↦−det⁡((hab+t δhab)−1)t\mapsto\sqrt{-\det\big((h^{ab}+t\,\delta h^{ab})^{-1}\big)}t↦−det((hab+tδhab)−1)​ has derivative −12−h habδhab-\frac12\sqrt{-h}\,h_{ab}\delta h^{ab}−21​−h​hab​δhab at t=0t=0t=0.

This is the identity used in the source ("Knowing also that") to compute the variational derivative of the action with respect to the inverse metric.

Formalization Note. The variation is formalized as a directional derivative in the space of inverse metrics.

Preamble
import Mathlib
import Definitions.Def_PolyakovAction_Defs

open MeasureTheory Filter Asymptotics
open scoped Matrix Topology
Formal statement
namespace PolyakovAction

theorem sqrt_neg_det_variation (k δk : Matrix (Fin 2) (Fin 2) ℝ) (hk : k.det < 0)
    (hksymm : kᵀ = k) :
    HasDerivAt (fun t : ℝ => Real.sqrt (-((k + t • δk)⁻¹).det))
      (-(1 / 2) * Real.sqrt (-(k⁻¹).det) * ∑ a, ∑ b, k⁻¹ a b * δk a b) 0 := by sorry

end PolyakovAction
Source
Wikipedia, "Polyakov action", revision oldid=1292212311 (https://en.wikipedia.org/w/index.php?title=Polyakov_action&oldid=1292212311)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Non-blind read-back — not independent testimony. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statements of this proposal, at the account owner's explicit instruction. Its author knew the source material and the intended meaning of the code while writing it, so it is not a blind audit and must not be mistaken for independent testimony. Reviewers should compare it against the Lean code themselves.

Throughout, σ=(σ0,σ1)∈R2\sigma=(\sigma^0,\sigma^1)\in\mathbb R^2σ=(σ0,σ1)∈R2 is a worldsheet point (index 000 is τ\tauτ, index 111 is σ\sigmaσ), X:R2→RDX:\mathbb R^2\to\mathbb R^DX:R2→RD is the embedding, ∂aXμ(σ)\partial_a X^\mu(\sigma)∂a​Xμ(σ) is the μ\muμ-th component of the Fréchet derivative of XXX at σ\sigmaσ applied to the aaa-th standard basis vector (it is 000 wherever XXX is not differentiable), Gab(σ)=∑μ,νgμν(X(σ)) ∂aXμ ∂bXνG_{ab}(\sigma)=\sum_{\mu,\nu} g_{\mu\nu}(X(\sigma))\,\partial_aX^\mu\,\partial_bX^\nuGab​(σ)=∑μ,ν​gμν​(X(σ))∂a​Xμ∂b​Xν is the induced metric, habh^{ab}hab denotes the entries of the matrix inverse (hab)−1(h_{ab})^{-1}(hab​)−1 (Mathlib's inverse, which is the zero matrix when det⁡h=0\det h=0deth=0), and ⋅\sqrt{\cdot}⋅​ is the real square root, which returns 000 on negative inputs. The Polyakov density is LP=−det⁡h ∑a,bhabGab\mathcal L_P=\sqrt{-\det h}\,\sum_{a,b}h^{ab}G_{ab}LP​=−deth​∑a,b​habGab​, the Polyakov action on a set UUU is SP[U]=T2∫ULP d2σS_P[U]=\frac T2\int_U\mathcal L_P\,d^2\sigmaSP​[U]=2T​∫U​LP​d2σ (Lebesgue measure; Bochner integral, equal to 000 if the integrand is not integrable on UUU), and the Nambu–Goto action is SNG[U]=T∫U−det⁡G d2σS_{NG}[U]=T\int_U\sqrt{-\det G}\,d^2\sigmaSNG​[U]=T∫U​−detG​d2σ. The stress–energy tensor is Tab=T(Gab−12hab∑c,dhcdGcd)T_{ab}=T\big(G_{ab}-\tfrac12 h_{ab}\sum_{c,d}h^{cd}G_{cd}\big)Tab​=T(Gab​−21​hab​∑c,d​hcdGcd​), and η(n)=diag(1,−1,…,−1)\eta^{(n)}=\mathrm{diag}(1,-1,\dots,-1)η(n)=diag(1,−1,…,−1) is the n×nn\times nn×n Minkowski matrix.

Statement. For all real 2×22\times22×2 matrices kkk and δk\delta kδk such that det⁡k<0\det k<0detk<0 and kT=kk^{\mathsf T}=kkT=k, the real function

t↦−det⁡((k+t δk)−1)t\mapsto\sqrt{-\det\big((k+t\,\delta k)^{-1}\big)}t↦−det((k+tδk)−1)​

has derivative at t=0t=0t=0 equal to

−12 −det⁡(k−1)  ∑a,b(k−1)ab δkab.-\frac12\,\sqrt{-\det(k^{-1})}\;\sum_{a,b}(k^{-1})_{ab}\,\delta k_{ab}.−21​−det(k−1)​a,b∑​(k−1)ab​δkab​.

Here (⋅)−1(\cdot)^{-1}(⋅)−1 is the matrix inverse (zero for singular matrices) and ⋅\sqrt{\cdot}⋅​ is 000 on negative inputs. No symmetry is assumed on δk\delta kδk.

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

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 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