8.5.1 Fibrations over pushouts
We first start with a lemma explaining how to construct fibrations overpushouts.
Lemma 8.5.1.
Let be a span and assumethat we have
- •
Two fibrations and .
- •
An equivalence between and , i.e.
Then we can construct a fibration such that
- •
For all , .
- •
For all , .
- •
For all , (note that both sides ofthe equation are paths in from to ).
Moreover, the total space of this fibration fits in the following pushoutsquare:
Proof.
We define by the recursion principle of the pushout . Forthat, we need to specify the value of on elements of the form , and the action of on paths , so we can just choose the followingvalues:
To see that the total space of this fibration is a pushout, we apply theflattening lemma (\\autorefthm:flattening) with the following values:
- •
, and are defined by, ,
- •
the type family is defined by
- •
the family of equivalences is definedto be .
The base higher inductive type in the flattening lemma is equivalent tothe pushout and the type family isequivalent to the defined above.
Thus the flattening lemma tells us that is equivalentthe higher inductive type with the following generators:
- •
a function ,
- •
for each and , a path
Using the flattening lemma again or a direct computation, it is easy to seethat , hence is equivalent to the higher inductive type with the following generators:
- •
a function ,
- •
a function ,
- •
for each a path
Thus the total space of is the pushout of the total spaces of and , as required.∎