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.
Torsion free is equivalent to symmetric christoffel symbols in coordinate frames
Statement
An affine connection is torsion free if and only if in every coordinate chart for all indices. It suffices to check this on a coordinate-chart cover. This criterion concerns coordinate frames.
Facts & Assumptions
Given: An affine connection with coordinate symbols.
Torsion is a smooth bilinear tensor (Torsion is c infinity bilinear and skew symmetric).
Symbols give the derivatives of coordinate vector fields (Christoffel symbols of an affine connection).
Coordinate vector fields commute by the bracket formula (Coordinate formula for the Lie bracket).
Proof
Evaluating the torsion expression on gives , because their bracket is zero. If , basis independence forces each difference to vanish in every chart.
Conversely, symmetry of the coefficients on a chart makes every displayed basis value zero. Tensor bilinearity then gives there for arbitrary fields. A chart cover proves this globally. With no indices in dimension zero the condition is vacuous; in dimension one the only lower-index pair is already symmetric. A noncoordinate frame may have nonzero brackets, so dropping that hypothesis would invalidate the computation.
Depends on
Used by
- A torsion free connection that is not metric compatible Counterexample
- Torsion free means curvature free False statement
Dependency tree · two levels
12 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Ved Datar, Lectures on Riemannian Geometry (standard reference, not scraped)