Papers
Topics
Authors
Recent
Search
2000 character limit reached

Free-Forgetful Adjunction in Effect Algebras

Updated 20 December 2025
  • Free-forgetful adjunction is an adjoint pair where the left functor freely adjoins a top element and orthosupplementation, while the right functor forgets this extra structure.
  • The unitization functor constructs effect algebras from generalized effect algebras by extending the structure with a canonical greatest element and orthosupplementation.
  • The adjunction is monadic, meaning effect algebras are precisely the Eilenberg-Moore algebras for the induced monad, grounding the construction in categorical logic.

A free-forgetful adjunction is an adjoint pair of functors in which the right adjoint “forgets” a designated part of the algebraic or categorical structure, while the left adjoint “freely adds” that structure in a canonical way. In the context of the categories of generalized effect algebras (GEffAlg) and effect algebras (EffAlg), this adjunction is realized by the unitization construction, which freely adjoins a top element and orthosupplementation to a generalized effect algebra, transforming it into an effect algebra. The forgetful functor simply discards this extra structure. The adjunction is monadic, so the category of effect algebras can be reconstructed as the category of algebras for the monad induced by this adjunction (Jenča, 2017).

1. Categories: Generalized Effect Algebras and Effect Algebras

A generalized effect algebra (GEffAlg) is a partial algebra P=(P;0,)P = (P;0,\oplus) where 0P0 \in P is a constant and \oplus is a binary partial operation defined on a domain ("orthogonality" \perp), with the following axioms:

  • (P1) ab    baa \perp b \implies b \perp a and ab=baa \oplus b = b \oplus a,
  • (P2) bcb \perp c and a(bc)    aba \perp (b \oplus c) \implies a \perp b; (ab)c(a \oplus b) \perp c and (ab)c=a(bc)(a \oplus b) \oplus c = a \oplus (b \oplus c),
  • (P3) a0a \perp 0 and a0=aa \oplus 0 = a,
  • (P4) ab=ac    b=ca \oplus b = a \oplus c \implies b = c,
  • (P5) ab=0    a=0a \oplus b = 0 \implies a = 0.

The canonical partial ordering is aba \leq b iff c:ac=b\exists c: a \oplus c = b. Morphisms are maps preserving $0$ and partial sums: f(0)=0f(0) = 0, and aba \perp b implies f(a)f(b)f(a) \perp f(b) and f(ab)=f(a)f(b)f(a \oplus b) = f(a) \oplus f(b).

An effect algebra (EffAlg) is a partial algebra E=(E;0,1,)E = (E;0,1,\oplus) such that (E;0,)(E;0,\oplus) is a generalized effect algebra, and 1E1 \in E is a greatest element (x1x \leq 1 for all xx). Morphisms φ:E1E2\varphi: E_1 \rightarrow E_2 are GEffAlg-morphisms preserving $1$.

2. The Forgetful Functor

The forgetful functor U:EffAlgGEffAlgU: \text{EffAlg} \rightarrow \text{GEffAlg} operates as follows:

  • Objects: U(E;0,1,)=(E;0,)U(E;0,1,\oplus) = (E;0,\oplus), forgetting the top element $1$;
  • Morphisms: U(φ)=φU(\varphi) = \varphi.

UU strictly forgets the nullary operation $1$ and is faithful.

3. The Unitization Functor

The left adjoint F:GEffAlgEffAlgF: \text{GEffAlg} \rightarrow \text{EffAlg}—the unitization functor—constructs the effect algebra F(P)F(P) from a generalized effect algebra P=(P;0,)P = (P;0,\oplus) as follows:

  • Underlying set: F(P)=PPF(P) = P \sqcup P^*, where P={aaP}P^* = \{ a^* \mid a \in P \} is a disjoint copy.
  • Distinguished constants: 0PF(P)0 \in P \subset F(P), and 1:=0P1 := 0^* \in P^*.
  • Partial sum:
    • aFba \perp_F b iff aPba \perp_P b, aFb:=aPbPa \oplus_F b := a \oplus_P b \in P.
    • aFba \perp_F b^* iff aba \leq b; aFb:=(bPa)a \oplus_F b^* := (b \ominus_P a)^*.
    • aFba^* \perp_F b iff aba \geq b; aFb:=(aPb)a^* \oplus_F b := (a \ominus_P b)^*.
    • aFba^* \perp_F b^* is never defined.

Functoriality: for f:PQf: P \to Q, F(f)(a)=f(a)F(f)(a) = f(a), F(f)(a)=f(a)F(f)(a^*) = f(a)^*.

4. The Adjunction and Its Universal Property

The adjunction FUF \dashv U is realized via the unit and counit natural transformations:

  • Unit η:IdGEffAlgUF\eta: \text{Id}_{\text{GEffAlg}} \rightarrow U F: for PP, ηP(x)=x\eta_P(x) = x (the inclusion).
  • Counit ε:FUIdEffAlg\varepsilon: F U \rightarrow \text{Id}_{\text{EffAlg}}: for EE, εE(x)=x\varepsilon_E(x) = x, εE(x)=x\varepsilon_E(x^*) = x' (orthosupplement in EE).

There is a natural bijection:

EffAlg(F(P),E)GEffAlg(P,U(E))\text{EffAlg}(F(P), E) \cong \text{GEffAlg}(P, U(E))

given by restricting an EffAlg-morphism φ:F(P)E\varphi: F(P) \to E to PP (via the unit), and conversely by extending ψ:PU(E)\psi: P \to U(E) to χ:F(P)E\chi: F(P) \to E defined by χ(a)=ψ(a)\chi(a) = \psi(a), χ(a)=(ψ(a))\chi(a^*) = (\psi(a))'. These assignments are mutual inverses.

The triangle identities

εF(P)F(ηP)=idF(P),U(εE)ηU(E)=idU(E)\varepsilon_{F(P)} \circ F(\eta_P) = \text{id}_{F(P)}, \quad U(\varepsilon_E) \circ \eta_{U(E)} = \text{id}_{U(E)}

hold by inspection on generators.

5. Monadicity and Beck's Theorem

An adjunction FUF \dashv U is monadic if UU creates the coequalizers of UU-split pairs and reflects isomorphisms (Beck's monadicity theorem). In this setting,

  • U:EffAlgGEffAlgU: \text{EffAlg} \to \text{GEffAlg} creates all coequalizers: if h:BZh: B \to Z is a coequalizer in GEffAlg, then ZZ inherits a top element h(1B)h(1_B) making it an effect algebra, and hh preserves it.
  • UU reflects isomorphisms: UU is faithful and strictly forgets only $1$.

Therefore, by Beck’s theorem, the adjunction is monadic.

6. The Induced Monad and Eilenberg-Moore Category

The induced monad T=UFT = U F on GEffAlg\text{GEffAlg} is given by:

  • T(P)=U(F(P))=PPT(P) = U(F(P)) = P \sqcup P^*, with unit ηP(x)=x\eta_P(x) = x and multiplication μP=U(εF(P))\mu_P = U(\varepsilon_{F(P)}) defined by:
  • μP(a)=a\mu_P(a) = a,
  • μP(a)=a\mu_P(a^*) = a^*,
  • μP(a)=a\mu_P(a^{**}) = a,
  • μP((a))=a\mu_P((a^*)^*) = a^*.

A TT-algebra is a pair (P,α)(P, \alpha) where α:T(P)P\alpha: T(P) \to P satisfies the usual monad unit and associativity axioms. Giving such an α\alpha is equivalent to endowing PP with a top element $1$ and an orthosupplement operation xxx \mapsto x' satisfying the axioms for effect algebras. The category of TT-algebras is isomorphic to EffAlg, and UU is (up to equivalence) the forgetful functor from EffAlg to GEffAlg. Thus,

GEffAlgTEffAlg\text{GEffAlg}^T \simeq \text{EffAlg}

and FUF \dashv U is monadic.

7. Significance and Connections

The free-forgetful adjunction between generalized effect algebras and effect algebras encapsulates the process of freely adjoining a top element and the associated orthosupplementation in quantum structures and effect-algebraic formulations of logic. The explicit unitization construction due to Hedl, as formalized in this adjunction, is canonical and monadic, meaning that effect algebras are precisely the Eilenberg-Moore algebras for the monad induced by the unitization process. This provides the categorical foundation for constructions and studies involving extensions, completions, and presentations of effect-theoretic objects (Jenča, 2017).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Free-Forgetful Adjunction.