A new characterization of arithmeticity (Q5950761)

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.