UniMath / agda-unimath

The agda-unimath library
https://unimath.github.io/agda-unimath/
MIT License
218 stars 69 forks source link

Project: Sheaves and excision with respect to regular cd-structures #930

Open EgbertRijke opened 9 months ago

EgbertRijke commented 9 months ago

The cd-excision project

Project description

A complete cd-structure consists of a class of distinguished squares of maps, i.e., distinguished morphisms in the arrow category, that is stable under base change. A complete cd-structure is said to be regular if the following three conditions hold:

  1. The codomain of any distinguished square is a mono.
  2. Any distinguished square is cartesian
  3. The diagonal of any distinguished square is distinguished.

A type F is said to be a sheaf with respect to a cd-structure if F is right orthogonal to inclusion-im (cogap d) for any distinguished square d.

A type F is said to satisfy excision with respect to a cd-structure if F is right orthogonal to cogap d for any distinguished square d.

Goal of the project: Show that F is a sheaf with respect to a regular cd-structure if and only if it satisfies excision.

Current participants: Reid Barton, Egbert Rijke, Fredrik Bakke.

Outline and tasks

Descent

The closed modality

The arrow category

Wärn's first lemma

Orthogonality

Cd-structures

Resources

fredrik-bakke commented 9 months ago

I've already defined the closed modality. It's in orthogonal-factorization-systems.closed-modalities.

fredrik-bakke commented 7 months ago
  • [X] Prepare the file pullback-squares for real-world applications, and possibly rename it tocartesian squares`. Alternatively, introduce a file for cartesian morphisms of arrows.

Cartesian morphisms of arrows were added in #979.

fredrik-bakke commented 7 months ago

This issue seems to be missing any mention of orthogonal maps or fiberwise orthogonal maps. Are they not needed?

fredrik-bakke commented 6 months ago

When you write

  • [ ] Define base change of morphisms of arrows.

Are you looking for a file about the following construct?

base-change-arrow :
  {l1 l2 : Level} (l3 l4 : Level) {A : UU l1} {B : UU l2} → (A → B) →
  UU (l1 ⊔ l2 ⊔ lsuc l3 ⊔ lsuc l4)
base-change-arrow l3 l4 f =
  Σ (UU l3) (λ C → Σ (UU l4) (λ D → Σ (C → D) (λ g → cartesian-hom-arrow g f)))

Otherwise, just using cartesian morphisms of arrows seems to be working fine with me for now. Although I would probably say the same about cartesian morphisms of arrows vs. pullback cones if we didn't already have cartesian morphisms of arrows.

EDIT: Oh, wait, you want a base change of morphisms of arrows.