Diagonal maps of types

Content created by Fredrik Bakke, Egbert Rijke, Jonathan Prieto-Cubides and Victor Blanchi.

Created on 2022-07-28.
Last modified on 2023-09-11.

module foundation-core.diagonal-maps-of-types where
Imports 
open import foundation.action-on-identifications-functions
open import foundation.dependent-pair-types
open import foundation.equality-cartesian-product-types
open import foundation.universe-levels

open import foundation-core.cartesian-product-types
open import foundation-core.equivalences
open import foundation-core.fibers-of-maps
open import foundation-core.function-types
open import foundation-core.homotopies
open import foundation-core.identity-types
open import foundation-core.propositions

Idea

The diagonal map δ : A → A × A of A is the map that includes A as the diagonal into A × A.

Definition

module _
  {l : Level} (A : UU l)
  where

  diagonal : A → A × A
  pr1 (diagonal x) = x
  pr2 (diagonal x) = x

Properties

The action on paths of a diagonal

ap-diagonal :
  {l : Level} {A : UU l} {x y : A} (p : x ＝ y) →
  ap (diagonal A) p ＝ eq-pair p p
ap-diagonal refl = refl

If the diagonal of A is an equivalence, then A is a proposition

module _
  {l : Level} (A : UU l)
  where

  abstract
    is-prop-is-equiv-diagonal : is-equiv (diagonal A) → is-prop A
    is-prop-is-equiv-diagonal is-equiv-d =
      is-prop-all-elements-equal
        ( λ x y →
          ( inv (ap pr1 (is-section-map-inv-is-equiv is-equiv-d (pair x y)))) ∙
          ( ap pr2 (is-section-map-inv-is-equiv is-equiv-d (pair x y))))

  equiv-diagonal-is-prop :
    is-prop A → A ≃ (A × A)
  pr1 (equiv-diagonal-is-prop is-prop-A) = diagonal A
  pr2 (equiv-diagonal-is-prop is-prop-A) =
    is-equiv-is-invertible
      ( pr1)
      ( λ pair-a → eq-pair (eq-is-prop is-prop-A) (eq-is-prop is-prop-A))
      ( λ a → eq-is-prop is-prop-A)

The fibers of the diagonal map

module _
  {l : Level} (A : UU l)
  where

  eq-fiber-diagonal : (t : A × A) → fiber (diagonal A) t → pr1 t ＝ pr2 t
  eq-fiber-diagonal (pair x y) (pair z α) = (inv (ap pr1 α)) ∙ (ap pr2 α)

  fiber-diagonal-eq : (t : A × A) → pr1 t ＝ pr2 t → fiber (diagonal A) t
  pr1 (fiber-diagonal-eq (pair x y) β) = x
  pr2 (fiber-diagonal-eq (pair x y) β) = eq-pair refl β

  is-section-fiber-diagonal-eq :
    (t : A × A) → ((eq-fiber-diagonal t) ∘ (fiber-diagonal-eq t)) ~ id
  is-section-fiber-diagonal-eq (pair x .x) refl = refl

  is-retraction-fiber-diagonal-eq :
    (t : A × A) → ((fiber-diagonal-eq t) ∘ (eq-fiber-diagonal t)) ~ id
  is-retraction-fiber-diagonal-eq .(pair z z) (pair z refl) = refl

  abstract
    is-equiv-eq-fiber-diagonal : (t : A × A) → is-equiv (eq-fiber-diagonal t)
    is-equiv-eq-fiber-diagonal t =
      is-equiv-is-invertible
        ( fiber-diagonal-eq t)
        ( is-section-fiber-diagonal-eq t)
        ( is-retraction-fiber-diagonal-eq t)

Recent changes