The Family Fibration of Sets: A Fibration with Re-indexed Identities as Cartesian Morphisms

To formally prove that the family fibration of sets is a fibration where the Cartesian morphisms are re-indexed identities, we will proceed in four steps:

  1. Define the family fibration of sets.
  2. Define the concepts of a fibration and a Cartesian morphism in category theory.
  3. Demonstrate that the family fibration satisfies the condition for being a fibration by constructing Cartesian liftings.
  4. Characterize these Cartesian morphisms and show they are precisely the "re-indexed identities."

1. The Family Fibration of Sets

The family fibration of sets describes how families of sets are structured over the category of sets.

2. Fibrations and Cartesian Morphisms

In category theory, a fibration (or Grothendieck fibration) is a functor p:E→B that has a special lifting property.

3. Proving the Family Fibration is a Fibration

To prove that p:Fam(Set)→Set is a fibration, we must show that for any object (I,A) in Fam(Set) and any function f:J→I in Set, a Cartesian lifting exists.

Let's construct this lifting. Our goal is to find a Cartesian morphism g in Fam(Set) such that p(g)=f and its codomain is (I,A).

  1. Construct the Domain Object: We define a new object (J,A∘f) in Fam(Set). This object consists of the indexing set J and a new family of sets A∘f:J→Ob(Set) which is the re-indexing of the family A along the function f. For each j∈J, the set is (A∘f)(j)=A(f(j)).
  2. Construct the Lifting Morphism: We propose the following morphism as our Cartesian lifting:
    g=(f,id):(J,A∘f)→(I,A)
    Here, id represents the family of identity functions idA(f(j)):(A∘f)(j)→A(f(j)) for each j∈J. This morphism is what we term a re-indexed identity. Clearly, p(g)=p(f,id)=f, so it is a valid lifting.
  3. Verify the Cartesian Property: Now, we must show that g=(f,id) is Cartesian. We use the universal property defined above: Let's define h′=(m,α). The condition p(h′)=m is satisfied by construction. Now we need to satisfy g∘h′=h.
    The composition g∘h′ is (f,id)∘(m,α). By the rules of composition in Fam(Set), this is: (f∘m,β) where βx=idA(f(m(x)))∘αx=αx for each x∈K.
    So, g∘h′=(f∘m,α). For this to equal h=(k,θ), we must have: This uniquely determines α. The components of α must be αx=θx. Let's check that the domains and codomains are compatible. Since k=f∘m, the codomains A(f(m(x))) and A(k(x)) are the same set. Therefore, setting α=θ is valid.
    We have found a unique morphism, h′=(m,θ), that satisfies the required conditions. Thus, the morphism g=(f,id) is Cartesian. Since we can construct such a Cartesian lifting for any object and any base morphism, p:Fam(Set)→Set is a fibration.

4. Characterizing the Cartesian Morphisms

We have shown that "re-indexed identities" of the form (f,id):(J,A∘f)→(I,A) are Cartesian. Now we prove the converse: any Cartesian morphism is of this form, up to isomorphism.

Let (f,φ):(J,B)→(I,A) be an arbitrary Cartesian morphism in Fam(Set) over f:J→I.
We already know that (f,id):(J,A∘f)→(I,A) is also a Cartesian lifting of f with the same codomain (I,A).

A fundamental property of fibrations is that any two Cartesian liftings of the same morphism with the same codomain are uniquely isomorphic in the total category via a vertical isomorphism (an isomorphism that projects to an identity morphism in the base category).

Therefore, there exists a unique vertical isomorphism v:(J,B)→(J,A∘f) such that (f,id)∘v=(f,φ).

This shows that the family of morphisms φ must be the same as the family of isomorphisms α. Therefore, any Cartesian morphism (f,φ):(J,B)→(I,A) must consist of a family of isomorphisms φj:B(j)→A(f(j)).

In conclusion, the Cartesian morphisms in the family fibration are precisely those morphisms (f,φ) where φ is a family of isomorphisms. Such a morphism establishes an isomorphism between the domain object (J,B) and the canonical re-indexed object (J,A∘f) in the fiber over J. Under this identification, the morphism (f,φ) corresponds to the re-indexed identity (f,id).