Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

Categorical Garside structures and simple arrows

Definition

Let C be a small category, meaning that its objects and arrows form sets. An automorphism of C means a functor ϕ:C→C admitting a functor ψ:C→C with ψ∘ϕ=id⁡C=ϕ∘ψ as equalities on objects and arrows. Let ϕ be such an automorphism, and let Δ be a natural transformation from the identity functor to ϕ. Thus its component at x is an arrow Δx:x→ϕ(x), and for every f:x→y one has fΔy=Δxϕ(f) in traversal order. An arrow f:x→y is simple for this structure if there is an arrow g:y→ϕ(x) with fg=Δx.

An atomic categorical Garside structure is such a triple (C,ϕ,Δ) in which C is atomic and cancellative, every atom is simple, and, for every object x, both the outgoing left-divisibility order and the incoming right-divisibility order are lattices. A Garside category means a category equipped with such a structure. In the one-object case its arrows form a Garside monoid in this categorical convention. The structure has finite type if its set of simple arrows is finite.

Justification

The naturality equation has matching source and target on both sides. The condition fg=Δx determines the domain and codomain required of g, so simplicity is an unambiguous property of an arrow relative to the specified triple. Atomicity and cancellation make the two divisibility relations partial orders, as established in the divisibility definition; the lattice condition is consequently meaningful. Smallness ensures that the arrow collections used for the divisibility orders and the one-object monoid are sets. In a one-object category, composition and its identity give a monoid. The cited definition records the atomic variant adopted here; finite type is an additional condition, not an implicit assumption.

Depends on

Used by · 8

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.

External dependencies

Garside categories, periodic loops and cyclic sets · §2, basic triple and Definitions 2.2–2.5, footnote 3; printed pp. 9–10

A categorical Garside structure has a small cancellative category, an automorphism and a natural transformation from the identity to it; atoms are simple and the outgoing and incoming divisibility orders are lattices. The stated homogeneous condition may be replaced by atomicity.

Hypotheses: The atomic variant of the categorical definition; composition is written in traversal order.

Reading limits: Read extracted text of the basic triple, Definitions 2.2–2.5, the intervening atomicity and cancellation definitions, and footnote 3 on printed pp. 9–10 of arXiv:math/0610778v1. No normal-form or embedding theorem, or proof of those theorems, is imported or reconstructed.

Sources