Docs / Semantics / Degree / Marginality / Hom

Homomorphisms of marginal scales

import Linglib.Semantics.Degree.Marginality.Hom · namespace MarginalScale

A homomorphism of marginal scales preserves and reflects smaller than and marginally smaller than, the representations of the measurement theory of Dinis & Jacinto 2025. It embeds the blocks of one scale in those of the other, and a homomorphism into lexicographic pairs is an embedding of the blocks and of the degrees of each block.

References

Declarations

A homomorphism of marginal scales preserves and reflects smaller than and marginally smaller than.

structure IsHomL30–35
{α : Type u_1} [LinearOrder α] {β : Type u_2} [LinearOrder β] (ml : MarginalScale α) (ml' : MarginalScale β) (f : α → β) :

Used by IsHom.largelyLT_iff, IsHom.atMostMarginal_iff, IsHom.injective, isHom_iff_atMostMarginal, IsHom.id, IsHom.comp, IsHom.mapBlock, IsHom.mapBlock_toBlock, IsHom.mapBlock_comp, isHom_lex_iff, IsHom.fst_eq_fst_iff, isHom_toLex, IsHom.fstOrderEmbedding, IsHom.fstOrderEmbedding_toBlock, IsHom.sndOrderEmbedding, IsHom.sndOrderEmbedding_apply, isHomLexEquiv

Used in DinisJacinto2025, DinisJacinto2026

L49
L51–57

A homomorphism of marginal scales embeds the blocks of one in the blocks of the other.

IsHom.mapBlockL66–72
noncomputable def MarginalScale.IsHom.mapBlock {α : Type u_1} [LinearOrder α] {ml : MarginalScale α} {β : Type u_2} [LinearOrder β] {ml' : MarginalScale β} {f : α → β} (hf : ml.IsHom ml' f) :
ml.Block ↪o ml'.Block
  • hf.mapBlock = OrderEmbedding.ofStrictMono (Quotient.lift (fun (x : α) => ml'.toBlock (f x)) ⋯) ⋯

Built from

Used by IsHom.mapBlock_toBlock, IsHom.mapBlock_id, IsHom.mapBlock_comp, IsHom.fstOrderEmbedding

L80–82
L95–109
L111–113
L115–123
L125–127
L129–132
L134–140
L142–145

A homomorphism into lexicographic pairs is an embedding of the blocks together with an embedding of the degrees of each block.

isHomLexEquivL148–156
noncomputable def MarginalScale.isHomLexEquiv {α : Type u_1} [LinearOrder α] (ml : MarginalScale α) (β : Type u_2) (γ : Type u_3) [LinearOrder β] [LinearOrder γ] [Nontrivial β] [Nonempty γ] [NoMaxOrder γ] [NoMinOrder γ] :
{ f : α → Lex (β × γ) // ml.IsHom (lex β γ) f } ≃ (ml.Block ↪o β) × ((q : ml.Block) → { x : α // ml.toBlock x = q } ↪o γ)

The definition is too large to print here; read it in the source.

Built from