Product decompositions
Content created by Fredrik Bakke, Egbert Rijke and Victor Blanchi.
Created on 2023-03-23.
Last modified on 2023-06-09.
module foundation.product-decompositions where
Imports
open import foundation.dependent-pair-types open import foundation.universe-levels open import foundation-core.cartesian-product-types open import foundation-core.equivalences
Definitions
Binary product decomposition
module _ {l1 : Level} (l2 l3 : Level) (X : UU l1) where binary-product-Decomposition : UU (l1 ⊔ lsuc l2 ⊔ lsuc l3) binary-product-Decomposition = Σ (UU l2) (λ A → Σ (UU l3) (λ B → X ≃ (A × B))) module _ {l1 l2 l3 : Level} {X : UU l1} (d : binary-product-Decomposition l2 l3 X) where left-summand-binary-product-Decomposition : UU l2 left-summand-binary-product-Decomposition = pr1 d right-summand-binary-product-Decomposition : UU l3 right-summand-binary-product-Decomposition = pr1 (pr2 d) matching-correspondence-binary-product-Decomposition : X ≃ ( left-summand-binary-product-Decomposition × right-summand-binary-product-Decomposition) matching-correspondence-binary-product-Decomposition = pr2 (pr2 d)
Recent changes
- 2023-06-09. Fredrik Bakke. Remove unused imports (#648).
- 2023-06-08. Fredrik Bakke. Remove empty
foundation
modules and replace them by their core counterparts (#644). - 2023-05-25. Victor Blanchi and Egbert Rijke. Dirichlet exponential of species (of types and of types in a subuniverse) (#628).
- 2023-05-01. Fredrik Bakke. Refactor 2, the sequel to refactor (#581).
- 2023-04-28. Fredrik Bakke. Miscellaneous refactoring and small additions (#579).