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.
The n-torus and its exponential lattice
Example
Assume . For , the exponential is
Under the unit-circle convention , the same kernel is written .
Facts & Assumptions
Given: The additive quotient torus.
Smooth group operations define a Lie group. Lie group.
The Lie-group exponential is the time-one point of the one-parameter subgroup with the given velocity. Exponential map of a Lie group.
The exponential-map interface [F2] assumes countable choice and records its use through the supplied invariant-field and completeness result. The Axiom of Countable Choice ().
Verification
Integer translations preserve the standard smooth charts, so addition and negation descend to smooth operations on the quotient; hence [F1] gives an -dimensional Lie group with tangent space at the identity.
For , the curve is a one-parameter subgroup with initial velocity . By [F2], its time-one point is . This equals the identity exactly when .
At the torus and kernel are trivial; at this is the circle quotient. The lattice is discrete but no nondegeneracy is asserted. There is no metric, endpoint issue, or biconditional beyond the direct kernel calculation. The assumed is used by [F2] through its stated supplier chain, and the fixed integer lattice adds no choice.
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
- Alexander Kirillov Jr., An Introduction to Lie Groups and Lie Algebras (standard reference, not scraped)
- Anthony W. Knapp, Lie Groups Beyond an Introduction, 2nd ed. (standard reference, not scraped)