Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Inverse DeWitt supermetric on symmetric tensors

Proved
WheelerDeWittSuperspace.invSuperMap_superMap

by Mazecto · Oct 5, 2026 · Mathlib 0df444a (Lean v4.33.1)

general-relativitymathematical-physicsquantum-gravity

For positive-definite hhh and every symmetric ppp, lowering the indices of ppp with GabcdG_{abcd}Gabcd​ and raising them again with

Gabcd=12det⁡h (hachbd+hadhbc−2habhcd)G^{abcd}=\tfrac12\sqrt{\det h}\,\big(h^{ac}h^{bd}+h^{ad}h^{bc}-2h^{ab}h^{cd}\big)Gabcd=21​deth​(hachbd+hadhbc−2habhcd)

returns ppp. (On antisymmetric matrices GabcdG_{abcd}Gabcd​ vanishes, so symmetry is necessary.)

Preamble
import Definitions.Def_WheelerDeWittSuperspace

set_option autoImplicit false

open Matrix
Formal statement
namespace WheelerDeWittSuperspace

/-- Milestone 2: `G^abcd` inverts `G_abcd` on symmetric tensors. -/
theorem invSuperMap_superMap (m p : Matrix (Fin 3) (Fin 3) ℝ) (hm : m.PosDef) (hp : pᵀ = p) :
    invSuperMap m (superMap m p) = p := by sorry

end WheelerDeWittSuperspace
Source
B. S. DeWitt, Quantum Theory of Gravity I. The Canonical Theory, Phys. Rev. 160 (1967) 1113-1148, https://doi.org/10.1103/PhysRev.160.1113; C. Kiefer, Quantum Geometrodynamics: whence, whither?, Gen. Relativ. Gravit. 41 (2009) 877-901, https://arxiv.org/abs/0812.0295, eqs. (3)-(5)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Read-back of WheelerDeWittSuperspace.invSuperMap_superMap.

Variables and hypotheses. Let m=(mab)m = (m_{ab})m=(mab​) and p=(pab)p = (p^{ab})p=(pab) be arbitrary real 3×33\times 33×3 matrices, with indices a,b,c,d∈{0,1,2}a,b,c,d \in \{0,1,2\}a,b,c,d∈{0,1,2}. The statement assumes exactly two hypotheses:

  • mmm is positive definite in Mathlib's sense. This means mmm is symmetric (m⊤=mm^\top = mm⊤=m, which is the Hermitian condition over R\mathbb{R}R) and ∑i,jxi mij xj>0\sum_{i,j} x_i\, m_{ij}\, x_j > 0∑i,j​xi​mij​xj​>0 for every nonzero x∈R3x \in \mathbb{R}^3x∈R3.
  • ppp is symmetric, p⊤=pp^\top = pp⊤=p.

No other conditions are imposed. In particular, the trace of ppp is unrestricted, and no condition is placed on mmm beyond positive definiteness. The hypotheses are satisfiable, for example by m=Im = Im=I and p=0p = 0p=0, so the statement is not vacuous.

Definitions used, unfolded. Write h=det⁡mh = \det mh=detm and h\sqrt{h}h​ for the real square root of det⁡m\det mdetm. Under the hypothesis on mmm, det⁡m>0\det m > 0detm>0, so h>0\sqrt{h} > 0h​>0, mmm is invertible, and m−1m^{-1}m−1 is the genuine matrix inverse. (Outside this hypothesis, the code's square root and inverse would return 000 by convention; that case is excluded here.) Write mabm^{ab}mab for the (a,b)(a,b)(a,b) entry of m−1m^{-1}m−1.

  • The DeWitt supermetric is
Gabcd(m)=mac mbd+mad mbc−mab mcd2det⁡m.G_{abcd}(m) = \frac{m_{ac}\,m_{bd} + m_{ad}\,m_{bc} - m_{ab}\,m_{cd}}{2\sqrt{\det m}}.Gabcd​(m)=2detm​mac​mbd​+mad​mbc​−mab​mcd​​.
  • The inverse supermetric is
Gabcd(m)=det⁡m (mac mbd+mad mbc−2 mab mcd)2.G^{abcd}(m) = \frac{\sqrt{\det m}\,\bigl(m^{ac}\,m^{bd} + m^{ad}\,m^{bc} - 2\,m^{ab}\,m^{cd}\bigr)}{2}.Gabcd(m)=2detm​(macmbd+madmbc−2mabmcd)​.
  • The index lowering map sends a matrix ppp to the matrix
(Gm(p))ab=∑c=02∑d=02Gabcd(m) pcd.\bigl(\mathcal{G}_m(p)\bigr)_{ab} = \sum_{c=0}^{2}\sum_{d=0}^{2} G_{abcd}(m)\,p^{cd}.(Gm​(p))ab​=c=0∑2​d=0∑2​Gabcd​(m)pcd.
  • The index raising map sends a matrix kkk to the matrix
(Gm−1(k))ab=∑c=02∑d=02Gabcd(m) kcd.\bigl(\mathcal{G}^{-1}_m(k)\bigr)^{ab} = \sum_{c=0}^{2}\sum_{d=0}^{2} G^{abcd}(m)\,k_{cd}.(Gm−1​(k))ab=c=0∑2​d=0∑2​Gabcd(m)kcd​.

Both maps are defined on all real 3×33\times 33×3 matrices, symmetric or not, and the sums run over all nine ordered pairs (c,d)(c,d)(c,d).

Assertion. For every such mmm and ppp, applying index lowering and then index raising returns ppp exactly, entrywise:

Gm−1(Gm(p))=p,\mathcal{G}^{-1}_m\bigl(\mathcal{G}_m(p)\bigr) = p,Gm−1​(Gm​(p))=p,

that is, for all a,ba,ba,b,

∑c,dGabcd(m)∑e,fGcdef(m) pef=pab.\sum_{c,d} G^{abcd}(m) \sum_{e,f} G_{cdef}(m)\, p^{ef} = p^{ab}.c,d∑​Gabcd(m)e,f∑​Gcdef​(m)pef=pab.

This is a one-sided statement. It asserts only that raising undoes lowering, and only on symmetric ppp. It says nothing about the reverse composition Gm(Gm−1(k))\mathcal{G}_m(\mathcal{G}^{-1}_m(k))Gm​(Gm−1​(k)), and nothing about non-symmetric inputs. The identity is an equality of real matrices, with no limit or approximation involved.

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

    Confirmed by the moderator at approval.

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