Semi-Simple Filters in Residuated Lattices

• Semi-simple filters are filters in residuated lattices that decompose as joins of simple filters, paralleling semisimple rings.
• They generalize classical ring and module decompositions, linking key concepts like hyperarchimedeanity and socle constructions.
• Concrete examples include direct products of two-chains and ideal lattices of semisimple rings, underscoring their structural significance.

A semi-simple filter is a structural concept within the theory of residuated lattices, generalizing classical decompositions in ring and module theory to a broad lattice-theoretic context. Specifically, a semi-simple filter is a (necessarily proper) filter that can be expressed as a join of simple filters, exhibiting decomposition properties that directly mirror those of semisimple rings and modules. Central to the study of semi-simple filters is their interplay with hyperarchimedeanity, essentiality, the socle construction, and the topological properties of the spectrum of filters, notably in finite and semi-local residuated lattices (Rostami, 15 Nov 2025).

1. Formal Framework and Terminology

Let $L=(L,\wedge,\vee,\odot,\to,0,1)$ be a residuated lattice, where $(L,\wedge,\vee,0,1)$ forms a bounded lattice, $(L,\odot,1)$ is a commutative monoid, and the adjointness property $x\odot z\le y \Longleftrightarrow z\le x\to y$ holds. A subset $F\subseteq L$ is a filter if:

• $(F1)$: $x,y\in F \implies x\odot y\in F$
• $(F2)$: $x\in F,\, x\le y \implies y\in F$

A principal filter $[x)$ is defined as $\{y\in L\mid x^n\le y \text{ for some } n\}$.

An element $e\in L$ is complemented (Boolean) if there exists $e'$ with $e\wedge e'=0$ and $e\vee e'=1$; the Boolean center $B(L) = \{e \mid e \text{ is complemented}\}$. Every maximal filter $M$ in $L$ satisfies the residue test: $x\notin M \iff (x^n)^*\in M$ for some $n$.

2. Definition and Fundamental Properties

A filter $F\subsetneq L$ is called semi-simple if there exists a nonempty family of simple filters $\{T_i\}_{i\in I}$ such that:

$F = \bigvee_{i\in I} T_i$

A simple filter $T$ is a proper filter where the only filters contained in $T$ are $T$ itself and $\{1\}$; equivalently, $T$ is principal, generated by any $t\in T\setminus\{1\}$.

The construction ensures that semi-simple filters always decompose nontrivially via the join operation, assembling from the building blocks provided by simple filters.

3. Algebraic Characterizations

Several algebraic conditions are equivalent to the semi-simplicity of a filter $F$ in $L$ (Theorem 4.2):

Characterization	Description
(1) Join	$F=\bigvee_{i\in I} T_i$ for simple $T_i\subseteq F$
(2) Direct Sum	$F=\bigoplus_{i\in I} T_i$, with $T_j\cap(\bigvee_{i\neq j}T_i) = \{1\}$
(3) Decomposition	$\forall H\subseteq F$, there is $G$ with $F=H\oplus G$
(4) Boolean Complement	$F = H\oplus(H^*\cap F)$ for every $H\subseteq F$
(5) Essentiality	The only essential subfilter of $F$ is $F$ itself, i.e., $E_F = \{F\}$

These equivalences rely on the interchangeability of independent summand decompositions (via Zorn's lemma) and direct-sum structures. The role of essential filters is central: in the semi-simple context, $F$ admits no non-trivial essential subfilters.

4. Connections to Hyperarchimedeanity and Finiteness

A residuated lattice $L$ is hyperarchimedean if for every $x\in L$, there exists $n$ such that $x^n\in B(L)$. In the finite or semi-local setting, the following are equivalent (Corollary 4.5):

• $L$ as a filter is semi-simple.
• $L$ is hyperarchimedean.
• $Rad(L) = \{1\}$.

This result generalizes the familiar equivalence for semisimple rings: the radical is trivial precisely when the structure decomposes into simple components. In finite residuated lattices, every proper filter is an intersection of maximal filters, crystallizing the semi-simple property as a natural generalization of this well-known decomposition.

5. Interactions with Other Classes of Filters

• Simple and Maximal Filters: For $e\in B(L)$: $[e)$ is maximal iff $[e^*)$ is simple. When $Rad(L)=\{1\}$, every simple filter is principal, generated by a Boolean $e<1$; the complement principal filter is the unique maximal filter excluding $e$.
• Essential Filters: $F$ is essential iff $F^* = \{1\}$, equivalently, for every $x\neq 1$, there is $f\in F$ with $x\vee f = 1$.
• Socle: The socle $Soc(F)$ of a filter $F$ is the join of all simple subfilters. It satisfies $Soc(F) = \bigcap E_F$, and $Soc(L)\in E_L$ iff $L$ is semi-simple, i.e., every filter contains a simple subfilter.
• Topological Isolation: In $Rad(L)=\{1\}$, a maximal $M$ is an isolated point of $Max(L)$ iff $M = [e^*)$ for $e\in B(L)$, and $L = M\oplus [e)$.

This interplay yields a robust picture: semi-simplicity ensures that every filter contains (and is generated by) simple subfilters, and that maximal filters correspond to isolated points in the spectral topology.

6. Prototypical Examples

• Direct Product of Two-Chains: $D = \{0<1\}$ as a residuated lattice yields $L = D\times D$. $L$ is hyperarchimedean and finite, hence semi-simple. Its simple filters are $T_1 = [(1,0)]$ and $T_2 = [(0,1)]$, with $L = T_1 \oplus T_2$ as their direct sum; all filters are intersections of these maximals.
• Ideal Lattice of a Semisimple Ring: For $R = K_1\times\dots\times K_n$, a product of fields, $Id(R)\cong D^n$ is finite and hyperarchimedean, so its lattice of ideals is semi-simple. The simple filters are the kernels of the projection maps $\pi_i$:

$Id(R) = \bigoplus_{i=1}^n \ker(\pi_i)$

These models concretely realize the semi-simple decomposition, with maximal chains corresponding to elementary components.

7. Structural and Theoretical Significance

Semi-simple filters induce a direct summand decomposition of the ambient residuated lattice into its smallest nontrivial subfilters, i.e., the simple filters. In the finite (or Artinian) case, semi-simplicity is tantamount to hyperarchimedeanity: every element becomes Boolean after repeated multiplication. Topologically, semi-simplicity makes every maximal filter an isolated point in $Max(L)$, rendering the maximal spectrum a finite discrete space.

This framework recovers a noncommutative-nondistributive analogue of the Wedderburn–Artin theorem: a finite residuated lattice is semi-simple iff it is a finite direct product of simple (two-element) chains. Thus, semi-simple filters and residuated lattices unify order-theoretic, topological, and classical ring-theoretic perspectives on structure, decomposition, and discreteness (Rostami, 15 Nov 2025).