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.
Transport of a Garside structure to the presented monoid
Statement
Let be the positive-image isomorphism associated with an injective canonical map of an Artin monoid. Suppose is a one-object categorical Garside structure and . Put . Then is an atomic categorical Garside structure. Left and right gcds and lcms transfer through , and is simple in exactly when is simple in . Here left and right gcds and lcms mean meets and joins in the respective divisibility orders.
Statement references
Facts & Assumptions
A one-object atomic categorical Garside structure consists of an atomic cancellative monoid, an automorphism with , simple atoms, and lattice orders for left and right divisibility; simple means for some . (Categorical Garside structures and simple arrows, Divisibility and atomicity in a category)
The isomorphism and its inverse preserve products, both divisibility relations and atoms. (Identifying the presented monoid with its positive image)
The presented Artin monoid has factorizations into atoms and a degree bounding all nonidentity factorizations. (Positive degree and atoms of the presented Artin monoid)
Proof
Given: The objects and hypotheses in the statement.
Goal: Establish all assertions of the statement.
Conjugating by the isomorphism yields a monoid automorphism . Applying the injective to the desired naturality equation gives , which holds by the assumed structure. Cancellation in follows by applying and using cancellation in . Atomicity holds by [F3], including bounded lengths of all nonidentity factorizations.
By [F2] each divisibility order is order-isomorphic to its counterpart in . The inverse image of the meet or join satisfies exactly its defining universal property, giving both gcds and lcms. An equality pulls back uniquely to ; therefore simplicity transfers. Atoms transfer by [F2], so each is simple since atoms in are simple. Together these verify every condition in [F1].
Depends on
Used by · 1
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.