Nez Perce Clausal Embedding Inventory

[Dea10] [Dea16] [Dea26]

Nez Perce (Sahaptian, ISO 639-3 nez) inventory of notional-complement-taking predicates plus the relative-pronoun paradigm. Theory-light: each predicate carries only consensus-typological metadata (CTP class per [Noo07], factivity per [TBRS13]-style projection trials, [Dea26] §3/§6) and one morphological observable — the grammaticality status of yox̂ ke on the complement edge. The analytical relative-vs-simplex split, selectional features, and projection-site claims are Deal-specific apparatus and live in the co-located Studies/Deal2026.lean.

The relative-pronoun paradigm is from [Dea16] as reproduced at [Dea26] (22); case and number values reuse Core.UD substrate.

Predicate schema

inductive NezPerce.Clause.EdgeRequirement : Type

Grammaticality status of the yox̂ ke morpheme pair on a predicate's notional-complement edge — a morphological observable, recording what the morphology does, not what it means.

[Dea26]: obligatory for the relative-embedding takers ((28)); prohibited for neki and hi ((65)); marginal for cuukwe — (66b) is %-marked, and consultants "did on rare occasions accept" and once produced it, so cuukwe permits a bare complement rather than rejecting the marked one.

• obligatory : EdgeRequirement
• marginal : EdgeRequirement

  Rarely/marginally accepted (%-marked).

• prohibited : EdgeRequirement

@[instance_reducible]

instance NezPerce.Clause.instDecidableEqEdgeRequirement : DecidableEq EdgeRequirement

Equations

• NezPerce.Clause.instDecidableEqEdgeRequirement x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

@[instance_reducible]

instance NezPerce.Clause.instReprEdgeRequirement : Repr EdgeRequirement

Equations

• NezPerce.Clause.instReprEdgeRequirement = { reprPrec := NezPerce.Clause.instReprEdgeRequirement.repr }

def NezPerce.Clause.instReprEdgeRequirement.repr : EdgeRequirement → ℕ → Std.Format

Equations

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

structure NezPerce.Clause.NezPerceEmbedder : Type

A Nez Perce notional-complement-taking predicate.

• ctpClass: [Noo07] category. Emotive factives are commentative; cognitive factives are knowledge; think is propAttitude; say is utterance.
• factive: by projection trials in entailment-canceling environments ([Dea26] §3 (33)–(36), §6 (68)). Deal notes the trials assess only the projection dimension of the [TBRS13] taxonomy.
• yoxKeEdge: the yox̂ ke edge observable ([Dea26] (28), (65), (66)).

• form : String
• gloss : String
• ctpClass : CTPClass
• factive : Bool
• yoxKeEdge : EdgeRequirement

def NezPerce.Clause.instDecidableEqNezPerceEmbedder.decEq (x✝ x✝¹ : NezPerceEmbedder) : Decidable (x✝ = x✝¹)

Equations

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

@[instance_reducible]

instance NezPerce.Clause.instDecidableEqNezPerceEmbedder : DecidableEq NezPerceEmbedder

Equations

• NezPerce.Clause.instDecidableEqNezPerceEmbedder = NezPerce.Clause.instDecidableEqNezPerceEmbedder.decEq

@[instance_reducible]

instance NezPerce.Clause.instReprNezPerceEmbedder : Repr NezPerceEmbedder

Equations

• NezPerce.Clause.instReprNezPerceEmbedder = { reprPrec := NezPerce.Clause.instReprNezPerceEmbedder.repr }

def NezPerce.Clause.instReprNezPerceEmbedder.repr : NezPerceEmbedder → ℕ → Std.Format

Equations

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

Relative-embedding predicates ([Dea26] §3)

Emotive factives (commentative per [Noo07]) plus one cognitive factive; all require yox̂ ke on the complement edge ((28)), with factivity established by projection trials ((33)–(34)).

def NezPerce.Clause.liloy : NezPerceEmbedder

lilooy 'be happy'. [Dea26] (27a).

Equations

• NezPerce.Clause.liloy = { form := "lilooy", gloss := "be happy", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.etqew : NezPerceEmbedder

'etqew 'be sad'. [Dea26] (27b).

Equations

• NezPerce.Clause.etqew = { form := "'etqew", gloss := "be sad", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.cicwaay : NezPerceEmbedder

cicwaay 'be surprised'. [Dea26] (27c).

Equations

• NezPerce.Clause.cicwaay = { form := "cicwaay", gloss := "be surprised", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.eeys : NezPerceEmbedder

'eey's 'be joyful'. [Dea26] (27e).

Equations

• NezPerce.Clause.eeys = { form := "'eey's", gloss := "be joyful", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.qeese : NezPerceEmbedder

q'eese' 'be bothered, unhappy'. [Dea26] (27e).

Equations

• NezPerce.Clause.qeese = { form := "q'eese'", gloss := "be bothered", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.timneneki : NezPerceEmbedder

tim'neeneki 'be worried'. [Dea26] (27e).

Equations

• NezPerce.Clause.timneneki = { form := "tim'neeneki", gloss := "be worried", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.timiipni : NezPerceEmbedder

timiipni 'remember'. [Dea26] (27d). Classed by Noonan as knowledge (cognitive factive) but with the same relative-embedding morphosyntax as the emotive factives — whether knowledge predicates are relative-embedding takers is a per-language property (contrast English remember).

Equations

• NezPerce.Clause.timiipni = { form := "timiipni", gloss := "remember", ctpClass := CTPClass.knowledge, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

def NezPerce.Clause.qeciyeewyew : NezPerceEmbedder

qe'ciyeew'yew' 'thank you' — an unanalyzable particle, not a verb, taking notional complements with relative-embedding morphosyntax while disallowing all nominal complements ([Dea26] §4 (42); fn. 16). Its factivity follows [Dea26] §7's generalization that all relative embeddings are factive (no per-item projection trial is reported).

Equations

• NezPerce.Clause.qeciyeewyew = { form := "qe'ciyeew'yew'", gloss := "thank you", ctpClass := CTPClass.commentative, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.obligatory }

Simplex-taking predicates ([Dea26] §6)

def NezPerce.Clause.neki : NezPerceEmbedder

neki 'think'. [Dea26] (48), (65a). Non-factive; rejects yox̂ ke on the complement edge.

Equations

• NezPerce.Clause.neki = { form := "neki", gloss := "think", ctpClass := CTPClass.propAttitude, factive := false, yoxKeEdge := NezPerce.Clause.EdgeRequirement.prohibited }

def NezPerce.Clause.hi : NezPerceEmbedder

hi 'say, tell'. [Dea26] (47), (65b). Non-factive; rejects yox̂ ke. Unlike the relative-embedding takers, hi is transitive: it takes an accusative addressee and triggers object agreement ((47a)).

Equations

• NezPerce.Clause.hi = { form := "hi", gloss := "say, tell", ctpClass := CTPClass.utterance, factive := false, yoxKeEdge := NezPerce.Clause.EdgeRequirement.prohibited }

def NezPerce.Clause.cuukwe : NezPerceEmbedder

cuukwe 'know'. [Dea26] (66), (68). Factive (projection survives a conditional antecedent, (68)) but canonically simplex-embedding — the relative-marked variant is only marginally accepted ((66b), %-marked). The factive-but-simplex combination is [Dea26]'s central dissociation: factivity does not force relative-embedding morphology.

Equations

• NezPerce.Clause.cuukwe = { form := "cuukwe", gloss := "know", ctpClass := CTPClass.knowledge, factive := true, yoxKeEdge := NezPerce.Clause.EdgeRequirement.marginal }

Inventories

def NezPerce.Clause.allEmbedders : List NezPerceEmbedder

All embedders surveyed in [Dea26]: 8 relative-canonical + 3 simplex-canonical. Source-of-truth list; relativeCanonical and simplexCanonical are derived views via the yoxKeEdge observable.

Equations

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

def NezPerce.Clause.relativeCanonical : List NezPerceEmbedder

The relative-canonical predicates: yox̂ ke obligatory on the complement edge.

Equations

• NezPerce.Clause.relativeCanonical = List.filter (fun (x : NezPerce.Clause.NezPerceEmbedder) => x.yoxKeEdge == NezPerce.Clause.EdgeRequirement.obligatory) NezPerce.Clause.allEmbedders

def NezPerce.Clause.simplexCanonical : List NezPerceEmbedder

The simplex-canonical predicates: those permitting a bare complement (yox̂ ke prohibited or merely marginal) — [Dea26] §6's "conservative generalization".

Equations

• NezPerce.Clause.simplexCanonical = List.filter (fun (x : NezPerce.Clause.NezPerceEmbedder) => x.yoxKeEdge != NezPerce.Clause.EdgeRequirement.obligatory) NezPerce.Clause.allEmbedders

theorem NezPerce.Clause.relativeCanonical_membership : relativeCanonical = [liloy, etqew, cicwaay, eeys, qeese, timneneki, timiipni, qeciyeewyew]

Drift sentry: relativeCanonical contains exactly the eight predicates [Dea26] lists at (27a–e), (27d), (42).

theorem NezPerce.Clause.simplexCanonical_membership : simplexCanonical = [neki, hi, cuukwe]

Drift sentry: simplexCanonical contains exactly neki, hi, cuukwe.

theorem NezPerce.Clause.allEmbedders_partitioned : allEmbedders = relativeCanonical ++ simplexCanonical

Partition: every embedder is either relative-canonical or simplex-canonical (no third category in [Dea26]'s survey).

Factivity generalisations (observation-level)

theorem NezPerce.Clause.relativeCanonical_all_factive : (relativeCanonical.all fun (x : NezPerceEmbedder) => x.factive) = true

All relative-canonical predicates are factive. [Dea26] §3, §7.

theorem NezPerce.Clause.factive_simplex_membership : List.filter (fun (x : NezPerceEmbedder) => x.factive) simplexCanonical = [cuukwe]

The factive simplex-canonical predicates: exactly cuukwe 'know'.

theorem NezPerce.Clause.nonfactive_simplex_membership : List.filter (fun (x : NezPerceEmbedder) => !x.factive) simplexCanonical = [neki, hi]

The non-factive simplex-canonical predicates: exactly neki and hi.

theorem NezPerce.Clause.cuukwe_factive_but_simplex : cuukwe.factive = true ∧ cuukwe ∈ simplexCanonical

Factivity does not predict relative-canonical status: cuukwe 'know' is factive but simplex-canonical ([Dea26]'s central dissociation — in Nez Perce factivity is necessary but not sufficient for relative-embedding morphosyntax).

Relative-pronoun paradigm

The yox̂/ko paradigm from [Dea16], reproduced at [Dea26] (22). Cells are indexed by Core.UD.Case (Nom/Erg/Acc) × Core.UD.Number.

structure NezPerce.Clause.RelativePronoun : Type

A relative-pronoun cell from [Dea26] (22).

• case : UD.Case
• number : UD.Number
• forms : List String

@[instance_reducible]

instance NezPerce.Clause.instReprRelativePronoun : Repr RelativePronoun

Equations

• NezPerce.Clause.instReprRelativePronoun = { reprPrec := NezPerce.Clause.instReprRelativePronoun.repr }

def NezPerce.Clause.instReprRelativePronoun.repr : RelativePronoun → ℕ → Std.Format

Equations

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

@[instance_reducible]

instance NezPerce.Clause.instHasNumberRelativePronoun : HasNumber RelativePronoun

A relative pronoun bears its number slot (HasNumber).

Equations

• NezPerce.Clause.instHasNumberRelativePronoun = { numberOf := fun (rp : NezPerce.Clause.RelativePronoun) => Number.fromUD rp.number }

def NezPerce.Clause.rp_nom_sg : RelativePronoun

Equations

• NezPerce.Clause.rp_nom_sg = { case := UD.Case.Nom, number := UD.Number.Sing, forms := ["yox̂"] }

def NezPerce.Clause.rp_nom_pl : RelativePronoun

Equations

• NezPerce.Clause.rp_nom_pl = { case := UD.Case.Nom, number := UD.Number.Plur, forms := ["yox̂me"] }

def NezPerce.Clause.rp_erg_sg : RelativePronoun

Equations

• NezPerce.Clause.rp_erg_sg = { case := UD.Case.Erg, number := UD.Number.Sing, forms := ["konim"] }

def NezPerce.Clause.rp_erg_pl : RelativePronoun

Equations

• NezPerce.Clause.rp_erg_pl = { case := UD.Case.Erg, number := UD.Number.Plur, forms := ["konmam"] }

def NezPerce.Clause.rp_acc_sg : RelativePronoun

Equations

• NezPerce.Clause.rp_acc_sg = { case := UD.Case.Acc, number := UD.Number.Sing, forms := ["konya"] }

def NezPerce.Clause.rp_acc_pl : RelativePronoun

Equations

• NezPerce.Clause.rp_acc_pl = { case := UD.Case.Acc, number := UD.Number.Plur, forms := ["konmana", "yox̂mene"] }

def NezPerce.Clause.relativePronounParadigm : List RelativePronoun

The full paradigm: three cases × two numbers, six cells.

Equations

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

theorem NezPerce.Clause.paradigm_membership : List.map (fun (p : RelativePronoun) => (p.case, p.number)) relativePronounParadigm = [(UD.Case.Nom, UD.Number.Sing), (UD.Case.Nom, UD.Number.Plur), (UD.Case.Erg, UD.Number.Sing), (UD.Case.Erg, UD.Number.Plur), (UD.Case.Acc, UD.Number.Sing), (UD.Case.Acc, UD.Number.Plur)]

Drift sentry: the paradigm covers exactly the Nom/Erg/Acc × Sing/Plur cells.

theorem NezPerce.Clause.acc_pl_variants : rp_acc_pl.forms = ["konmana", "yox̂mene"]

The accusative-plural cell shows idiolectal variation: two attested forms.