David Corfield identity

Introduction/Elimination

What do we mean when we say

This colour is Prussian Blue?

One of two things (at least):

  • This is what Prussian Blue is (if you don’t know that)
  • Specification of this thing’s colour as prussian Blue

Type theoretic construction

  • WorldPatch:TypeWorld Patch: Type
  • Colour:TypeColour: Type
  • ColourOf:[WorldPatchColour]ColourOf: [World Patch \to Colour]
  • X:TypeThisX:XX: Type \vdash This X: X
  • ThisColour=ColourOf(ThisWorldPatch)This Colour = ColourOf(ThisWorld Patch) (judgemental equality)
  • PrussianBlue:ColourPrussian Blue: Colour
  • ThisColour=PrussianBlue:ColourThis Colour = Prussian Blue : Colour (judgemental equality, way to define Prussian Blue by pointing to sample)
  • p:Id Colour(ThisColour,PrussianBlue)\vdash p:Id_{Colour} (This Colour, Prussian Blue) (proof establishing claim that this colour is Prussian Blue)

What would be a proof of this latter identity? it would depend on the type formation of colour and other presuppositions. A proof might involve matching to a standard sample by transport, which presupposes a huge amount about colour constancy, the nature of objects, etc. Were something to change colour according to temperature, then we wouldn’t be happy taking our sample to an official chart kept in a room where the temperature changes. Rather like the metre rule or the kilogram once in Paris.

Also there is the issue of time. We still say “this colour” when pointing at a light whose hue changes. On the other hand, as Cassirer observed, we see objects as retaining their colour even when moved to other lighting conditions. E.g., a white piece of paper viewed under a green bush is still seen as white, perhaps invariance relative to surrounding light.

The type ColourColour evidently has more structure than merely being a set. For one thing there is a lighter/darker relation, for another there is a specificity ordering, e.g., Prussian Blue to Blue. Third, there is a proximity relation, orange is closer to red than blue is.

Introduction/Elimination

How does identity fit with the way a type is given via introduction/elimination/computation?

Product type

Do I know what is Id A×B(s,t)Id_{A \times B}(s, t), given s,t:A×Bs, t: A \times B.

So r(s):Id A×B(s,s)r(s): Id_{A \times B}(s, s).

The elimination rule then says that if:

  1. for any s,t:A×Bs,t:A \times B and any reason p:Id A×B(s,t)p:Id_{A \times B}(s,t) why they are the same, we have a type C(s,t,p)C(s,t,p), and
  2. if ss and tt are actually identical and p:Id A×B(s,s)p:Id_{A \times B}(s,s) is the reflexivity proof r(s)r(s), then we have a specified term v:C(s,s,r(s))v:C(s,s,r(s)),

then we can construct a canonically defined term J(v;s,t,p):C(s,t,p)J(v;s,t,p):C(s,t,p) for any ss, tt, and p:Id A×B(s,t)p:Id_{A \times B}(s,t), by “transporting” the term vv along the proof of equality pp.

So let C(s,t,p)=Id A(π 1(s),π 1(t))C(s, t, p) = Id_A(\pi_1(s), \pi_1(t)), and r(π 1(s)):Id A(π 1(s),π 1(s))r(\pi_1(s)): Id_A(\pi_1(s), \pi_1(s)), then there is J:Id A(π 1(s),π 1(t))J: Id_A(\pi_1(s), \pi_1(t)).

Similarly for π 2\pi_2.

Sum type

Do I know what is Id A+B(s,t)Id_{A + B}(s, t), given s,t:A+Bs, t: A + B.

So r(s):Id A+B(s,s)r(s): Id_{A + B}(s, s).

The elimination rule then says that if:

  1. for any s,t:A+Bs,t:A + B and any reason p:Id A+B(s,t)p:Id_{A + B}(s,t) why they are the same, we have a type C(s,t,p)C(s,t,p), and
  2. if ss and tt are actually identical and p:Id A+B(s,s)p:Id_{A + B}(s,s) is the reflexivity proof r(s)r(s), then we have a specified term v:C(s,s,r(s))v:C(s,s,r(s)),

then we can construct a canonically defined term J(v;s,t,p):C(s,t,p)J(v;s,t,p):C(s,t,p) for any ss, tt, and p:Id A(s,t)p:Id_A(s,t), by “transporting” the term vv along the proof of equality pp.

So let C(s,t,p)=C(s, t, p) = , and r(π 1(s)):Id A(,)r(\pi_1(s)): Id_A(, ), then there is J:Id A(,)J: Id_A(, ).

Last revised on December 14, 2021 at 09:14:12. See the history of this page for a list of all contributions to it.