A new characterization of arithmeticity

MaRDI QIDQ5950761zbMATH OpenFDO

Authors Kalle Kaarli

Publication date 16 December 2001

Published in Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

arithmeticitycompatible functionequivalence lattice

Mathematics Subject Classification ID

Lattice ideals, congruence relations (06B10)

Review text

A function \(f:A\to A\) is called a choice function modulo \(\Theta\) (for an equivalence \(\Theta\) on \(A\)) if for each \(\Theta \)-class \(B\), there is \(b\in B\) such that \(f(x)=b\) for each \(x\in B\). A function \(f\) on \(A\) is called \(L\)-compatible (for a sublattice \(L\) of \(\text{Eqv }A\)) if it preserves all \(\Theta \in L\). An equivalence lattice \(L\) satisfies the Compatible Choice Function condition if for any \(a\in A, \Theta \in L\) there exists a compatible choice function modulo \(\Theta \) having \(a\) as a fixed point. The author proves that every equivalence lattice \(L\) satisfying the Compatible Choice Function condition is arithmetical. The converse is valid for \(L\) finite.

Recommendations

• scientific article; zbMATH DE number 432739
• Compatible functions and the Chinese remainder theorem
• An Equivalence‐Theoretic Equivalent of the Axiom of Choice
• Compatible function extension property
• Semilattices of finite arithmetical algebras

Cited in

(3)

• Congruence computations in principal arithmetical varieties
• Alternative Characterizations of Precomplete Numerations
• Arithmetical functions on a locally finite, locally semi-modular, local lattice.

This page was built for publication: A new characterization of arithmeticity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950761)