Skip to content

Define composition of polynomial functors #56

Closed

Description

@Vtec234

In the blueprint, it is definition 5.0.6. The construction is here in the Poly package, but we haven't proven that the resulting map is exponentiable. A sketch of the proof is in Mark Weber's Polynomials in Categories with Pullbacks.

We need this to define the interpretation of Sigma types (here). It seems we do not need the isomorphism $P_{f▸g} ≅ P_f ∘ P_g$ (compFunctorIso), however (but it might be nice to add it anyway to have a more complete library of polynomial functor facts). (CC @u5943321)

Activity

  1. added
    C-modelComponent: abstract model (natural or unstructured)
    D-unkDifficulty: unknown
    I-critImpact: critical
    O-polyOther: improvements to Poly
    on Feb 19, 2025
  2. sinhp commented on Feb 19, 2025

    @sinhp
    Owner

    And as a warm-up exercise leading to the isomorphism @Vtec234 mentioned, it might be a good idea to establish that isomorphism in the category of types where things are more concrete:

    https://github.com/sinhp/Poly/blob/0740abde64b16779ab031e1c2cad61b929c9b32d/Poly/Type/Univariate.lean#L224

    UPDATE: This special case has now been completed here.

  3. added
    I-lowImpact: low
    and removed
    I-critImpact: critical
    on Aug 24, 2025
  4. Vtec234 commented on Sep 19, 2025

    @Vtec234
    CollaboratorAuthor

    Exponentiability is proven in sinhp/Poly#34.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    C-modelComponent: abstract model (natural or unstructured)D-unkDifficulty: unknownI-lowImpact: lowO-polyOther: improvements to Poly

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions