Skip to content
Back to skills

Covariant Fibrations

ASecurity

Riehl-Shulman covariant fibrations for dependent types over directed

  • 666 stars
  • 0 votes
  • 0 copies
  • 3 views
  • Added September 2, 2026
ai-agentsgobash

Security analysis

A100/100

Scanned September 2, 2026

npx -y skills add majiayu000/claude-skill-registry --skill covariant-fibrations --agent claude-code

Installs into .claude/skills of the current project.

Are you the author of Covariant Fibrations?

Add the live security badge to your README. It updates with every re-scan.

Security grade badge for Covariant Fibrations
[![Security: A β€” Skills Directory](https://www.skillsdirectory.com/api/skills/majiayu000-covariant-fibrations/badge)](https://www.skillsdirectory.com/skills/majiayu000-covariant-fibrations)

More formats (shields.io, HTML) on the badges page. Keep it an A: scan every change in CI with Pro.

Download with Pro
SKILL.md
---
name: covariant-fibrations
description: Riehl-Shulman covariant fibrations for dependent types over directed
version: 1.0.0
---


# Covariant Fibrations Skill: Directed Transport

**Status**: βœ… Production Ready
**Trit**: -1 (MINUS - validator/constraint)
**Color**: #2626D8 (Blue)
**Principle**: Type families respect directed morphisms
**Frame**: Covariant transport along 2-arrows

---

## Overview

**Covariant Fibrations** are type families B : A β†’ U where transport goes *with* the direction of morphisms. In directed type theory, this ensures type families correctly propagate along the directed interval 𝟚.

1. **Directed interval 𝟚**: Type with 0 β†’ 1 (not invertible)
2. **Covariant transport**: f : a β†’ a' induces B(a) β†’ B(a')
3. **Segal condition**: Composition witness for ∞-categories
4. **Fibration condition**: Lift existence (not uniqueness)

## Core Formula

```
For P : A β†’ U covariant fibration:
  transport_P : (f : Hom_A(a, a')) β†’ P(a) β†’ P(a')
  
Covariance: transport respects composition
  transport_{g∘f} = transport_g ∘ transport_f
```

```haskell
-- Directed type theory (Narya-style)
covariant_fibration : (A : Type) β†’ (P : A β†’ Type) β†’ Type
covariant_fibration A P = 
  (a a' : A) β†’ (f : Hom A a a') β†’ P a β†’ P a'
```

## Key Concepts

### 1. Covariant Transport

```agda
-- Transport along directed morphisms
cov-transport : {A : Type} {P : A β†’ Type} 
              β†’ is-covariant P
              β†’ {a a' : A} β†’ Hom A a a' β†’ P a β†’ P a'
cov-transport cov f pa = cov.transport f pa

-- Functoriality
cov-comp : cov-transport (g ∘ f) ≑ cov-transport g ∘ cov-transport f
```

### 2. Cocartesian Lifts

```agda
-- Cocartesian lift characterizes covariant fibrations
is-cocartesian : {E B : Type} (p : E β†’ B) 
               β†’ {e : E} {b' : B} β†’ Hom B (p e) b' β†’ Type
is-cocartesian p {e} {b'} f = 
  Ξ£ (e' : E), Ξ£ (fΜƒ : Hom E e e'), (p fΜƒ ≑ f) Γ— is-initial(fΜƒ)
```

### 3. Segal Types with Covariance

```agda
-- Covariant families over Segal types
covariant-segal : (A : Segal) β†’ (P : A β†’ Type) β†’ Type
covariant-segal A P = 
  (x y z : A) β†’ (f : Hom x y) β†’ (g : Hom y z) β†’
  cov-transport (g ∘ f) ≑ cov-transport g ∘ cov-transport f
```

## Commands

```bash
# Validate covariance conditions
just covariant-check fibration.rzk

# Compute cocartesian lifts
just cocartesian-lift base-morphism.rzk

# Generate transport terms
just cov-transport source target
```

## Integration with GF(3) Triads

```
covariant-fibrations (-1) βŠ— directed-interval (0) βŠ— synthetic-adjunctions (+1) = 0 βœ“  [Transport]
covariant-fibrations (-1) βŠ— elements-infinity-cats (0) βŠ— rezk-types (+1) = 0 βœ“  [∞-Fibrations]
```

## Related Skills

- **directed-interval** (0): Base directed type 𝟚
- **synthetic-adjunctions** (+1): Generate adjunctions from fibrations
- **segal-types** (-1): Validate Segal conditions

---

**Skill Name**: covariant-fibrations
**Type**: Directed Transport Validator
**Trit**: -1 (MINUS)
**Color**: #2626D8 (Blue)



## Scientific Skill Interleaving

This skill connects to the K-Dense-AI/claude-scientific-skills ecosystem:

### Graph Theory
- **networkx** [β—‹] via bicomodule
  - Universal graph hub

### Bibliography References

- `homotopy-theory`: 29 citations in bib.duckdb



## SDF Interleaving

This skill connects to **Software Design for Flexibility** (Hanson & Sussman, 2021):

### Primary Chapter: 7. Propagators

**Concepts**: propagator, cell, constraint, bidirectional, TMS

### GF(3) Balanced Triad

```
covariant-fibrations (+) + SDF.Ch7 (β—‹) + [balancer] (βˆ’) = 0
```

**Skill Trit**: 1 (PLUS - generation)


### Connection Pattern

Propagators flow constraints bidirectionally. This skill propagates information.
## Cat# Integration

This skill maps to **Cat# = Comod(P)** as a bicomodule in the equipment structure:

```
Trit: 0 (ERGODIC)
Home: Prof
Poly Op: βŠ—
Kan Role: Adj
Color: #26D826
```

### GF(3) Naturality

The skill participates in triads satisfying:
```
(-1) + (0) + (+1) ≑ 0 (mod 3)
```

This ensures compositional coherence in the Cat# equipment structure.

Attribution

Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.

Comments

Loading comments…

Newsletter

Get the weekly list of safe new skills, and the ones we pulled.