Finn Lawler regular fibration (Rev #7)

Contents

Definition

A regular fibration is a bifibration p:EBp \colon E \to B, where EE and BB have finite products that are preserved by pp and that preserve cartesian arrows, satisfying Frobenius reciprocity and the Beck--Chevalley condition for product-absolute pullback squares in BB.

The preservation conditions on products are equivalent to requiring that each fibre E AE_A have finite products and that these be preserved by all reindexing functors f *f^*.

Our regular fibrations are those of Pavlovic. A similar definition is given by Jacobs, whose only essential difference is that the fibres of a regular fibration are required to be preorders (or equivalently partial orders). Hence such ordered regular fibrations model regular logic where all proofs of the same sequent are considered equal.

Logic

A regular fibration posesses exactly the structure needed to interpret regular logic?.

Characterization

Proposition

A category CC is regular if and only if the subobject fibration Sub(C)CSub(C) \to C (that sends SXS \hookrightarrow X to XX) is regular.

Proof

For our purposes, a regular category is one that has finite limits and pullback-stable images.

If CC is a regular category, then the adjunctions ff *\exists_f \dashv f^* come from pullbacks and images in CC (Elephant lemma 1.3.1) as does the Frobenius property ({}op. cit. lemma 1.3.3). The terminal object of Sub(A)=Sub(C) ASub(A) = Sub(C)_A is the identity 1 A1_A on AA, and binary products in the fibres Sub(A)Sub(A) are given by pullback. The products are preserved by reindexing functors f *f^* because (the f *f^* are right adjoints but also because) f *(SS)f^*(S \wedge S') and f *Sf *Sf^*S \wedge f^*S' have the same universal property. The projection Sub(C)CSub(C) \to C clearly preserves these products. The Beck–Chevalley condition follows from pullback-stability of images in CC.

Conversely, suppose Sub(C)CSub(C) \to C is a regular fibration. We need to show that CC has equalizers (to get finite limits) and pullback-stable images. But the equalizer of f,g:ABf, g \colon A \rightrightarrows B is (f,g) *Δ(f,g)^*\Delta. For images, let imf= f1im f = \exists_f 1 as in Elephant lemma 1.3.1. Pullback-stability follows from the Beck–Chevalley condition, which holds for all pullback squares in CC by Seely, Theorem sec. 8.

Revision on November 22, 2012 at 22:30:21 by Finn Lawler?. See the history of this page for a list of all contributions to it.