How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Gram determinant for the two symmetry directions
Statement
Let and be the generators of the action in Commuting complete flows give the global product action. Define their Gram matrix by and their signed orbit-area square by . Under an invertible real change of basis , one has and . Consequently invertibility of the orbit Gram matrix and the sign of do not depend on that basis. Use the metric conventions in Stationary Lorentzian data and tensor conventions. This algebra does not prove that is positive anywhere.
Facts & Assumptions
The stationary flow is generated by , and the normalized axial flow is generated by . The generators are smooth ambient vector fields and the metric is symmetric and bilinear. A basis change here is an invertible two-by-two real matrix at the point under consideration. Commuting complete flows give the global product action Stationary Lorentzian data and tensor conventions Smooth global data for the axisymmetric comparison Periodic isometries and invariant normal averaging
The determinant of a real square matrix is its finite Leibniz sum over permutations. We use this definition for each real two-by-two matrix here. For n≥1, the determinant over a commutative ring by the Leibniz formula, and |det A| for a real matrix
Matrix multiplication is given by , and transpose by . These definitions apply to the real two-by-two matrices here. Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose
For square matrices of the same positive finite size over a commutative ring, and . Apply these results over at size two. For same-sized finite square matrices over a commutative ring, det(AB)=det(A)det(B) For every square matrix over a commutative ring, det(A^T)=det(A)
A real square matrix of positive finite size is invertible if and only if its determinant is nonzero. A finite square real matrix is invertible if and only if its determinant is nonzero
Proof
**Given:**The generators, metric and change of basis at one point.
Goal: Compute the transformed matrix and signed determinant.
Bilinearity gives . By the definitions of matrix product and transpose this is exactly .
Apply determinant multiplicativity twice and transpose invariance to obtain . Negating this equality gives .
Since is invertible, by the real-matrix criterion; hence . The determinant identity therefore gives if and only if . Applying the same criterion to and proves invertibility invariance, and the positive multiplier preserves the sign of , including its zero value.
Depends on
- Smooth global data for the axisymmetric comparison
- Periodic isometries and invariant normal averaging
- Commuting complete flows give the global product action
- Stationary Lorentzian data and tensor conventions
- For n≥1, the determinant over a commutative ring by the Leibniz formula, and |det A| for a real matrix
- Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose
- For same-sized finite square matrices over a commutative ring, det(AB)=det(A)det(B)
- For every square matrix over a commutative ring, det(A^T)=det(A)
- A finite square real matrix is invertible if and only if its determinant is nonzero
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.