Super-Extended Ergativity in SJA Mam

@cite{scott-2023} @cite{england-2017}

Theory-neutral data on split ergativity in San Juan Atitán (SJA) Mam.

The Phenomenon

In matrix clauses, Mam shows a tripartite agreement pattern:

• A (transitive agent): Set A (ERG)
• S (intransitive subject): Set B (ABS)
• P (transitive patient): default Set B (no agreement)

In certain dependent clauses — purpose clauses headed by tu'n, reason clauses, taj 'when' clauses — the alignment shifts to what @cite{england-2017} calls super-extended ergativity: Set A marking extends to ALL arguments (S, A, and O). The system becomes "neutral" with all arguments receiving the same marker set.

The Split

The trigger is clause type, not aspect or person features:

• Matrix clauses: tripartite (ERG Set A / ABS Set B / default Set B)
• Super-extended ergative (SEE) clauses: neutral (all Set A)

Key Data Points

1. Intransitive S in SEE clauses: Set A (not Set B as in matrix)
2. Transitive A in SEE clauses: Set A (same as matrix)
3. Transitive O in SEE clauses: Set A on directional (not default Set B/ independent pronoun as in matrix). Only default 2/3SG Set A (t-) is allowed — agreeing Set A markers for the object are ungrammatical (@cite{scott-2023}, §2.6.3, ex. 196).

Why Not SplitErgativity?

Core.Case.SplitErgativity models a binary toggle between ergative and accusative alignment conditioned by some factor (e.g., aspect in Hindi). Mam's SEE split is not binary — it goes from tripartite (three distinct marking patterns) to neutral (one pattern for all). The custom MamAlignment struct captures this richer contrast directly.

See Also

Scott2023 for the Agree-based derivation of the matrix tripartite pattern (probe blocking by Voice_TR).

structure Scott2023.MamAlignment : Type

The Mam alignment in a given clause type.

• sMarker : Fragments.Mayan.MarkerSet

  Marker set for S (intransitive subject)

• aMarker : Fragments.Mayan.MarkerSet

  Marker set for A (transitive agent)

• oMarker : Fragments.Mayan.MarkerSet

  Marker set for O (transitive patient)

@[implicit_reducible]

instance Scott2023.instDecidableEqMamAlignment : DecidableEq MamAlignment

Equations

• Scott2023.instDecidableEqMamAlignment = Scott2023.instDecidableEqMamAlignment.decEq

def Scott2023.instDecidableEqMamAlignment.decEq (x✝ x✝¹ : MamAlignment) : Decidable (x✝ = x✝¹)

Equations

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

def Scott2023.instReprMamAlignment.repr : MamAlignment → ℕ → Std.Format

Equations

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

@[implicit_reducible]

instance Scott2023.instReprMamAlignment : Repr MamAlignment

Equations

• Scott2023.instReprMamAlignment = { reprPrec := Scott2023.instReprMamAlignment.repr }

def Scott2023.matrixAlignment : MamAlignment

Matrix clause alignment: tripartite. S = Set B (ABS), A = Set A (ERG), O = default Set B (no agreement).

Equations

• Scott2023.matrixAlignment = { sMarker := Fragments.Mayan.MarkerSet.setB, aMarker := Fragments.Mayan.MarkerSet.setA, oMarker := Fragments.Mayan.MarkerSet.setB }

def Scott2023.seeAlignment : MamAlignment

Super-extended ergative alignment: neutral (all Set A).

Equations

• Scott2023.seeAlignment = { sMarker := Fragments.Mayan.MarkerSet.setA, aMarker := Fragments.Mayan.MarkerSet.setA, oMarker := Fragments.Mayan.MarkerSet.setA }

theorem Scott2023.matrix_s_ne_a : matrixAlignment.sMarker ≠ matrixAlignment.aMarker

Matrix alignment is tripartite: S, A, O each have distinct marking patterns (S ≠ A by marker set; S ≡ O by marker set but S has real agreement while O has default — the tripartite distinction is agreement-based, not marker-set-based).

theorem Scott2023.see_is_neutral : seeAlignment.sMarker = seeAlignment.aMarker ∧ seeAlignment.aMarker = seeAlignment.oMarker

SEE alignment is neutral: all arguments get the same marker set.

theorem Scott2023.split_ergativity : matrixAlignment.sMarker ≠ seeAlignment.sMarker ∧ matrixAlignment.oMarker ≠ seeAlignment.oMarker ∧ matrixAlignment.aMarker = seeAlignment.aMarker

The split: matrix and SEE differ in S marking and O marking.

theorem Scott2023.a_invariant : matrixAlignment.aMarker = seeAlignment.aMarker

A is invariant across the split: Set A in both matrix and SEE.

inductive Scott2023.SEETrigger : Type

Subordinators that trigger super-extended ergativity in SJA Mam.

• tun : SEETrigger
• taj : SEETrigger
• aj : SEETrigger
• chix : SEETrigger
• nim : SEETrigger
• nanx : SEETrigger

@[implicit_reducible]

instance Scott2023.instDecidableEqSEETrigger : DecidableEq SEETrigger

Equations

• Scott2023.instDecidableEqSEETrigger x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Scott2023.instReprSEETrigger.repr : SEETrigger → ℕ → Std.Format

Equations

• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.tun prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.tun")).group prec✝
• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.taj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.taj")).group prec✝
• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.aj prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.aj")).group prec✝
• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.chix prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.chix")).group prec✝
• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.nim prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.nim")).group prec✝
• Scott2023.instReprSEETrigger.repr Scott2023.SEETrigger.nanx prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Scott2023.SEETrigger.nanx")).group prec✝

@[implicit_reducible]

instance Scott2023.instReprSEETrigger : Repr SEETrigger

Equations

• Scott2023.instReprSEETrigger = { reprPrec := Scott2023.instReprSEETrigger.repr }

def Scott2023.seeTriggerAlignment : SEETrigger → MamAlignment

All SEE triggers yield the same neutral alignment.

Equations

• Scott2023.seeTriggerAlignment x✝ = Scott2023.seeAlignment

def Scott2023.objectSetAIsDefault : Bool

In SEE clauses, object Set A markers are restricted to the default 2/3SG form (t-). Agreeing Set A markers for the object are ungrammatical. This parallels the default Set B (tz'=) pattern for objects in matrix clauses.

Equations

• Scott2023.objectSetAIsDefault = true

theorem Scott2023.object_default_parallel : objectSetAIsDefault = true

The parallel: in BOTH matrix and SEE, the object slot shows default (non-agreeing) morphology. The default marker just changes:

• Matrix: default Set B (tz'=)
• SEE: default Set A (t-)