Inverse DeWitt supermetric on symmetric tensors
ProvedWheelerDeWittSuperspace.invSuperMap_superMapFor positive-definite and every symmetric , lowering the indices of with and raising them again with
returns . (On antisymmetric matrices vanishes, so symmetry is necessary.)
import Definitions.Def_WheelerDeWittSuperspace set_option autoImplicit false open Matrix
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
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 and be arbitrary real matrices, with indices . The statement assumes exactly two hypotheses:
- is positive definite in Mathlib's sense. This means is symmetric (, which is the Hermitian condition over ) and for every nonzero .
- is symmetric, .
No other conditions are imposed. In particular, the trace of is unrestricted, and no condition is placed on beyond positive definiteness. The hypotheses are satisfiable, for example by and , so the statement is not vacuous.
Definitions used, unfolded. Write and for the real square root of . Under the hypothesis on , , so , is invertible, and is the genuine matrix inverse. (Outside this hypothesis, the code's square root and inverse would return by convention; that case is excluded here.) Write for the entry of .
- The DeWitt supermetric is
- The inverse supermetric is
- The index lowering map sends a matrix to the matrix
- The index raising map sends a matrix to the matrix
Both maps are defined on all real matrices, symmetric or not, and the sums run over all nine ordered pairs .
Assertion. For every such and , applying index lowering and then index raising returns exactly, entrywise:
that is, for all ,
This is a one-sided statement. It asserts only that raising undoes lowering, and only on symmetric . It says nothing about the reverse composition , and nothing about non-symmetric inputs. The identity is an equality of real matrices, with no limit or approximation involved.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.