KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesBoolean Powers: Construction and Basic PropertiesEngineering · Engineering MathematicsLesson 9/883← PrevNext →
GuidePublished 12 Aug 2026Updated 13 Aug 20268 min readBy Kevin Jogin
On this page

Ask about this page

KEVOS AIBoolean Powers: Construction and Basic Properties

KEVOS knowledge first · trusted web sources when needed

Boolean Constructions and Discriminator Varieties

Boolean Powers: Construction and Basic Properties

The Boolean power of an algebra by a Boolean algebra: a construction that transfers results about Boolean algebras to arbitrary varieties.

Category Engineering / MathematicsSource IV.5Pages 159-162Reading 2 minReviewed 2026-08-07

Learning objectives

  • Construct the Boolean power A[B]*
  • Describe its elements as locally constant functions
  • State which properties transfer from A to the Boolean power
On this page
  1. The construction
  2. Transfer properties
  3. Congruences of a Boolean power
  4. Relation to direct powers

The construction

Definition — Boolean power

For an algebra A and a Boolean algebra B, the Boolean power A[B]* is the algebra of continuous functions from the Stone space B* to A with the discrete topology, with operations defined pointwise.

Continuity into a discrete space means locally constant: each function takes finitely many values, and the preimage of each value is clopen. So an element of the Boolean power is a finite clopen partition of B* together with a choice of element of A on each block.

<strong>A</strong>[<strong>2</strong>]*
≅ A — the Stone space of 2 is a point
<strong>A</strong>[Su(<em>n</em>)]*
≅ An — finitely many points
<strong>A</strong>[<strong>B</strong>]* for atomless <strong>B</strong>
A genuinely new algebra, not a direct power

Transfer properties

The Boolean power lies in the variety

If A belongs to a variety V, so does A[B]*, since the operations are pointwise and identities are preserved by products and subalgebras.

What transfers from A to A[B]*
Property of <strong>A</strong>Holds in <strong>A</strong>[<strong>B</strong>]*?
Satisfies an identityYes
Belongs to a variety VYes
FiniteOnly if B is finite
SimpleNo — the Boolean power acquires congruences from B
Congruence-distributiveYes, as a property of the variety
Directly indecomposableNo, if B is non-trivial
The point of the construction

A Boolean power inherits the equational behaviour of A while acquiring the congruence structure of B. This lets facts about Boolean algebras — where everything is known — be exported into varieties where much less is known.

Congruences of a Boolean power

The congruence lattice of a Boolean power reflects both factors. When A is simple, the congruences of A[B]* correspond to the filters of B, so the congruence lattice of the Boolean power is that of B.

<strong>A</strong> simpleNo congruences to contribute
<strong>B</strong> arbitraryContributes its filter lattice
<strong>A</strong>[<strong>B</strong>]*Con ≅ filters of B
ConsequenceAny algebraic lattice realisable as a Boolean filter lattice is realisable in the variety
A construction tool for counterexamples

Boolean powers are the standard way to build algebras in a variety with prescribed congruence behaviour. Given a target lattice, find a Boolean algebra with that filter lattice and take the Boolean power of a simple member.

Relation to direct powers

The Boolean power generalises the direct power. Taking B = Su(I) for a set I gives Stone space the discrete space on I compactified, and the locally constant functions on it recover a subalgebra of AI.

Not every direct power is a Boolean power

For infinite I, the Boolean power by Su(I) consists only of functions taking finitely many values. The full direct power AI contains functions with infinitely many values and is strictly larger. The two coincide only when I is finite.

Frequently asked questions

Why locally constant rather than arbitrary functions?

Because continuity into a discrete space forces it, and because local constancy is what makes the construction respect the Boolean structure. Arbitrary functions would give the full direct power and lose the connection to B.

Is A[B]* determined by A and B up to isomorphism?

Yes. The construction depends only on the isomorphism types of A and B, since the Stone space is determined by B up to homeomorphism.

Related pages

  • Bounded Boolean Powers and Transfer Results
  • Direct Products and Factor Congruences

Source. S. Burris and H. P. Sankappanavar, A Course in Universal Algebra, The Millennium Edition — a corrected re-typesetting of Springer-Verlag Graduate Texts in Mathematics 78 (1981). Section IV.5, book pages 159-162.

This page is an original exposition prepared for the KEVOS® knowledge library. It restates and reorganises mathematical results; it is not a reproduction of the source text.

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 Boolean Powers: Construction and Basic Properties. 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 Boolean Powers: Construction and Basic Properties as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—boolean, construction, powers, properties, power—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

  1. Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
  2. Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
  3. Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
  4. Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
  5. 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.

StageRecordQuality check
InputObjects, domain, notation, assumptionsEvery symbol is defined
MethodPermitted operation or cited result at each stepAll hypotheses hold
OutputExact result and representationCorrect type, domain and form
VerificationSubstitution, invariant or alternative derivationIndependent agreement
Boundary testZero, identity, degenerate or failed hypothesisScope 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 Boolean Powers: Construction and Basic Properties?

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 boolean 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.

Continue learning

PMI Ecosystem Master MapGuide · Engineering MathematicsWhat Universal Algebra Is: Scope and MethodGuide · Engineering MathematicsLattices as Algebras: the Equational DefinitionGuide · Engineering MathematicsThe Definition of an Algebra and its TypeGuide · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®