# Phil 455: Relations between Algebras

## Subalgebras

Suppose we have an arbitrary algebra `⟨Α, ★, ...⟩`. A subalgebra will be an algebra (usually of the same kind as the original) whose universe is a subset of `Α`, and uses the same operations `★, ...`

For example, we said that one group is `⟨ℤ, +, 0⟩`. A subgroup of this would be ⟨𝔼±, +, 0⟩, where 𝔼± is the set of even integers (earlier I used the symbol `𝔼` to represent the set of even numbers, that is, integers `≥ 0`). Note that this subset of the original universe is closed under `+` and includes the `+`-inverses of every element it includes; if it didn’t, our subalgebra here wouldn’t count as a group.

An important result in group theory states that the size of any subgroup — that is, the number of elements in its universe — is a divisor (without remainder) of the size of the original group.

## Isomorphisms

Two alegbras are said to be isomorphic when there’s a translation between them that preserves all of their structure. It’s as though the algebras differ only in terms of the “names” of their elements and operations. Such a translation is called an isomorphism.

What “preserving all the structure” involves will depend on what kind of algebra we’re talking about. For example, if `⟨Α, ★, Ⓐ⟩` and `⟨Β, ⊛, Ⓑ⟩` are two groups, then an isomorphism between them will be a bijective function `f` such that for all `x,y ∈ Α`:

``f(x ★ y) = f(x) ⊛ f(y)``

Further, the identity `Ⓐ` of the first group will be such that `f(Ⓐ) =` the identity `Ⓑ` of the second group. Further, where `x ∈ Α` and `x̅` is its inverse wrt `★`, then `f(x̅)` will be the inverse of `f(x)` wrt `⊛`.

Some of the requirements I just listed are redundant: it can be proved that if we only insist on a smaller list of requirements, we get the others for free. But I’ve spelled this out more explicitly so as to illustrate what’s meant by the desideratum that `f` preserves the structure of the algebra it’s translating from. The idea is: it doesn’t matter whether you perform `★` first, and then translate into the `⟨Β, ⊛, Ⓑ⟩` group, or translate first and then perform `⊛`.

When there exists at least one isomorphism between two algebras, then they count as isomorphic. The symbol `≅` is commonly used to express the relation of being isomorphic.

Here’s an example of an isomorphism, from the group `⟨{1,2,3,4}, * mod 5, 1⟩` to the group `ℤ₄ = ⟨{0,1,2,3}, + mod 4, 0⟩`:

``````f(1) = 0

f(2) = 1

f(3) = 3

f(4) = 2``````

## (Homo)morphisms

Notice that in the example above, the isomorphism was a bijective function between the algebras’ universes. This is a general requirement: the kinds of translations that are called “isomorphisms” have to be bijections.

However, there is a more general notion which relaxes that requirement. These more general translations are called homomorphisms or sometimes just morphisms. I’ll call them (homo)morphisms.

Don’t confuse this with the notions of homeomorphisms and homotopy, which are used to express ideas like your coffee mug being topologically equivalent to a donut. Those aren’t notions we’ll be talking about. Homology is yet another notion with a similar-sounding name — also with connections to topology — that is different from what we’re talking about here.

As with isomorphisms, let’s still require a (homo)morphism to be a function from one universe onto the other (sometimes this isn’t required).

And it still has to be the case that `f(x ★ y) = f(x) ⊛ f(y)` and so on. But we will lift the restriction that the translation function be injective.

For example, consider the groups `ℤ₆ = ⟨{0,1,2,3,4,5}, + mod 6, 0⟩` and `ℤ₃ = ⟨{0,1,2}, + mod 3, 0⟩`, and the function `f` defined as follows:

``````f(0) = 0

f(1) = 1

f(2) = 2

f(3) = 0

f(4) = 1

f(5) = 2``````

This function `f` is a (homo)morphism between our two groups. It’s not an isomorphism because we’ve collapsed some distinct elements of the first group into single elements of the second group. Of course, the fact that this function `f` is not an isomorphism between the groups is compatible with there being some other function which is. However, as a matter of fact no isomorphism exists in this case and these two groups are merely homomorphic.

A (homo)morphism gives us a way of retaining some structure from the original algebra, but perhaps disregarding other parts of its structure.

## Endomorphisms and Automorphisms

Sometimes (homo)morphisms are functions from one algebra onto that very same algebra. This doesn’t necessarily mean they are bijections. If the universe of the source algebra is infinite, it can be mapped onto itself while at the same time collapsing several elements from the source into a single element in the target. Here’s an example of this; it’s reminiscent of the homomorphism from `ℤ₆` to `ℤ₃` described above.

Consider all the rational numbers `0 ≤ q < 1`. Let that be the universe of a group. The operation on our group is addition mod `1`. That is, `½ ★ ¾ = ¼`, and so on. Now we are going to describe a (homo)morphism from the group onto itself. It maps every element of our group to twice its value — except we wrap around when we get values `≥ 1`. So, for example, `¼` gets mapped to `½`, but so too does `¾`. Given how dense our group’s universe was to start with, every value in the “target” will get at least one (and indeed, will get exactly two) values from the “source” mapped onto it. The group we end with is the very same group we started with: the rationals from `0` up to (but not including) `1`, with the operation of addition mod `1`. So this is a (homo)morphism from a group onto itself, where the translation is onto but not injective.

(Homo)morphisms from an algebra onto itself, whether bijections or not, are called endomorphisms. I don’t expect you to remember their name.

When we have a endomorphism that is bijective — that is, an iso-morphism from an algebra onto that very same algebra — this is called an automorphism.

Every algebra has a “trivial” automorphism, which is just the identity function on its elements. In some cases, there are also other more interesting automorphisms from the algebra onto itself. These are easier to illustrate than endomorphisms which aren’t isomorphisms. For example, consider the isomorphism that maps `ℤ₄` onto itself, where:

``````f(0) = 0

f(1) = 3

f(2) = 2

f(3) = 1``````
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "http://www.jimpryor.net/teaching/courses/logic/notes/morphisms.html", "fetch_time": 1716980710000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2024-22/segments/1715971059239.72/warc/CC-MAIN-20240529103929-20240529133929-00877.warc.gz", "warc_record_offset": 33275283, "warc_record_length": 4378, "token_count": 1747, "char_count": 6359, "score": 3.84375, "int_score": 4, "crawl": "CC-MAIN-2024-22", "snapshot_type": "latest", "language": "en", "language_score": 0.9206199645996094, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00040-of-00064.parquet"}