direct product of partial algebras
Let and be two partial algebraic systems of type . The direct product of and , written , is a partial algebra of type , defined as follows:
- •
the underlying set of is ,
- •
for each -ary function symbol , the operation
is given by:
for , is defined iff both and are, and when this is the case,
It is easy to see that the type of is indeed : pick and such that and are defined, then is defined, so that is non-empty, where all operations are defined componentwise, and the two constants are and .
For example, suppose and are fields. They are both partial algebras of type , where the two ’s are the arity of addition and multiplication, the two ’s are the arity of additive and multiplicative inverses, and the two ’s are the constants and . Then , while no longer a field, is still an algebra of the same type.
Let be partial algebras of type . Can we embed into so that is some type of a subalgebra of ?
For example, if we fix an element , then the injection , given by is in general not a homomorphism only unless is an idempotent
with respect to every operation on (that is, . In addition, would have to be the constant for every constant symbol in . Following from the example above, if we pick any , then would have to be , since, , so that , or . But, on the other hand, , forcing
to be invertible
, a contradiction
!
Now, suppose we have a homomorphism , then we may embed into , so that is a subalgebra of . The embedding is given by .
Proof.
Suppose is defined. Since is a homomorphism, is defined, which means is defined. Furthermore, we have that
showing that is a homomorphism. In addition, if is defined, then it is clear that is defined, so that is a strong homomorphism. So is a subalgebra of . Clearly, is one-to-one, and therefore an embedding, so that is isomorphic to , and we may view as a subalgebra of .∎
Remark. Moving to the general case, let be a set of partial algebras of type , indexed by set . The direct product of these algebras is a partial algebra of type , defined as follows:
- •
the underlying set of is ,
- •
for each -ary function symbol , the operation is given by: for , is defined iff is defined for each , and when this is the case,
Again, it is easy to verify that is indeed a -algebra: for each symbol , the domain of definition is non-empty for each , and therefore the domain of definition , being , is non-empty as well, by the axiom of choice.
References
- 1 G. Grätzer: Universal Algebra
, 2nd Edition, Springer, New York (1978).