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.
A torsion free connection that is not metric compatible
Statement refuted
A torsion-free affine connection on a Riemannian manifold must be compatible with the supplied Riemannian metric.
Facts & Assumptions
Given: The proposed implication with a fixed metric.
A smooth matrix in a global tangent frame defines an affine connection (Local connection forms glue exactly when they obey the transformation law).
Symmetric coordinate Christoffel symbols imply torsion zero (Torsion free is equivalent to symmetric christoffel symbols in coordinate frames).
Compatibility requires (Metric compatible connection on a riemannian vector bundle).
Counterexample
On with , prescribe , equivalently the matrix in tangent frame . This gives a smooth affine connection by [F1], with . Its sole lower-index pair is symmetric, so [F2] gives torsion zero.
Set . The left side in [F3] is , while its right side is , so compatibility with fails. This does not assert failure for every metric: with , the one-dimensional compatibility equation is , which holds. For arbitrary local multiples the additional derivatives of their coefficients match by the scalar product rule, so this last test indeed gives compatibility with .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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)