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.
Finite roof squares and composable pairs can be cleared
Statement
Let and be ordinary arrows, and let , satisfy . There exist , , , and denominators , , such that , , , . Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.
Facts & Assumptions
Given: Let and be ordinary arrows, and let , satisfy . There exist , , , and denominators , , such that , , , . Moreover two composable localized arrows and their composite can simultaneously be represented by ordinary arrows after denominator isomorphisms of the three objects.
Every localized arrow has either roof orientation, and equality of ordinary arrows is detected by a denominator (The calculus of fractions constructs the localization).
Composition of roof classes is independent of representatives and is associative (Composition of roofs is well defined).
Proof
Write . The outgoing Ore square for gives in and with . Write , and apply Ore to to find in and with . Replace by and put . Then and the right square commutes.
The localized commuting square now gives . Dual equality detection supplies in with . Replace by ; both ordinary squares now commute and . This proves the square assertion, including identity or coincident arrows.
For a composable pair , , write with in . Write with in and . Thus after the object comparisons the pair is and its composite is . The equalities follow from the proved composition law, not from an assumption about arbitrary diagrams.
Depends on
Used by
Dependency tree · two levels
5 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
- 13.5.5–13.5.6, including all TR1–TR4 proof paragraphs (standard reference, not scraped)
- Lemma 4.27.10, complete proof including footnote common denominator construction (standard reference, not scraped)