Core Universal Algebra

Direct Products, Factor Congruences and Direct Indecomposability

A direct decomposition is a pair of complementary permuting congruences. Once decomposition is phrased that way, uniqueness questions become lattice questions.

Engineering · Mathematics3 min readKV-MATH-0216

Learning objectives

Construct direct products and their projections for arbitrary index sets.
Define factor congruences and characterise direct decompositions by them.
Determine when an algebra is directly indecomposable.
Explain why unique factorisation can fail.
Relate factor congruences to the centre and to Boolean constructions.

01Direct products and projections

Given a family of algebras of the same type indexed by I, the direct product has the cartesian product as universe and operations defined coordinatewise.

f^∏A(a⃗₁,…,a⃗ₙ)(i) = f^Aᵢ(a⃗₁(i),…,a⃗ₙ(i))

Each projection πᵢ onto the i-th coordinate is a surjective homomorphism, and its kernel is the congruence identifying elements agreeing at i.

Direct powers A^I are the special case of a constant family, and they carry most of the weight in the Boolean constructions stream: Boolean powers are subalgebras of direct powers cut out by continuity conditions.

02Factor congruences

A pair of congruences θ, φ on A is a pair of complementary factor congruences when they meet to Δ, join to ∇, and permute.

The three conditions and what each supplies
Condition	Statement	Supplies
Meet trivial	θ ∧ φ = Δ	the map into the product is injective
Join total	θ ∨ φ = ∇	necessary for surjectivity
Permutability	θ ∘ φ = φ ∘ θ	surjectivity onto the product

CautionComplementation alone is not enough

Two congruences meeting to Δ and joining to ∇ give an embedding of A into the product of the two quotients, but not necessarily an isomorphism. Permutability is what upgrades the subdirect embedding to a direct decomposition, and omitting it is a common error.

03The internal characterisation of decomposition

ProcedureRecognising a direct decomposition internally

in: A, θ, φ → out: isomorphism A ≅ A/θ × A/φ, or failure

input: algebra A, congruences θ, φ ∈ Con A
check θ ∧ φ = Δ
check θ ∨ φ = ∇
check θ ∘ φ = φ ∘ θ
if all three hold:
A ≅ (A/θ) × (A/φ) via a ↦ ⟨a/θ, a/φ⟩
conversely every direct decomposition arises from such a pair
output: decomposition, or a report of which condition fails

Correctness: injectivity from the meet, surjectivity from join plus permutability. Caveat: in a congruence-permutable variety the third condition is free, which is why decomposition theory is much simpler for groups, rings and modules.

The reformulation converts an external question — is A isomorphic to a product? — into an internal one about the congruence lattice. In a congruence-permutable variety, factor congruences are exactly complemented pairs, and the set of factor congruences forms a Boolean sublattice of Con A.

04Directly indecomposable algebras

A is directly indecomposable when it is not isomorphic to a product of two non-trivial algebras — equivalently, when Δ and ∇ are its only factor congruences.

Automatic

Simple algebras

Con A = {Δ, ∇} leaves no room for a non-trivial factor pair, so every simple algebra is directly indecomposable.

Also automatic

Subdirectly irreducible

A unique atom in Con A cannot be complemented non-trivially, so subdirectly irreducible implies directly indecomposable.

Not the converse

Indecomposable but reducible

Directly indecomposable algebras need not be subdirectly irreducible. The implications run one way only.

The hierarchy is: simple ⟹ subdirectly irreducible ⟹ directly indecomposable, with both implications strict. Keeping the three apart matters, because the structure theorems apply to different levels — Birkhoff's theorem decomposes into subdirect irreducibles, not into directly indecomposables.

05Unique factorisation and its failure

Where it holds

Modular congruence lattice plus finiteness

Ore's theorem gives unique direct factorisation for algebras with modular congruence lattices satisfying chain conditions. This covers finite groups and modules.

Where it fails

General algebras

Without modularity or without chain conditions, an algebra can have essentially different direct decompositions. Counterexamples exist among relatively well-behaved structures.

Ore's 1936 result connecting modular congruence lattices to unique factorisation was an early demonstration that congruence-lattice conditions carry real structural content, and the source cites it as a turning point in the classification programme.

Frequently asked

Is a subalgebra of a product a product of subalgebras?

No, and this is the whole reason subdirect products exist as a separate notion. A subalgebra of A × B projects onto subalgebras of each factor but need not be their product — the graph of an isomorphism between A and B is a subalgebra projecting onto both fully while being far from the full product.

Why must factor congruences permute?

Without permutability the natural map into the product of quotients is injective but not surjective, giving a subdirect embedding rather than a direct decomposition. Permutability is exactly the condition that every pair of classes intersects, which is surjectivity.

Do factor congruences form a Boolean algebra?

In a congruence-permutable variety, yes — the factor congruences form a Boolean sublattice of Con A, and this is the entry point for Boolean product representations. In general the set of factor congruences is less well behaved, which is why the Boolean constructions stream works within congruence-permutable or arithmetical settings.

Sources and further reading

S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, Millennium Edition (a corrected re-typesetting of Springer GTM 78, 1981).
G. Grätzer, Universal Algebra, 2nd edition, Springer.
R. McKenzie, G. McNulty and W. Taylor, Algebras, Lattices, Varieties, Volume I.

Original KEVOS® explanatory article. Written from the topic map of the cited works; no text is reproduced from them.