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.
Eckmann–Hilton: two unital operations satisfying interchange coincide and are commutative
Statement
Let a set carry two unital binary operations and with the same unit , and suppose
for all . Then the operations coincide and their common operation is commutative.
Facts & Assumptions
Given: The two operations, common unit, and interchange identity in the Statement.
A unital associative operation is a monoid operation (Semigroup and monoid); only the unit laws and interchange are needed for the calculation below.
Proof
For , interchange gives , so the operations coincide.
A second use gives .
By step 1.1, , so step 2.1 says ; the common operation is commutative.
Depends on
Used by
Dependency tree · two levels
4 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
- nLab, Eckmann-Hilton argument (standard reference, not scraped)