Docs / Syntax / Minimalist / Copy / Chain

Chains on linearized syntactic objects

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

A chain is the set of positions of one object. On a copy object, where Internal Merge leaves the mover in place, two positions are in one chain when they hold one term (chainRel, the kernel of termAt), so a chain has a position per occurrence of its term (card_chainRel), and Form Copy's copies are the pairs of its positions in c-command (self_mem_copyRel_iff).

On an object with traces, a lower copy is a trace leaf Vertex.traceOf tok remembering the head of the mover, and the chain of a token lists its pronounced and deleted copies, each standing for the maximal projection of its token under a head function. A token moves when it has a deleted copy, and one bound in situ, as for Pesetsky, has a single copy; a deleted copy above the pronounced one is Huang's covert movement, a pronounced copy between deleted ones Sato and Ngui's partial movement, and a token with two pronounced copies is shared, Citko's Parallel Merge. A copy is linked to the nearest copy whose projection c-commands it, c-command being Reinhart's (RoseTree.CCommands); the locality of links is in Locality/Chain.lean.

Main definitions

Implementation notes

  • On an object with traces, positions, not terms, individuate copies: two deleted copies of one token are the same term. Remnant movement carries a deleted copy away from its antecedent, so an externalized object can have orphan traces.

TODO

  • The chains of tokens as the contraction of the chains of the copy object of Derivation.replayWithCopies? (Copy/Replay.lean), where no remnant moves.

References

Chains of copies

L81

Form Copy relates an object to itself exactly when two positions of its chain are in c-command, in an object no term of which is merged with itself.

theorem LinearizedSyntacticObject.self_mem_copyRel_iffL96–105
{t : LinearizedSyntacticObject} {x : SyntacticObject} (hs : ∀ (p d : (↑t).Positions), Order.pred p ⋖ d → d ≠ p → t.termAt d ≠ t.termAt p) :
(x, x) ∈ (↑t).copyRel ↔ ∃ (p : (↑t).Positions) (q : (↑t).Positions), t.chainRel p q ∧ (↑t).CCommands ↑p ↑q ∧ t.termAt p = x

Built from

Copies

The pronounced copies, left to right.

def tokenListL133–135

Built from

Used by occurrences, occurrencesWith, mem_occurrences

Used in Syntax/Minimalist/Linearization/Multidominance, Syntax/Minimalist/Linearization/Spellout, Syntax/Minimalist/Linearization/SpelloutDomain, Syntax/Minimalist/Locality/AntiLocality, BejarRezac2009 and 3 more

The positions of the pronounced copies of tok.

def occurrencesL143–145

Built from

Used by occurrencesWith_eq, mem_occurrences, IsShared, instDecidableIsShared, HasAntecedent

Used in Syntax/Minimalist/Case/SyntacticObject, Syntax/Minimalist/Linearization/Spellout, ChanShen2026, CitkoGracaninYuksek2020, CitkoGracaninYuksek2025 and 1 more

Antecedents