A reduced product identifies elements agreeing on a large set, where a filter decides largeness. It sits between the direct product and the ultraproduct, and Horn sentences are exactly what survives.
Engineering · Mathematics11 min readKV-MATH-0250
Learning objectives
Construct the reduced product of a family over a filter.
Verify the induced relation is a congruence.
Identify direct products and ultraproducts as special cases.
State which sentences are preserved by reduced products.
Define Horn sentences and recognise them.
Explain why identities and quasi-identities are Horn.
01The construction
Given structures indexed by I and a filter F on the power set of I, identify two elements of the direct product when the set of coordinates where they agree lies in F.
θF := { ⟨f, g⟩ : ⟦f = g⟧ ∈ F } where ⟦f = g⟧ := { i : f(i) = g(i) } ∏iAi/F := ∏iAi / θF
The double-bracket notation for agreement sets matches the Boolean product usage in Chapter IV — deliberately, since the constructions are related.
ProcedureVerifying θ_F is a congruence
in: family A_i, filter F → out: θ_F is a congruence
reflexive: ⟦f = f⟧ = I ∈ F since F is a filter
symmetric: ⟦f = g⟧ = ⟦g = f⟧
transitive: ⟦f = g⟧ ∩ ⟦g = h⟧ ⊆ ⟦f = h⟧
F is closed under intersection and upward closed, so ⟦f = h⟧ ∈ F
compatible: if ⟦f_k = g_k⟧ ∈ F for k = 1,…,n then
⋂_k ⟦f_k = g_k⟧ ⊆ ⟦F(f⃗) = F(g⃗)⟧ for any operation F
finite intersection stays in F, so the image agrees on a large set
therefore θ_F ∈ Con(∏ A_i)
Every filter axiom is used exactly once: I ∈ F for reflexivity, intersection closure for transitivity and compatibility, upward closure to conclude membership. Caveat: relations are handled separately — r holds in the quotient when it holds on a set in F.
Relation symbols need a separate clause because the quotient must decide whether r(f₁,…,fₘ) holds. The convention is that it holds when the set of coordinates where it holds is in F. For algebras there are no relations and the question does not arise.
02The two extremes
Reduced products by choice of filter
Filter F
θ_F
Result
{I} — the trivial filter
Δ
the direct product itself
principal at i₀
agreement at i₀
isomorphic to A_{i₀}
the improper filter (all subsets)
∇
the trivial one-element structure
Fréchet filter (cofinite sets)
eventual agreement
a genuine reduced product
an ultrafilter U
θ_U
the ultraproduct
The ultraproduct is the case where the filter is maximal, and it is the only case where all first-order sentences transfer. For a general filter only Horn sentences do, which is the theorem below.
03Horn sentences
A basic Horn formula is a disjunction of literals with at most one of them positive. A Horn sentence is built from these by conjunction and universal quantification.
Horn forms and their readings
Form
Equivalent reading
Example
¬φ₁ ∨ ⋯ ∨ ¬φₙ ∨ ψ
(φ₁ & ⋯ & φₙ) → ψ
a quasi-identity
ψ
a positive atomic assertion
an identity
¬φ₁ ∨ ⋯ ∨ ¬φₙ
¬(φ₁ & ⋯ & φₙ)
a negative condition
Key resultHorn sentences are preserved by reduced products
If every Ai satisfies a Horn sentence σ, then so does every reduced product ∏Ai/F. This is the reduced product preservation theorem, and identities and quasi-identities are the cases that matter algebraically.
Identities are Horn: an identity p ≈ q is a single positive literal universally quantified. Quasi-identities are Horn: an implication between a conjunction of equations and one equation. So both classes transfer to reduced products, which is why varieties and quasivarieties are closed under the construction.
04Why the restriction to Horn
The proof of preservation uses the filter's closure under finite intersection, and it breaks precisely where a disjunction with two positive literals appears.
Positive atomic case
If ψ holds in every factor it holds on I ∈ F, so it holds in the quotient. No difficulty.
Implication case
If the hypotheses hold on a set in F, the conclusion holds there too by the factor hypothesis. Intersection closure keeps the set large.
Where it fails: two positive literals
A sentence ψ₁ ∨ ψ₂ might have ψ₁ holding on some coordinates and ψ₂ on others, with neither set in F. The disjunction then fails in the quotient though it holds in every factor.
Ultrafilters repair this
An ultrafilter decides every subset, so one of the two sets is in F. This is exactly why ultraproducts preserve all sentences and reduced products do not.
CautionThe failure is real, not an artefact of the proof
Explicit examples exist of non-Horn sentences holding in every factor and failing in a reduced product. The restriction to Horn sentences is a characterisation, not merely the limit of one proof technique.
05Filtered products in the Boolean setting
Reduced product
Filter on a set
Indexed by an arbitrary set with a filter on its power set. The general model-theoretic construction.
Filtered Boolean power
Filter data on the values
The Chapter IV construction. Related but distinct — the filtering constrains which locally constant functions are admitted, rather than which coordinates count as large.
The two notions are frequently confused because both are called 'filtered'. The reduced product filters the index set; the filtered Boolean power filters the value assignments. Both appear in the Burris and Werner decidability argument and are used for different purposes.
06The characterisation theorem
Preservation by reduced products characterises Horn sentences up to logical equivalence, giving a Birkhoff-style correspondence for this construction.
Key resultKeisler–Galvin characterisation
A first-order sentence is preserved under reduced products if and only if it is logically equivalent to a Horn sentence. Syntax and preservation coincide exactly, as in Birkhoff's theorem.
This is the pattern the whole preservation-theorem programme follows and which the next pages continue: identify a construction, identify the syntactic class preserved by it, and prove the two coincide. Birkhoff's HSP theorem is the equational instance, and each preservation theorem is a further instance.
Frequently asked
Is a reduced product over the Fréchet filter interesting?
Yes — it identifies sequences agreeing eventually, which is the natural notion for limit constructions. It is not an ultraproduct, since the Fréchet filter is not maximal, so only Horn sentences transfer. Extending it to an ultrafilter is what gives the full Łoś theorem.
Do reduced products preserve identities?
Yes, since identities are Horn. This is consistent with varieties being closed under P and H: a reduced product is a quotient of a direct product, so closure under P and H already guarantees it for varieties.
Why do relations need a separate clause?
Because the quotient must assign a truth value to r on equivalence classes, and the natural definition — r holds when it holds on a set in the filter — is a choice that must be made explicitly. For algebras with no relation symbols the question is vacuous, which is why the algebraic literature often omits the clause.
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.
Handbook application: from concept to controlled practice
Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Reduced Products and Filtered Products. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.
The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.
Treat Reduced Products and Filtered Products as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—products, horn, reduced, filtered, filter—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.
For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.
A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.
Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.
Step-by-step operating method
Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.
Worked-example protocol
Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.
Stage
Record
Quality check
Input
Objects, domain, notation, assumptions
Every symbol is defined
Method
Permitted operation or cited result at each step
All hypotheses hold
Output
Exact result and representation
Correct type, domain and form
Verification
Substitution, invariant or alternative derivation
Independent agreement
Boundary test
Zero, identity, degenerate or failed hypothesis
Scope is understood
Common failure modes and recovery actions
1. Watch for
Using a theorem without checking every hypothesis.
Recovery: Return to the governing definition or requirement and restate the decision in one sentence.
2. Watch for
Treating a suggestive example as a proof of the general case.
Recovery: Separate evidence from assumption, assign an owner and set a date for validation.
3. Watch for
Changing notation or conventions part-way through an argument.
Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.
4. Watch for
Hiding a division-by-zero, convergence, finiteness or commutativity assumption.
Recovery: Record the consequence, decision and rationale, then update the controlled baseline.
5. Watch for
Reporting a computed result without a residual, substitution or structural check.
Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.
Review checklist
Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?
Questions for deeper application
What is the most important distinction a practitioner must preserve when applying Reduced Products and Filtered Products?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which assumption about products would change the result most if it proved false?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What evidence would allow an independent reviewer to reproduce or challenge the conclusion?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Which boundary, exception or failure case has not yet been tested?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
What must be handed over, monitored or reviewed after the immediate work is complete?
Answer with a fact or cited source where available. Where evidence is incomplete, record the assumption, consequence, responsible owner and next validation action.
Authoritative references and use notes
The sources below were selected as institutional or primary guidance for the broader practice. They support the handbook method; they do not imply that every statement or clause in a source applies to every project. Confirm the current edition, jurisdiction, contract and application before treating any requirement as mandatory.
MIT OpenCourseWare — Algebra I — Massachusetts Institute of Technology. Used for groups, vector spaces, linear transformations and linear groups. Accessed 2026-08-13.
The Stacks Project — table of contents — The Stacks Project. Used for commutative algebra, homological algebra, modules and derived categories. Accessed 2026-08-13.
