Docs / Syntax / Gender / AgreementClasses

Agreement classes and target genders

import Linglib.Syntax.Gender.AgreementClasses

This file defines the agreement classes of a language's nouns and the target genders of its agreement targets, and classifies the map between the target genders of two numbers, in the lattice of partitions.

An agreement class is a set of nouns that take the same agreement forms on every target in every morphosyntactic form, and the controller genders of a language are its agreement classes. The forms a target shows are its target genders, and the agreement classes are the meet of the partitions they induce; there may be fewer target genders than controller genders, Romanian having three of the latter over two of the former in each number. The partitions of the genders by two numbers' target genders are equal, as in French, the singular's strictly finer, as in German, or incomparable, as in Romanian or Lak. A strictly finer plural would distinguish more target genders, which Greenberg's universal 37 excludes.

Main definitions

Main results

Implementation notes

  • The index T of the agreement map is whatever the map is restricted to: a target category, a morphosyntactic form, or a pair of the two, so that target genders can be counted per target as well as per number across targets.
  • An assignment N → G gives every noun one controller gender, the Canonical Gender Principle of Corbett & Fedden 2016.
  • The relations between two numbers take any controllers; the fragments state them of their genders rather than their nouns.
  • The kernel of a map is the syncretism of Morphology/Paradigm/Basic.lean, read here over the controllers a target agrees with rather than over the cells of a paradigm.
  • Subgenders, agreement classes differing on a minority of forms, inquorate genders, small closed classes whose pattern mixes other genders, and overdifferentiated targets are the steps from agreement classes to controller genders that remain to be defined; until then the agreement classes of a fragment are its controller genders only when the fragment records no such class.

References

Declarations

The controller genders are at most the product of the target genders over the targets.

theorem Gender.card_range_le_prodL111–116
{N : Type u_1} {T : Type u_2} {F : Type u_3} [Finite N] [Fintype T] (agr : N → T → F) :
Nat.card ↑(Set.range agr) ≤ ∏ t : T, Nat.card ↑(targetGenders agr t)

Built from

L147–149
L151–153
L155–157

A convergent map distinguishes strictly fewer target genders in the second number.

theorem Gender.Convergent.card_range_ltL159–164
{F : Type u_3} {G : Type u_4} {F' : Type u_5} {sg : G → F} {pl : G → F'} [Finite G] (h : Convergent sg pl) :
Nat.card ↑(Set.range pl) < Nat.card ↑(Set.range sg)

Built from

L168
L170
L172

Polarity

A polar exponent of gender and number, the Somali article, is syncretic across the numbers and within neither (Corbett 1991 chapter 7; Corbett 1998), so it separates the genders and is a parallel system.