Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Bicategories, pseudofunctors, and biequivalences

Definition

A bicategory B consists of: a class of objects; for every ordered pair X,Y a category B(X,Y) whose objects are 1-cells X→Y and whose morphisms are 2-cells; identity 1-cells 1X:X→X; composition functors cX,Y,Z:B(Y,Z)×B(X,Y)→B(X,Z), written g∘f on 1-cells and β∗α on 2-cells; and invertible natural transformations (the associator and the two unitors) αh,g,f:(h∘g)∘f⇒h∘(g∘f),λf:1Y∘f⇒f,ρf:f∘1X⇒f, satisfying the pentagon identity αk,h,g∘f αk∘h,g,f=(1k∗αh,g,f) αk,h∘g,f (αk,h,g∗1f) and the triangle identity (1g∗λf) αg,1B,f=ρg∗1f, with composition of 2-cells read right to left. A pseudofunctor F:B→B′ consists of a function on objects, functors B(X,Y)→B′(FX,FY), and invertible comparison 2-cells ϕg,f:F(g)∘F(f)⇒F(g∘f) and ϕX:1FX′⇒F(1X) natural in the composable 1-cells: for u:f⇒f′ and v:g⇒g′ one requires F(v∗u) ϕg,f=ϕg′,f′ (F(v)∗F(u)). They satisfy F(αh,g,f) ϕh∘g,f (ϕh,g∗1F(f))=ϕh,g∘f (1F(h)∗ϕg,f) αF(h),F(g),F(f)′, F(λf) ϕ1B,f (ϕB∗1F(f))=λF(f)′,F(ρf) ϕf,1A (1F(f)∗ϕA)=ρF(f)′. Two objects X,Y of a bicategory are equivalent when there are 1-cells f:X→Y and g:Y→X together with invertible 2-cells 1X⇒g∘f and f∘g⇒1Y. A pseudofunctor F:B→B′ is a biequivalence when every local functor B(X,Y)→B′(FX,FY) is an equivalence of categories and every object of B′ is equivalent to FY for some object Y of B. A strict 2-category is the special case of a bicategory in which all associators and unitors are identities (Strict 2-category); a one-object bicategory is exactly a monoidal category (Monoidal category). The definition asserts these axioms on supplied data; it does not assert that any particular tensor construction satisfies them, and it uses no choice.

Depends on

Used by

Dependency tree · two levels

14 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