Docs / Semantics / Dynamic / DRT / Sheaf / Realizers

Realizers of basic DRSs

import Linglib.Semantics.Dynamic.DRT.Sheaf.Realizers · namespace DRT

A basic DRS is true under an assignment of its context's referents when each literal holds, and its realizers, the assignments that make it true, are the verifying embeddings of the DRS. Assignments form a presheaf on contexts that is a sheaf for a presieve exactly when it is jointly surjective on referents, the first of Abramsky and Sadrzadeh's two conditions on covers. An assignment realizes the least gluing of a family along a cover exactly when its restrictions realize the local theories, so the realizers of the gluing are the compatible families of local realizers.

Implementation notes

Abramsky and Sadrzadeh leave a sheaf-theoretic semantics of DRSs to future work; this file only shows that truth is compatible with their gluing.

References

Truth of basic DRSs

L49–51
L53–55
L58–61
L65–66
L68–70
L72–75

The sheaf of assignments

L118–120
L123–126
L130–133
L135–144
L146–154
L156–162

Assignments to a nontrivial structure are a sheaf for a presieve iff it is jointly surjective on referents.

theorem isSheafFor_assignments_iffL164–175
{L : FirstOrder.Language} {V : Type w} {M : Type x} {c : Context L V} {R : CategoryTheory.Presieve c} [Nontrivial M] :
CategoryTheory.Presieve.IsSheafFor (assignments L V M) R ↔ R ∈ (referentPrecoverage L V).coverings c

Built from ,

L194–197

Truth along a cover

An assignment makes the renamed local literals of a family true exactly when its restriction along every cover morphism realizes the local theory.

theorem Cover.realizers_pushforwardL212–217
{L : FirstOrder.Language} {V : Type w} {M : Type x} {c : Context L V} {ι : Type u_1} {C : Cover c ι} [L.Structure M] [Fintype ι] [DecidableEq V] [(n : ℕ) → DecidableEq (L.Relations n)] (x : (i : ι) → Theory (C.part i)) :
Literal.realizers M ↑(C.pushforward x) = ⋂ (i : ι), (fun (x : ↥c.vars → M) => x ∘ (C.map i).map) ⁻¹' Literal.realizers M ↑(x i).lits

Built from

The realizers of the renamed local literals of a family, its least gluing when it has one, are the compatible families of local realizers.

Cover.realizersEquivL219–227
noncomputable def DRT.Cover.realizersEquiv {L : FirstOrder.Language} {V : Type w} {M : Type x} {c : Context L V} {ι : Type u_1} {C : Cover c ι} [L.Structure M] [Fintype ι] [DecidableEq V] [(n : ℕ) → DecidableEq (L.Relations n)] (x : (i : ι) → Theory (C.part i)) :
↑(Literal.realizers M ↑(C.pushforward x)) ≃ { g : Subtype (CategoryTheory.Presieve.Arrows.Compatible (assignments L V M) C.map) // ∀ (i : ι), ↑g i ∈ Literal.realizers M ↑(x i).lits }

Built from ,