@cite{pesetsky-2013} — Russian Case Morphology and the Syntactic Categories #
Pesetsky's central thesis: morphological case is the realization of a
syntactic part-of-speech category. The four major cases line up with
the four traditional lexical categories, formalized here as a
restriction of Minimalism's Cat:
| Case | POS category | Assigner |
|---|---|---|
| Genitive | N | every noun (Primeval Genitive, p. 9) |
| Nominative | D | the D head of a DP |
| Accusative | V | a transitive V (under VACC, eq. 77 p. 66) |
| Obliques | P | a P head; DAT canonical exemplar (p. 7) |
Pesetsky writes (book p. 7): "only the distinctions among these oblique
cases in Russian will fail to correspond to a traditional
part-of-speech distinction" — P_OBL is canonical, P_DAT is one
exemplar with additional features. POSCat.cases returns the Russian
oblique series for .P (DAT/INS/LOC, matching
Fragments.Slavic.Russian.Case.caseInventory); POSCat.canonicalExemplar
picks DAT.
Architecture: layered grounding on Minimalism #
This is a Minimalist study. Its tree is SyntacticObject
(@cite{marcolli-chomsky-berwick-2025}, formalized in
Theories/Syntax/Minimalist/Basic.lean); its structure-building
operation is merge; its categories are members of Cat. Per-leaf
case stacks are a derived structural property of the
SyntacticObject — caseStackAt walks the tree, treating left-Merge
as "head + complement" per Pesetsky's Minimalist convention, and
prepends the head's POSCat to the complement's leaves. No external
state, no side-map: the case stack at a leaf is a function of the
tree structure plus the leaf's identity.
The genuinely paper-specific apparatus is small:
- POSCat — the {N,D,V,P} restriction of Minimalism's
Catto the four case-bearing categories. The injectionPOSCat.toCatmakes the restriction structural rather than parallel. - caseStackAt / surfaceCase — Pesetsky's FA realized as
structural recursion over the SO. Each
.node head bodystep in the tree corresponds to a Merge; ifhead.outerCatis a POSCat and the queried leaf is inbody, the head's category is prepended to the leaf's stack. This is FA "version 3 of 6" (@cite{pesetsky-2013} eq. (76), book p. 65) made implicit: complementation-requirements gating is not modeled (treated as always satisfied), and "designated as feature assigner for β" is exactly thePOSCat.ofCat? head.outerCattest (only N/D/V/P heads FA). - One-Suffix Rule (Ch 3) — Russian's spell-out: the outermost
stratum (head of the stack) is realized; inner strata are deleted.
Encoded by
surfaceCase = (caseStackAt ...).head?.map .... - Primeval Genitive Conjecture (eq. (6), p. 9) — NGEN
categorizes a Russian root as a noun in the lexicon, in the spirit
of @cite{marantz-1997}'s root + categorizer. Automatic from the
recursion: a leaf with
outerCat = .Ncarries[POSCat.N]in its base case, so any noun-categorized LIToken has primeval N without explicit initialization. The structural bridge to DMCategorizer.nisprimevalN_via_dm_categorizer.
Two corollaries reshape standard Case theory #
Every noun is "born" with NGEN in the lexicon. The base case of
caseStackAtfor anouterCat = .Nleaf returns[POSCat.N]without input.Nominative as Schützean default. D-Merge assigns DNOM (eq. (87) p. 73 — D does assign nominative morphology); but DNOM is "default" in the sense of Schütze 1997, 2001 (cited p. 73): D's assignment survives in subject position because Russian finite T does not assign features under FA, so nothing later overwrites it. When V intervenes (transitive object under eq. 77 conditions), V overwrites with VACC; otherwise DNOM stays. This inverts the standard "T assigns NOM" view — Pesetsky writes (p. 72) that he has "never needed to assume that nominative morphology is assigned to the elements of DP by anything other than D itself."
What is and isn't modeled #
Modeled: FA version 3 of 6 (eq. (76) p. 65) with α-cat / β-target
entanglement implicit in the structural recursion; Russian One-Suffix
Rule; Primeval Genitive (with DM Categorizer.n bridge); the four POS
categories as restriction of Cat; the basic NOM/ACC/GEN/OBL bridge;
noDeletionSpellOut as the limiting "no deletion" case (Lardil
itself has partial deletion per Ch 3 §3.2 — modeled here as the
limit, with the actual Lardil pattern deferred); cross-framework
agreement bridge with @cite{caha-2009}.
Out of scope (deferred to follow-on study files or commits):
- The complete VACC restriction (eq. 77 p. 66 —
[+FEM,+SG] ∨ [+ANIM] ∨ [+PRONOMINAL]) plus the realization rules eq. (80) p. 67 (assignment-vs-realization is a two-layer story); to be added in a follow-on commit with a paper-local phi-feature side-map. - FA versions 4-6: Spell-Out locality (Ch 8 §8.3 eq. (110)/(111)
p. 87-88) and the Prototype mechanism (Ch 9). The current
caseStackAtrealizes onto every leaf of body; this is wrong for multi-leaf body under Spell-Out — for the single-leaf cases §6 models, the difference doesn't arise. - The Number Mismatch puzzle for paucals (Ch 4) — dva stola showing SG on the noun but PL on demonstratives/adjectives — and the Lebanese Arabic # parallel (Ch 5.3). The structural derivation (Quant-to-D with NBR pied-piping, eq. (61) p. 54) is left to a follow-on study.
- The full D-headed PP analysis of POBL↔VACC alternations (Ch 7).
- The realistic
[DP D [NP A N]]Russian DP geometry (eq. (62) p. 54) — §6 theorems use the schematicD + Ndirect-merge. - The complementation-requirements gate (eq. (76a)). The current
recursion treats every Merge as FA-firing; modeling the gate
requires either a Bool-tagged
Stepextension or filtering the derivation history.
Connections #
Theories/Syntax/Minimalist/Basic.lean— the substrate.Cat,SyntacticObject,LIToken,mergeall consumed here. The derivation-step infrastructure inTheories/Syntax/Minimalist/Derivation.leanis the natural next layer once FA gating is modeled.Theories/Morphology/DM/Categorizer.lean(@cite{harley-2014}) — the structural bridgeprimevalN_via_dm_categorizerconnectsPOSCat.Nto DMCategorizer.nviaCat.N.Core.Case(Blake) gives the cross-linguistic case inventory; we bridgePOSCat → Finset Core.Case(POSCat.cases) so Pesetsky's primitives plug into the existing typology.Core.Case.Orderprovides Caha'scontainmentRank; thepesetsky_caha_compatible_prefixtheorem records the cross- framework agreement (Pesetsky's on-Caha-hierarchy image equals Caha's full hierarchy).Fragments/Slavic/Russian/Case.leanlists the Russian 6-case inventory.- vrač and Pesetsky's feminizing Ж analysis (Ch 5) are noted; the
morphological-declension claim itself is owned by
Phenomena/Gender/Studies/Kramer2020.lean::vrač_morph_masculine.
Pesetsky's four POS-as-case categories. Each is the homonym of a
member of Minimalism's Cat; toCat is the structural injection,
toCat_injective proves the embedding faithful.
Implementation note: this is an inductive type rather than a
Subtype of Cat because pattern matching on a subtype requires
totality branches for the unreachable Cat constructors — Cat has
25+ constructors of which only 4 are POSCat-relevant. The
inductive form with toCat injection carries the same content
(the four-way restriction is provable, not just intended) without
polluting every match with a _ => unreachable.
- N : POSCat
Genitive — the universal noun stratum (Primeval Genitive).
- D : POSCat
Nominative — assigned by D.
- V : POSCat
Accusative — assigned by transitive V, subject to the eq. 77 restriction.
- P : POSCat
Obliques (DAT/INS/LOC) — assigned by P. Pesetsky writes the category as P_OBL with P_DAT as the canonical exemplar (book p. 7); the file does not refine the oblique class by POS, mirroring the paper.
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.instDecidableEqPOSCat x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Structural injection of POSCat into Minimalism's Cat. Each
POSCat constructor maps to its homonym in Cat.
Equations
Instances For
The cases each POSCat realizes as in Core.Case. N/D/V each map
to a singleton; P maps to the Russian productive oblique series
(DAT/INS/LOC, matching Fragments.Slavic.Russian.Case.caseInventory)
since @cite{pesetsky-2013} (p. 7) explicitly does not refine
the obliques by POS.
Equations
Instances For
The canonical exemplar case Pesetsky uses when naming each POSCat.
For P, the exemplar is DAT (p. 7); see cases for the full
oblique series.
Equations
- Phenomena.Case.Studies.Pesetsky2013.POSCat.N.canonicalExemplar = UD.Case.gen
- Phenomena.Case.Studies.Pesetsky2013.POSCat.D.canonicalExemplar = UD.Case.nom
- Phenomena.Case.Studies.Pesetsky2013.POSCat.V.canonicalExemplar = UD.Case.acc
- Phenomena.Case.Studies.Pesetsky2013.POSCat.P.canonicalExemplar = UD.Case.dat
Instances For
Recover a POSCat from the corresponding Cat constructor, when
possible. Returns none for non-case-bearing categories (T, C, v,
n, Voice, Place, Path, ...). The none cases include the DM
categorizers (.n, .v, .a) and Pesetsky's "non-FA-bearing"
functional heads.
Equations
- Phenomena.Case.Studies.Pesetsky2013.POSCat.ofCat? Minimalist.Cat.N = some Phenomena.Case.Studies.Pesetsky2013.POSCat.N
- Phenomena.Case.Studies.Pesetsky2013.POSCat.ofCat? Minimalist.Cat.D = some Phenomena.Case.Studies.Pesetsky2013.POSCat.D
- Phenomena.Case.Studies.Pesetsky2013.POSCat.ofCat? Minimalist.Cat.V = some Phenomena.Case.Studies.Pesetsky2013.POSCat.V
- Phenomena.Case.Studies.Pesetsky2013.POSCat.ofCat? Minimalist.Cat.P = some Phenomena.Case.Studies.Pesetsky2013.POSCat.P
- Phenomena.Case.Studies.Pesetsky2013.POSCat.ofCat? x✝ = none
Instances For
Equations
Instances For
The case stack at a leaf, computed by structural recursion over the SyntacticObject. No external state.
Phase 1.0 substrate caveat: under MCB nonplanar SOs (FreeCommMagma
carrier), caseStackAt's .node head body case asymmetrically
distinguishes head from body (head's POSCat copies onto body's
leaves, not vice versa). merge head body = merge body head strictly,
so this asymmetric structural recursion no longer respects the
quotient. Phase 1.0 placeholder via Quot.out (the outerCat
accessor inside is itself noncomputable Phase 1.0). TODO Phase 2:
use LCA-based head selection per MCB §1.13.
Equations
- Phenomena.Case.Studies.Pesetsky2013.caseStackAt so tok = Phenomena.Case.Studies.Pesetsky2013.caseStackAt.caseStackAtPlanar (Quot.out so) tok
Instances For
Equations
- One or more equations did not get rendered due to their size.
- Phenomena.Case.Studies.Pesetsky2013.caseStackAt.caseStackAtPlanar (FreeMagma.of (Sum.inr val)) a✝ = []
Instances For
Russian One-Suffix Rule (@cite{pesetsky-2013} Ch 3): the outermost
stratum (head of the stack) is realized as morphology; inner
strata are deleted. Returns none for empty stacks (no overt
case marker). Phase 1.0 noncomputable: depends on caseStackAt.
Equations
Instances For
The "no deletion" spell-out: realize the entire case stack overtly. The "rule" is the identity on stacks.
This is the limiting case of "no deletion at all", not a
faithful description of Lardil itself. Per @cite{richards-2013}
and @cite{pesetsky-2013} Ch 3 §3.2, Lardil has partial deletion
(e.g., FUT only stacks outside GEN, not outside ACC); a faithful
Lardil model requires modeling the partial-deletion pattern, left
for a follow-on Phenomena/Case/Studies/Richards2013.lean.
Equations
Instances For
No-deletion spell-out and Russian One-Suffix diverge whenever the
stack has ≥ 2 strata: Russian shows only the outer (via
List.head?), no-deletion shows both. This is the core
morphological signature of the proposal — Russian being the
deletion limit, Lardil-style stacking being intermediate.
The Primeval Genitive Conjecture (@cite{pesetsky-2013} eq. (6), book p. 9): "NGEN categorizes a Russian root as a noun (in the lexicon)." A bare noun, before any further FA application, has an N-stratum case feature.
This is a categorizing-head property in the spirit of
@cite{marantz-1997}'s root + categorizer architecture — the
structural bridge to DM's Categorizer.n is recorded in
primevalN_via_dm_categorizer below. In this file, Primeval
Genitive is automatic from the recursion: a leaf with
outerCat = .N returns [POSCat.N] from caseStackAt's base
case without any explicit initialization step.
This convenience constructor builds an N-categorized leaf with the given phonological form.
Equations
Instances For
Russian kniga 'book': bare, surface case is GEN (the N stratum realized via One-Suffix). The Primeval Genitive is automatic from the structural recursion — no explicit initialization needed.
Structural bridge: the N-stratum that caseStackAt produces for
an N-categorized leaf agrees with the syntactic category produced
by DM's n categorizer (@cite{harley-2014}, @cite{marantz-1997}).
The Primeval Genitive Conjecture is the case-bearing reflection
of root-level n-categorization — both produce Cat.N as the
syntactic category.
The cross-categorial dual: POSCat.V agrees with DM Categorizer.v.
Together with primevalN_via_dm_categorizer, this records the
structural alignment between Pesetsky's case-bearing categories
and DM's lexical-category categorizers. P and D are not DM
categorizers (they are functional heads), so no analog applies.
Three numeral classes in Russian (@cite{pesetsky-2013} Ch 4–6). The classes differ in where they merge and whether they raise to D, not in case-assignment behavior — none of them is itself an FA case assigner in Pesetsky's framework:
- paucal (
dva,tri,četyre): an instance of NBR, base-merged directly with a numberless N inside NP (eq. (61), p. 54). The GEN morphology on the head noun is the primeval NGEN, not an assignment from the paucal. - higher (
pjat',šest', …): an instance of QUANT, base-merged higher within NP and pied-piping NBR to D. - quant (
mnogo,nemnogo,skol'ko): also QUANT, with the raising option absent for the indefinite-quantity exponents.
Across all three the noun's surface case is GEN, but for a structural reason: the derivation blocks D from probing the noun (Quant-to-D with NBR pied-piping), so the primeval N stratum is the only one One-Suffix has to project. The full Quant-to-D derivation is the empirical core of Ch 4–6 and is out of scope for this file.
- paucal : RusNumClass
- higher : RusNumClass
- quant : RusNumClass
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.instDecidableEqRusNumClass x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
A Russian numeral lexical entry. Minimal — just form and class.
TODO: when a Fragments/Slavic/Russian/Numerals.lean exists,
these entries should move there as theory-neutral lexical data.
- form : String
- cls : RusNumClass
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.dva = { form := "dva", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.paucal }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.tri = { form := "tri", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.paucal }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.četyre = { form := "četyre", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.paucal }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.pjat' = { form := "pjat'", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.higher }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.šest' = { form := "šest'", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.higher }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.mnogo = { form := "mnogo", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.quant }
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.skol'ko = { form := "skol'ko", cls := Phenomena.Case.Studies.Pesetsky2013.RusNumClass.quant }
Instances For
The structural role of each numeral class within the extended NP.
- nbrHead : NumeralRole
NBR head, base-merged inside NP with a numberless N.
- quantHead : NumeralRole
QUANT head, base-merged above NP, may raise to D.
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.instDecidableEqNumeralRole x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- Phenomena.Case.Studies.Pesetsky2013.RusNumClass.paucal.role = Phenomena.Case.Studies.Pesetsky2013.NumeralRole.nbrHead
- Phenomena.Case.Studies.Pesetsky2013.RusNumClass.higher.role = Phenomena.Case.Studies.Pesetsky2013.NumeralRole.quantHead
- Phenomena.Case.Studies.Pesetsky2013.RusNumClass.quant.role = Phenomena.Case.Studies.Pesetsky2013.NumeralRole.quantHead
Instances For
Iff form: paucals are exactly the NBR-head numerals.
Iff form: higher and quant are exactly the QUANT-head numerals.
Surface prediction shared by dva stola, pjat' stolov, mnogo
studentov: GEN morphology on the head noun. In this file's
simplified model — where numerals do not themselves invoke FA —
the noun retains its primeval [POSCat.N] stack and One-Suffix
selects N. The witness is primeval_noun_surface_gen from §4; no
separate numeral-indexed theorem is needed because the file's
apparatus has no way for the numeral to influence the head noun's
stack. The structural mechanism that prevents later FA from D
(Quant-to-D, eq. (61) p. 54) is the actual content of Pesetsky
Ch 4–6 and is out of scope.
Subject DP receives DNOM via D-Merge. The Schützean default framing (Pesetsky Ch 7 §7.2, eq. (87) p. 73): D does assign DNOM (book p. 72: "I have never needed to assume that nominative morphology is assigned to the elements of DP by anything other than D itself"); but DNOM is "default" in Schütze's sense (1997, 2001 cited p. 73) because Russian finite T does not assign features under FA, so D's DNOM survives — nothing later overwrites it in subject position.
Schematic geometry: this theorem uses the minimal D + N
direct-merge demonstrating FA mechanics. The realistic Russian DP
(eq. (62) p. 54) is [DP D [NP A N]] and is left to a follow-on
commit. Note: distinctness of the noun's and D-head's LITokens is
automatic from their different item fields (different cats);
the LIToken IDs may even coincide harmlessly.
Object DP receives VACC via V-Merge — when Pesetsky's eq. (77)
restriction is satisfied (the [+FEM,+SG] / [+ANIM] / [+PRONOMINAL]
disjunction; modeled in a follow-on commit). This unrestricted
version is the schematic FA-success case; eq. (77) gates whether
FA applies, eq. (80) gates whether VACC is realized — the
file currently models neither of these two layers, hence the
unrestricted naming.
Subject vs. object derivations differ only in the outermost assigner; the primeval-N stratum underneath is identical.
The image of POSCat in Cat is exactly the four case-bearing
members. This is the structural alignment with Minimalism: POSCat
is not a separate enum but the {N,D,V,P} restriction of Cat.
The cases realized by Pesetsky's four POS categories. Defined as
an explicit literal so membership reduces under decide —
Finset.biUnion (the conceptually purer form) blocks decide on
its Multiset.Quot.lift reduction.
Equations
Instances For
pesetskyCore is the union of POSCat.cases over all four POS
categories — the content the literal definition is shorthand for.
Every case in the canonical-exemplar image lies in pesetskyCore.
The canonical-exemplar image sits inside the Russian inventory.
The three productive Russian obliques are all in pesetskyCore,
contributed by the P category per @cite{pesetsky-2013} p. 7.
Cross-framework agreement with @cite{caha-2009}: Pesetsky's
POS-as-case image, restricted to the cases that have a
containmentRank in Caha's hierarchy
(NOM⊂ACC⊂GEN⊂DAT⊂LOC⊂...), coincides with the standard
five-case core. Pesetsky additionally puts INST in pesetskyCore
(via .P) — this is the case Caha's hierarchy doesn't rank
(compare Core/Case/Order.lean's docstring listing
"ERG, ABS, INST, COM" as off-hierarchy).
A non-trivial agreement — not refutation. The two frameworks identify the same five-case core, with Pesetsky adding INST outside the Caha hierarchy.