Docs / Phonology / Subregular / TierBased

Tier-based extensions of classes of languages

import Linglib.Phonology.Subregular.TierBased ยท namespace Language

A tier is a set of salient symbols, and a language holds on a tier of a word when it contains the word's projection, what is left after erasing the symbols off the tier. Reading a language on a tier is a homomorphism Language.onTier T of Boolean algebras, and the tier-based extension Language.tierBased ๐’ž of a class ๐’ž of languages collects the members of ๐’ž read on some tier. Heinz, Rawal and Tanner introduce the construction for the strictly local languages and Lambert extends it to every class.

A symbol is neutral for a language when inserting or deleting it never changes membership, which is to say that its syntactic class is the identity. The symbols off the tier are neutral for a language read on it, and a language is its own reading on a tier exactly when the symbols off the tier are neutral. So a language read on a tier is the same base language read on the symbols that are not neutral, which lie on every tier it can be read on: every tier-based language has a least tier.

Implementation notes

A tier is a predicate T : ฮฑ โ†’ Prop together with its decidability, as for FreeMonoid.filter: tierBased quantifies over both, โˆƒ T, โˆƒ _ : DecidablePred T, โ€ฆ, in the manner of mathlib's ComputablePred. The base language of a tier-based language ranges over the whole alphabet. Lambert takes it over the symbols of the tier, which gives the same extension for a class whose members over the tier's symbols are the restrictions of its members over the alphabet.

References

Reading a language on a tier

The language L read on the tier T, Lambert's [L]_T: the words whose projection to T lies in L. It is the inverse image of L under FreeMonoid.filter T, as a homomorphism of Boolean algebras.

def onTierL55โ€“63
{ฮฑ : Type u_1} (T : ฮฑ โ†’ Prop) [DecidablePred T] :
BoundedLatticeHom (Language ฮฑ) (Language ฮฑ)
  • onTier T = { toFun := fun (L : Language ฮฑ) => {w : List ฮฑ | List.filter (fun (b : ฮฑ) => decide (T b)) w โˆˆ L}, map_sup' := โ‹ฏ, map_inf' := โ‹ฏ, map_top' := โ‹ฏ, map_bot' := โ‹ฏ }

Used by mem_onTier, onTier_true, onTier_onTier, reverse_onTier, tierBased, onTier_mem_tierBased, syntacticClass_onTier_eq_one, of_syntacticClass_onTier_ne_one, onTier_eq_self_iff, onTier_salient, exists_onTier_salient_eq_of_mem_tierBased

Used in Phonology/Subregular/Multitier, Phonology/Subregular/TierStrictlyLocal, Lambert2026

L66
L68โ€“69
L71โ€“72
L74โ€“76

The tier-based extension

The tier-based extension of a class ๐’ž consists of the members of ๐’ž read on a tier.

def tierBasedL82โ€“84
{ฮฑ : Type u_1} (๐’ž : Set (Language ฮฑ)) :
Set (Language ฮฑ)
  • tierBased ๐’ž = {L : Language ฮฑ | โˆƒ (T : ฮฑ โ†’ Prop) (x : DecidablePred T), โˆƒ L' โˆˆ ๐’ž, (onTier T) L' = L}

Built from

Used by onTier_mem_tierBased, subset_tierBased, tierBased_mono, exists_onTier_salient_eq_of_mem_tierBased

Used in Phonology/Subregular/Multitier, Phonology/Subregular/TierStrictlyLocal, Lambert2026

L86โ€“88
L90
L92โ€“94

Neutral symbols and the least tier

L102โ€“106
L108โ€“111

A language is its own reading on a tier exactly when the symbols off the tier are neutral.

theorem onTier_eq_self_iffL113โ€“116
{ฮฑ : Type u_1} {L : Language ฮฑ} {T : ฮฑ โ†’ Prop} [DecidablePred T] :
(onTier T) L = L โ†” โˆ€ (a : ฮฑ), ยฌT a โ†’ L.syntacticClass [a] = 1

Built from

A language read on a tier is the same base language read on the symbols that are not neutral for it. These lie on the tier by of_syntacticClass_onTier_ne_one, so they form the least tier the language can be read on.

theorem onTier_salientL118โ€“133
{ฮฑ : Type u_1} {L L' : Language ฮฑ} {T : ฮฑ โ†’ Prop} [DecidablePred T] [DecidablePred fun (a : ฮฑ) => L.syntacticClass [a] โ‰  1] (h : (onTier T) L' = L) :
(onTier fun (a : ฮฑ) => L.syntacticClass [a] โ‰  1) L' = L

Built from

L135โ€“141