maths.free › Abstract Algebra › Lattices and Boolean Algebras › Lattices

Lattices

We begin the study of lattices and Boolean algebras by generalizing the idea of inequality. Recall that a relation on a set X is a subset of X \times X.

Partially Ordered Sets

We begin the study of lattices and Boolean algebras by generalizing the idea of inequality. Recall that a relation on a set \(X\) is a subset of \(X \times X\). A relation \(P\) on \(X\) is called a partial order of \(X\) if it satisfies the following axioms.

  1. The relation is reflexive: \((a, a) \in P\) for all \(a \in X\).

  2. The relation is antisymmetric: if \((a,b) \in P\) and \((b,a) \in P\), then \(a = b\).

  3. The relation is transitive: if \((a, b) \in P\) and \((b, c) \in P\), then \((a, c) \in P\).

We will usually write \(a \preceq b\) to mean \((a, b) \in P\) unless some symbol is naturally associated with a particular partial order, such as \(a \leq b\) with integers \(a\) and \(b\), or \(A \subset B\) with sets \(A\) and \(B\). A set \(X\) together with a partial order \(\preceq\) is called a partially ordered set, or poset. \(a \preceq b\) \(a\) is less than \(b\)

Example

The set of integers (or rationals or reals) is a poset where \(a \leq b\) has the usual meaning for two integers \(a\) and \(b\) in \({\mathbb Z}\).

Example

Let \(X\) be any set. We will define the power set of \(X\) to be the set of all subsets of \(X\). We denote the power set of \(X\) by \({\mathcal P}(X)\). For example, let \(X = \{ a, b, c \}\). Then \({\mathcal P}(X)\) is the set of all subsets of the set \(\{ a, b, c \}\): \[\begin{aligned}& \emptyset & & \{ a \} & & \{ b \} & & \{ c \} & \\ & \{ a, b \} & & \{ a, c\} & &\{ b, c\} & & \{ a, b, c \}. &\end{aligned}\] On any power set of a set \(X\), set inclusion, \(\subset\), is a partial order. We can represent the order on \(\{ a, b, c \}\) schematically by a diagram such as the one in .

Example

Let \(G\) be a group. The set of subgroups of \(G\) is a poset, where the partial order is set inclusion.

Example

There can be more than one partial order on a particular set. We can form a partial order on \({\mathbb N}\) by \(a \preceq b\) if \(a \mid b\). The relation is certainly reflexive since \(a \mid a\) for all \(a \in {\mathbb N}\). If \(m \mid n\) and \(n \mid m\), then \(m = n\); hence, the relation is also antisymmetric. The relation is transitive, because if \(m \mid n\) and \(n \mid p\), then \(m \mid p\).

Condensed: the full section is in Judson, Abstract Algebra: Theory and Applications.

Jetzt du Kein Rechner löst diese Frage, aber ihre Teile sind berechenbar. Probieren Sie unten eine aus oder geben Sie Ihre eigene ein.

Behalten Sie Ihre eigenen Lösungswege

Ein kostenloses Konto fügt Notizen zu jeder Lektion, eine Aufzeichnung von dem, was Sie beendet haben, Ihre gelösten Probleme an einem Ort, und ein Tutor können Sie über diese Seite fragen. Die Mathematik selbst ist offen für alle, angemeldet oder nicht.

Registrieren Anmelden

Hier verwendete Symbole

Tippen Sie auf jedes Symbol für die vollständige Definition, ein Bild und was jeder Buchstabe darin bedeutet.

Fragen, die die Leute stellen

What is a group, in plain words?

A set with one operation that is associative, has an identity, and lets every element be undone. Symmetries of any object form a group. That is where the idea came from.

What is the difference between a ring and a field?

A ring has addition and multiplication that behave like the integers (you cannot always divide); a field is a ring where every non-zero element has a reciprocal, like the rationals or the reals.

Teile dieser Seite sind adaptiert aus Judson, Abstract Algebra: Theory and Applications (GFDL 1.3). Hier gekürzt und neu erklärt; Fehler gehen auf uns.

Mehr in Abstract Algebra

GroupsSubgroups, cosets and Lagrange's theoremCyclic groups and permutation groupsHomomorphisms, normal subgroups and quotient groupsRings and fieldsGalois theory: why the quintic has no formula