Docs / Syntax / Minimalist / Copy / BindingAtReading

Binding at a reading

import Linglib.Syntax.Minimalist.Copy.BindingAtReading · namespace Minimalist

This file proves that binding at the copy object is binding at one reading: a token c-commands another in the copy object just when it does in the reading in which the chains holding the second are read low. So the choice of copies the semantic interface reads loses no binding relation, and the reading that shows a given relation is found from the bound token alone. When nothing moves from itself a reading also creates no binding, so binding at the copy object is binding at some reading.

Implementation notes

  • The theorem names one reading as well as some reading because the reading is found locally, and the step-by-step induction needs that: the test that a copy holds y is independent of the stage.
  • Without DistinctDaughters a reading may bind where the copy object does not: an object that moves from itself, read low, comes to c-command the sister of its movement node.
  • Two chains sharing a mark could have mark reach copies with different terms, which MarksName excludes. Reading each chain high or low is enough because the theorem concerns one pair of tokens at a time.

References

Chains

L129
L134
L141–147
L149–150
L152

The steps of a derivation

Binding at a reading is binding at the copy object, when nothing moves from itself.

theorem Derivation.BindsAtReading.bindsAtLFL976–982
{x y : LexicalItem.Token} {d : Derivation} {low : Finset SyntacticObject} (hxy : x ≠ y) {c : Cfg LinearizedSyntacticObject.Marked} (hc : d.replayWithCopies? = some c) (hDD : LinearizedSyntacticObject.Marked.DistinctDaughters ↑c.current) (h : d.BindsAtReading low ↑x ↑y) :
d.BindsAtLF ↑x ↑y

Built from

Binding at the copy object is binding at the reading in which the chains holding the bound token are read low, in a derivation of Merge steps that merges no token twice and moves no trace, when marks name chains, the copy object has no traces and nothing moves from itself.

theorem Derivation.bindsAtReading_carrying_iffL984–999
{x y : LexicalItem.Token} {d : Derivation} (hxy : x ≠ y) (hd : d.lexTokens.Nodup) (hm : ∀ step ∈ d.steps, step.IsMerge) (hmv : ∀ step ∈ d.steps, ∀ m ∈ step.mover?, Sum.isLeft (↑m).value = true) {c : Cfg LinearizedSyntacticObject.Marked} (hc : d.replayWithCopies? = some c) (hMN : LinearizedSyntacticObject.Marked.MarksName ↑c.current) (hTF : LinearizedSyntacticObject.Marked.TraceFree ↑c.current) (hDD : LinearizedSyntacticObject.Marked.DistinctDaughters ↑c.current) :
d.BindsAtReading (c.current.carrying y) ↑x ↑y ↔ d.BindsAtLF ↑x ↑y

Built from , ,

Binding at the copy object is binding at some reading.

theorem Derivation.exists_bindsAtReading_iffL1001–1009
{x y : LexicalItem.Token} {d : Derivation} (hxy : x ≠ y) (hd : d.lexTokens.Nodup) (hm : ∀ step ∈ d.steps, step.IsMerge) (hmv : ∀ step ∈ d.steps, ∀ m ∈ step.mover?, Sum.isLeft (↑m).value = true) {c : Cfg LinearizedSyntacticObject.Marked} (hc : d.replayWithCopies? = some c) (hMN : LinearizedSyntacticObject.Marked.MarksName ↑c.current) (hTF : LinearizedSyntacticObject.Marked.TraceFree ↑c.current) (hDD : LinearizedSyntacticObject.Marked.DistinctDaughters ↑c.current) :
(∃ (low : Finset SyntacticObject), d.BindsAtReading low ↑x ↑y) ↔ d.BindsAtLF ↑x ↑y

Built from , ,