Documentation

LeanPool.DomainTheory.Neighborhood.Example15

Example 1.5 (Scott 1981, PRG-19, ยง1) #

Scott's fourth worked example: tokens ฮ” = {0, 1, 2, 3} and ๐’Ÿ the family of all non-empty subsets of ฮ”.

This system is a direct generalization of Example 1.2 โ€ฆ The verification that the present ๐’Ÿ is a neighbourhood system rests on nothing more than the remark that sets are consistent in ๐’Ÿ iff they have a non-empty intersection.

We encode tokens as Fin 4, take mem X := X.Nonempty, and master := Set.univ. Condition (ii) of Definition 1.1 is immediate: a consistency witness Z โІ X โˆฉ Y that is itself non-empty makes X โˆฉ Y non-empty.

Unlike Examples 1.2โ€“1.4 this construction needs no fin_cases/decide: it is Set.Nonempty bookkeeping, so it audits constructive ([propext, Quot.sound]).

@[reducible, inline]

Tokens for Example 1.5: ฮ” = {0, 1, 2, 3}.

Equations
Instances For

    The master neighbourhood ฮ” = {0, 1, 2, 3}.

    Equations
    Instances For

      Example 1.5. The neighbourhood system of all non-empty subsets of ฮ” = {0,1,2,3}.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        The neighbourhoods of Example 1.5 are exactly the non-empty subsets.

        Factoid 1.5a (Scott 1981, PRG-19). In Example 1.5, "sets are consistent in ๐’Ÿ iff they have a non-empty intersection": a finite prefix Xโ‚€, โ€ฆ, Xโ‚™โ‚‹โ‚ is consistent exactly when its intersection โ‹‚_{i<n} Xแตข is non-empty.