Riemann Manifold

Types: A smooth manifold M

Functions: gp ∶ Tp M 2 → R
Relations:
Properties: gp is the inner product on the tangent space of a point p
gp (X, Y ) = gp (Y, X)
gp (aX + Y, Z) = agp (X, Z) + gp (Y, Z)
M ’s metric
tensor is now
positive definate

Any point on M Forest

Pseudo Riemann Manifold Types: An undirected graph G = (V, E)
has a positive def-
Types: A smooth manifold M Functions:
inite metric tensor
Functions: gp ∶ Tp M 2 → R Relations:
Relations: Properties: G’s connected component are trees, but G need not be connected
every point
Properties: gp is the inner product on the tangent space of a point p
on M has a
Smooth Manifold gp (X, Y ) = 0 ∀Y Ô⇒ X = 0
non degenerate
Types: A manifold M metric tensor
Functions:
Relations: A collec-
Properties: Derivatives of arbitrary orders exist tion of trees

Line Graph
Types: An undirected graph L(G) = (V ∗ , E ∗ ), with underlying undirected graph G = (V, E) Bipartite Graph
M is infintiely Functions: f ∶E →V∗ Types: A k-partite graph G = (V, E)
Edges represent Tree
differentiable Relations: ∼∗ = {{x, y} ∈ E ∗ }∣ Functions:
vertces (and Types: A undirectd graph G = (V, E)
Properties: f maps edges in G to vertexes in L(G) visa versa) of Relations:
Functions:
An unordered pair of vertices {vi∗ , vj∗ } ∈ E ∗ iff their corresponding edges in G share an endpoint another graph, G Properties: Special case of k-partite graph for k = 2
Relations:
Manifold V1 , V2 are disjoint sets partition G’s vertices
Properties: There are no cycles in G
Types: A topological space, M All ei ∈ E can be written as {vi , vj } for some vi ∈ V1 and vj inV2
G is connected
Functions: G has no odd cycles
Compact Manifold M is compact Relations: G is 2-colorable
??
Types: A manifold M as a space Properties: ∀p ∈ M, ∃u ∈ U(p) ∶ u ≅ Rn
A special vertex
Functions: Manifolds are not inherently metric or inner product spaces
is called the root
Relations: each point locally
Properties: X = ⋃x∈C x, then for F ⊆ C, F finite, X = ⋃x∈F x ’looks like’ G can be prti-
euclidean space tioned into
Rooted Tree G is acyclic Hypercube Graph exactly 2 sets
Types: A tree G and connected Types: A regular, bipartite graph Qn = (X, E)
Functions: Functions:
Relations: Relations:
Properties: One vertex is designated as the root Properties: Qn has 2n vertices and 2n−1 n edges

K-partite Graph
The children Types: A graph G = (V, E)
Euclidean Space of each node G is directed Functions:
Types: A banach and hilbert space Rn are ordered
Undirected graph Relations:
Functions: H is the graph
Types: A graph G = (V, E) Properties: V1 , V2 , ..., Vn are disjoint sets that partition G’s vertices
Relations: of an n dimen-
√ √
Functions: All ei ∈ E can be written as {vi , vj } where vi ∈ Vi , vj ∈ Vj and i ≠ j
Properties: A norm is√defined as ∥x∥ = ⟨x, x⟩ = ∑ni=1 (xi )2 Ordered Tree Arboresence and Antiarboresence G is directed sional cube G is k-colorable
Relations:
d(x, y) = ∑ni=1 (xi − yi )2 Types: A directed graph G = (V, E) Types: A rooted polytree, G = (V, E)
Functions: Functions: Properties: ∼ is irreflexive and symmetric
Relations: Relations:
Endow with an Endow with Properties: The children of nodes in G are ordered Properties: Every node has a directed path away from or toward the root
inner product a norm
Regular Graph
Types: A graph G = (V, E)
Functions:
There is a directed Relations:
path between Properties: All v ∈ V are connected to the same number of edges
any vertex V can be di- Multigraph
and the roote Hyper Graph vided into k Types: A tuple G = (V, E)
Types: A tuple H = (V, E) pairs in E re- independant sets Functions:
Functions: main unordered All vertexes have Relations:
Relations: the same number More than 1 Properties: E is a multiset
Hilbert Space Properties: E = {ei ∣i ∈ Ie , ei ⊆ V } of neighbors
Banach Space Polytree edge can exist More than one edge may connect the same two vertices
Types: An inner product space H Ie is an index set for edges in H
Types: A vector space V Types: A directed graph G = (V, E) between the
Functions: same two nodes
Functions: Functions:
Relations: √
Relations: Relations:
Properties: A norm may be defined as ∥x∥ = ⟨x, x⟩
Properties: for any Cauchy Sequence {xn }, limx→∞ ∥xn − x∥ = 0 Properties: G’s underlying undirected graph is a tree
for any Cauchy Squence {xn }, limx→∞ ∥xn − x∥ = 0 G is acyclic
and connected Chordal Graph
Types: A perfectly orderable graph G = (V, E)
Archimedian Local Field Nonarchimedian Local Field Functions:
elements in E may
V is complete V is complete Types: A local field K Types: A local field K Relations:
be any subset of V
as a space as a space Functions: Functions: Properties: All induced cycles are of order 3
Relations: Relations: G has a perfect elimination order
The manifold
Properties: The sequence ∣n∣n≥1 is unbounded Properties: The sequence ∣n∣n≥1 is bounded Any cycke of 4 or
additionally has Simple Graph Perfect Graph
more has a chord
group structure Simple Directed Graph Types: A tuple G = (V, E) Types: A graph G = (X, E) Perfectly Orderable Graphs
Inner Product Space Chromatic number
Normed Vector Space Types: A graph G = (V, E) Functions: Functions: ω ∶ G ↦ n Types: A perfect graph G = (V, E)
Types: A vector space V and field of scalars F of every induced
Types: A metric and topological vector space V Functions: pairs in E Relations: ∼= {{x, y} ∈ V × V ∣ x, y are ajecent vertices in G} χ∶G↦n Functions:
Functions: ⟨⋅, ⋅⟩ ∶ V 2 → F subgraph is G has a relation, <
Functions: ∥ ∥ ∶ V → R Absolute Relations:
= {(x, y) ∈ V × V ∣(x, y) ∈ E} are ordered Properties: V is the set of vertices in G Relations: Relations: <= {(x, y) ∈ V × V ∣ x < y}
Relations: Absolute Value is a the size of the
Relations: Value is not a Properties:
is irreflexive E is made of two element subsets of V Properties: ω(G) is the the size of the largest clique in G Properties: < is a total order
bounded function endowed with largest clique
Properties: ⟨x, y⟩ = ⟨y, x⟩ bounded function Graph Algebra ∀u, v ∈ V, u
v ⇏ v
u ∼ is the adjacency relation χ(X) is the the chromatic number of G For any chordless path abcd ∈ G and a < b, then d ≮ c edges represent
Properties: ∥x∥ > 0 for x ≠ 0 and ∥x∥ = 0 iff x = 0 a function to
⟨x, x⟩ ≥ 0 Types: A directed graph D = (V, E) ∼ is irreflexive and symmetric ω(G) = χ(G) comparable Comparability Graph
∥αx∥ = ∣α∣∥x∥ multiply vertices, ⋅
⟨x, x⟩ = 0 iff x = 0 Functions: ⋅ ∶ V 2 → V ⋃ {0} elements in a poset Types: A perfect graph C = (S, ⊥)
∥x + y∥ ≤ ∥x∥ + ∥y∥
⟨ax, y⟩ = a⟨x, y⟩ Relations: There exists a Functions:
∥ ∥ induces a metric on V ∶ d(x, y) = ∥x − y∥
⟨x + y, z⟩ = ⟨x, z⟩ + ⟨y, z⟩ ⎧
⎪x x, y ∈ V, (x, y) ∈ E path between Relations: ⊥= {(x, y) ∈ S ∣ x < y}
Local Field ⎪
Properties: x ⋅ y ∶ ⎨ any two veritces Properties: S is the set of vertices
Types: A topological Field K ⎪
⎪0 x, y ∈ V ⋃ {0}, (x, y) ∉ E
Functions: ∣ ∣ ∶ K → R≥0
⎩ on the graph S is a poset under <
0∉V ordered pairs ⊥ is the edge relation
Complete Metric Space Relations:
Topological Vector Space in E the struc- (x, y), (y, z) ∈ E Ô⇒ (x, z) ∈ E
Types: A metric space M Properties: ∀u, v ∈ K, ∃U, V ∈ τ ∶ u ∈ U, v ∈ V, U ∩ V = ∅
Equipped with ture of a group
Functions: Types: A vector space V over a topological field K if C ⊆ τ satisfies X = ⋃x∈C x, then there exists F ⊆ C, F finite X = ⋃x∈F x
equipped with a function ⟨ , ⟩ Connected Graph
Relations: Functions: + ∶ V 2 → V
a function ∥ ∥ Types: A graph G = (V, E)
Properties: ∀F ∀U ∶ ∃A ∈ F ∶ A × A ⊆ U, F converges k×V →V
d(x, y) = ∥x − y∥ Cayley Graph Functions:
+ ∶V →V
−−1
Types: A directed graph Γ = Γ(G, S), S a generating set for group G Relations:
Relations: Each vertex has
Functions: f ∶ G → V (G) Properties: There exists a path between any two v ∈ V in the graph
Properties: k × V represents scalar multiplication by elements in a field K K is a field of Each edge has a unique label
g ∶ S → CS
+ and scalar multiplication are continuous
+, −−1 scalars for V a unique label
Has an absolute Relations: E(Γ) = {(g, gs) ∈ G × G ∣ ∀g ∈ G, ∀s ∈ S}
value function Properties: f assigns each g ∈ G to a vertex in Γ
g assigns each s ∈ S to a unique color
M is complete as a add a mean- Topological Field The identity element generally is ignored, so the graph does not contain loops Vertex Labeled Graph Strict Totally Ordered Set
topological space ingful origin Types: A field K with topology τ Types: A graph G = (V, E) Types: A poset P
Functions: ⋅ ∶ K 2 → K ∶ (x, y) ↦ x ⋅ y Functions: f ∶ V → L Functions:
+ ∶ K 2 → K ∶ (x, y) ↦ x + y Edge Labeled Graph
Types: A graph G = (V, E) and set L Relations: Relations: <= {(x, y) ∈ P × P ∣ x < y}
+ ∶K →R
−−1 Properties: f maps vertexes to a set of labels L Properties: < is irreflexive, transitive, asymmetric and trichotomous
Metric Space Functions: f ∶ E → L
Affine Space × ∶ K/{0} → K/{0}
−−1
Types: A topological space M Ð
→ Relations: Relations:
Functions: d ∶ M 2 → R Types: A set A and vector space A Properties: f maps edges to a set of labels L
Ð
→ + , −⋅
Properties: +, ⋅, −−1 −1
are continuous mappings Finite Countable Set
Relations: Functions: A × A → A ∶ (a, v) ↦ a + v all elements in P
Types: A set S ≤ becomes
Properties: d(x, y) ≥ 0 Relations: are comparable
Ð
→ Functions: irreflexive
d(x, y) = 0 ⇔ x = y Properties: A ’s additive group acts freely and transitively on A
d(x, y) = d(y, x) Ð→ ⋅ has inverses Relations:
∀v, w ∈ A , ∀a ∈ A, (a + w) + u = a + (w + u) S is in bijec- Uncountable Set
d(x, z) ≤ d(x, y) + d(y, z) in the set Properties: ∣S∣ < ℵ0
Ð
→ tion with a Types: A set S edge labels are
∀a, b ∈ A, ∃v ∈ R ∶ b = a + v
Ð→ subset of the Functions: comparable
∀a ∈ A, A → A ∶ v ↦ a + v is bijective natural numbers Relations:
Properties: ∣S∣ > ℵ0
Strict Poset Totally Ordered Set
Closed sets are Types: A poset P Types: A poset P
those who are the Countable Set Weighted Graph Functions: Functions:
common zeros of Topological Ring Types: A set S Types: An edge labeled graph G = (V, E) and labels L Relations: <= {(x, y) ∈ P 2 ∣ x < y} Relations:
There is no in-
a subset of the Types: A ring R with topology τ Functions: Functions: Properties: < is irreflexive, transitive, and asymmetric Properties: All elements are comparable under ≤
jection from S
indeterminants Functions: ⋅ ∶ R2 → R ∶ (x, y) ↦ x ⋅ y Relations: Relations:
into the nat-
in a polynomial + ∶ R2 → R ∶ (x, y) ↦ x + y Properties: ∣S∣ ≤ ℵ0 Properties: L is an ordered set
Closeness relation ural numbers
ring over the same
Φ is replaced by + ∶R→R
−−1
Complete Uniform Space underlying field Relations:
distance fucntion d
Types: A uniform Space U Properties: ⋅ distributes over +
Infinite Countable Set S is in bijec- all elements in P
Functions: + are continuous mappings
+, ⋅, −−1 ≤ is now irreflexive
Relations: Types: A set S tion with the are comparable
Properties: ∀F ∀U ∶ ∃A ∈ F ∶ A × A ⊆ U, F converges Functions: natural numbers
Relations:
Graded Poset
Properties: ∣S∣ = ℵ0 Partially Ordered Space
Types: A poset P
bijection into N S has an injec- Types: A poset X endowed with topology τ
U is complete as a Functions: ρ ∶ P → N
tion into the Functions:
topological space Relations: ⋖= {(x, y) ∈ P ∣ ∄z ∶ x < z < y
natural numbers Relations: ≤= {(x, y) ∈ X × X∣x ≤ y}
Uniform Space add a new opera- Properties: x < y Ô⇒ ρ(x) < ρ(y)
Properties: ∀x, y ∈ X, x ≰ y ∶ ∃U, V ⊂ τ, x ∈ U, y ∈ V ∶ u ≰ v, ∀u ∈ U, ∀v ∈ V
Topological Space tion + so (G, +) x ⋖ y Ô⇒ ρ(y) = ρ(x) + 1
Types: A topological space U and entourages Φ
Functions: Types: A set X and τ ⊆ ℘(X) is a group and
Relations: U = {(x, y)∣x ≈u y} Functions: (G, ⋅) is a moniod P endowed
Relations in Φ Lie Group P has a rank
Properties: Φ is a nonempty collection of relations on S Relations: with a topology
define closeness Types: A topological group G function, ρ(x)
U ∈ Φ and U ⊆ V ⊆ X × X Ô⇒ V ∈ Φ Properties: X, ∅ ∈ τ that respects ≤
∀U ∈ Φ, ∃V ∈ Φ, ∀x, y, z ∶ V ○ V ⊆ Φ ∶ x ≈V y, y ≈V z Ô⇒ x ≈U z xi ∈ τ Ô⇒ ⋂i∈I xi ∈ τ for finite I X has a group Functions:
∀U ∈ Φ, ∃V ∈ Φ, ∀x, y ∶ V ○ V ⊆ Φ ∶ y ≈V x Ô⇒ x ≈U y xi ∈ τ Ô⇒ ⋃j∈J xj ∈ τ structure with con- Topological Group ⋅, −−1 are smooth Relations:
maps, the under- Preordered Set Partially Ordered Set
U, V ∈ Φ Ô⇒ U ∩ V ∈ Φ tinuous functions Types: A group G with topology τ Properties: ∀p ∈ G, ∃Up ≅ Br (p), for some r > 0 Set Locally Finite Poset
lying topology is a Types: A set P Types: A set P
Functions: ⋅ ∶ G2 → G −−1 and × are smooth maps Types: a collection of objects any subset of Types: A poset P
smooth manifold equipped with Functions: Functions:
−−1 ∶ G → G Functions: ⊂, ∩, ∪, ∖, ×, ℘, ∣ ∣ ≤ is antisymmetric P has finitely Functions:
a preorder, ≤ Relations: ≤= {(x, y) ∈ P × P ∣x ≤ y} Relations: ≤= {(x, y) ∈ P × P ∣x ≤ y}
1∈G Relations: ∈ many elements Relations:
Properties: All elements need not be comparable under ≤ Properties: All elements need not be comparable under ≤
Relations: Properties: Properties: ∀x, y ∈ P, x ≤ y ∶ [x, y] has finitely many elements
≤ transitive and reflexive ≤ transitive, reflexive and antisymmteric
Properties: ⋅, −−1 are continuous mappings P has group
structure that
respects ≤
each element
is the greatest
lower bound of
S is equipped members of S are Partially Ordered group the compact
Neighborhoods of
with a relation → sets but S is not Types: A poset and group G elements below it
points must satisfy
stronger properties Functions: + ∶ G2 → G
+ ∶G→G
−−1
0∈G
Relations: ≤= {(x, y) ∈ G × G ∣ 0 ≤ −x + y} any two ele-
Convergent Space Properties: ≤ respects + ments have an
Proper Class upper bound
Types: A set S and filters on S, F Cardinal Algebraic Poset
Types: a collection, C of sets The set of ordinals
Functions: Types: Ordinals κ Types: A poset P
Functions: ϕ(x) that cannot be put
Relations: → Functions: Upward (Downward) Linked Set Functions:
Relations: in bijection with
Properties: ∀F ∈ F, x ∈ S, F → x ⇔ F convergences to X Relations: Types: A subset S of poset P Relations:
Properties: ϕ(x) is a membership function any lesser ordinal
→ is centered, isotone, and directed Properties: The cardinality κ is the least ordinal, α, s.t. there is a bijection between S and α Functions: Properties: each element is the least upper bound of the compact elements below it
C is not a set
N (x) = ⋂{F ∈ F∣F → x} Relations:
Properties: ∀x, y ∈ S ∶ ∃z ∈ P s.t. x ≤ (≥)z and y ≤ (≥)z

Each element any two elements

is either the set of P have an
Magma of the elements upper bound
Types: A set M before it or 0
Functions: ⋅ ∶ M2 → M
Relations: M is cancellitive
⋅ is associative Upwards (Downwards) Centered Set
Properties: ∀u, v ∈ M ∶ u ⋅ v ∈ M Ordinal Types: A linked subset S of poset P
Types: A collection of sets, Xi Functions:
Quotient Ring Functions: ×, +, X n , S(n)
Types: A ring Q Relations:
Quasigroup Relations: > Properties: ∀Z ⊆ P, Z has an upper (lower) bound ∈ P
Functions: Semigroup Types: A magma Q Properties: Xk = {0, 1, 2, ...Xk−1 }
Relations: ∼= {(x, y} ∈ R × R ∣ x − y ∈ I} ⋅, −−1 are contin- Types: A magma S of elements Functions: Ó∶ Q2 → Q > is trichotomous, transitive, and wellfounded
Prime Ideal
Properties: Q is constructed by dividing R with one of its ideals uous mappings Functions: Ò∶ Q2 → Q
Types: A subgroup of elements I
Functions: Relations: 1R , 1L ∈ Q any subset
S is endowed with
Relations: Semiring Properties: ⋅ is associative Relations: of P has an
a new operation,
Properties: ab ∈ I Ô⇒ a ∈ I or b ∈ I Properties: Q is a cancellative magma upper bound
Types: A set R + such that ⋅
Functions: ⋅ ∶ R2 → R distributes over +
+R2 → R Q has an iden-
Q has an iden-
0∈R tity element, 1
A ring formed If the product of tity element, 1 Upward (Downward) Directed Set
Relations:
by the quotient two elements is Types: A preset P
Properties: + is a commutative monoid
of a ring and in I, then one of Monoid Loop Functions:
Maximal ideal ⋅ is a monoid and distributes over +
one of its ideals those
+, −−1elements
+ , ⋅ are Types: A semigroup S Types: A quasigroup Q Relations:
Types: A subgroup of elements, I must be in I
continuous Principal ideal Properties: ≤ is a preorder
Functions: 1∈S Functions: 1∈Q
Functions: Types: A subgroup of elements, I ∀x, y ∈ P ∶ ∃z s.t. x ≤ (≥)z and y ≤ (≥)z
Relations: Relations:
Relations: Functions: P Group Properties: 1 is the identity for ⋅ Properties: 1 is the identity for ⋅
Properties: I ⊆ J Ô⇒ I = J or J = R Relations: Types: A group G 1⋅ u=u⋅1=u 1⋅x=x⋅1=x
Properties: I is generated by a single element Functions:
Relations:
I is not the proper
Properties: ∀g ∈ G ∶ ∣g∣ = pn , p prime, n ∈ N
subset of any
other ideals of R
I is generated from
a single element Torsion Free Group
Ideal any pair of any pair of
all elements Types: A group G
Types: A subgroup of a ring, I elements have a elements have
in S have an ⋅ is associative Functions:
Functions: unique greatest a unique least
inverse in S Relations:
Relations: lower bound upper bound
I is a right and left Properties: ∄g ∈ G, g ≠ 1 ∶ g n = 1, n ∈ N Free Abelian Group
Left (right) Ideal idea of the same Properties: The left and right ideals generated by a subgroup are equal all elements Types: A group F
Types: A subgroup of a ring, I underlying subset ∀x ∈ I, ∀r ∈ R ∶ rx ∈ I have order pn Functions:
Functions:
Relations:
Relations: add commuta-
there are no Properties: F is generated by a set S
Properties: ∀x ∈ I, ∀r ∈ R ∶ rx (xr) ∈ I tivity relation
elements in G The only relation on F is commutativity
Sigma Algebra of finite order
Types: A subset Σ, of ℘(X), X a set Free Group
A subset of the Functions: ∩, ∪, ∖ Topological group Group Types: A group F ?? ??
ring closed under Relations: Types:AbelianA Group
group G Types: A set G Functions: Types: A poset P Types: A poset P
left (right) ring Properties: X ∈ Σ Functions:
Types: A group G Functions: ⋅ ∶ G2 → G There are no fur- Relations: Functions: Functions:
multiplication ∩, ∪ closed under countable operations Relations:
Functions: −−1 ∶ G → G
⋅ is commutative ther relations on G Properties: F is generated by a set S Relations: ≤= {(x, y) ∈ P × P ∣ x ≤ y} Relations: ≤= {(x, y) ∈ P × P ∣ x ≤ y}
(R, +) be- Properties: −−1 and × are continuous maps
Relations: 1∈G
A subset of the There are no relations on FS (beyond group axioms) Properties: ∀x, y ∈ S, ∃c ∶ c ≤ x, c ≤ y Properties: ∀x, y ∈ P, ∃c ∶ x ≤ c, y ≤ c
ring closed under comes a group Properties: ⋅ is commutative Relations: c is the unique greatest lower bound c is the unique least upper bound
ring multiplication A ring under Properties: ⋅ is associative
symmetric 1 is the identity for ⋅ Meet Semilattice: Algebraic Edition Join Semilattice: Algebraic Edition
difference as + and −−1 is the inverse map for ⋅ G has a fi- Types: A poset P Types: A poset P
+ , −⋅
+, ⋅, −−1 −1
set intersection as ⋅ nite number Functions: ∧ ∶ P 2 → P Functions: ∨ ∶ P 2 → P
are continu- of elements Relations: Relations:
Noncommutative Ring G has no nor-
ous mappings Properties: ∧ is associative, commutative, and idempotent Properties: ∨ is associative, commutative, and idempotent
Types: A ring R mal subgroups
Functions:
Relations:
Properties: ⋅ need not be commutative
Boolean Ring any pair of
Artinian Ring Simple Group elements have
Types: A commutative ring R
Types: A ring R Commutative Ring Types: A group G a unique least
All elemets are Functions:
Functions: Types: A ring R Functions: G has a fi- Finite Group upper bound
idempotent with Relations:
Relations: Functions: Relations: nite number
respect to ⋅, + Properties: ∀x ∈ R ∶ x2 = x Types: A group G Permutation Group
Properties: For any I0 ⊇ I1 ⊇ ... ⊇ Ik there is some k ≥ 0 s.t. Ik = Ik+1 Relations: Properties: N ◁ G Ô⇒ N = {1} or G of generators Functions:
∀x ∈ R ∶ 2x = 0 Types: A group Pn
Properties: ⋅ is commutative Relations: Functions:
Properties: ∣G∣ = n, n ∈ N Relations:
Properties: Pn < Sn
⋅ need not be G is closed under Pn contains only
commutative multiplication by even permutations
Semimodule a ring of scalars A proper subset
Finitely Generated Group
Noetherian Ring Types: A set M Finitely Presented Group G is the group of the Finite
Types: A group G
Types: A ring R Functions: + ∶ M 2 → M Types: A finitely generated group G of all bijective Symmetric Group
Functions: G has fi-
Functions: R×M →M Functions: functions from Alternating Group
Relations: nite relators
Relations: Ideals in R satisfy Relations: Relations: the set to itself Types: A permutation group An
Properties: G is of the form ⟨S∣R⟩, S a generating set, R relators
Properties: For any I0 ⊆ I1 ⊆ ... ⊆ Ik there is some k ≥ 0 s.t. Ik = Ik+1 the descending Properties: + is associative and commutative Properties: ∣R∣ = n, n ∈ N Functions:
∣S∣ = n, n ∈ N Fintie Symmteric Group
chain condition (M, +) is an commutative monoid Relations:
Types: A finite group Sn
⋅ is additionally R × M is scalar multiplication by elements in a ring Properties: An = {σ∣σ ∈ Sn ∧ σ even }
Functions:
commutative Scalar multiplication is associative and distributes over addition
Relations:
Ideals in R satisfy Properties: Sn = {σ∣σ ∶ X → X is bijective }
the acending M is a
chain condition Ring abelian group No nontriv-
Types: A set R ial partitions
Functions: ⋅ ∶ R2 → R Artinian Module G has one are preserved
+ ∶ R2 → R Types: A module M generator
There are no −−1+ ∶R→R Functions: Primitive Group
zero divsors in R 0∈R Relations: Types: A permutation group G that acts on a set X
Relations: Properties: For any chain of submodules S0 ⊇ S1 ⊇ ... ⊇ Sk there is some k ≥ 0 s.t. Sk = Sk+1 Functions:
Domain Properties: (R, +) is an abelian group
Types: A ring R Relations:
⋅ is a monoid and distributes over + M satisfies
Functions: R is a ring of Properties: G preserves only trivial partitions
decending chain S is also a join S is also a meet
Relations: scalars for an
condition on Module semilattice semilattice
Properties: ∀a, b ∈ R, ab = 0 Ô⇒ a = 0 or b = 0 abelian group M
⋅ is commutative submodules Types: A set M Cyclic Group and obeys ab- and obeys ab- Semimodular Lattice
Functions: + ∶ M2 → M Types: A group G with element a Distributive Lattice sorption law sorption law
Modular Lattice Types: A lattice L
Noetherian Module + ∶M →M
−−1 Cyclically Ordered Group Functions: G has a chain of Polycyclic Group Types: A modular lattice L L has a re-
M satisfies L’s functions Types: A semimodular lattice L Functions:
Types: A module M R×M →R Types: A group C Add a rela- Relations: cyclic subgroup Types: A group P with subgroups Hi Functions: stricted asso-
accending chain distribute over Functions: Relations: ⋖= {(x, y) ∈ P ∣ ∄z s.t. x < z < y}
Functions: Relations: Functions: tion, [ , , ] Properties: G can be generated from a and a set of relations R whose quotients Functions: Relations: ciative property
condition on each other Relations: Properties: a ∧ b ⋖ a Ô⇒ b ⋖ a ∨ b
Relations: Properties: + is associative and commutative Relations: [ , , ] = {(a, b, c) ∈ C × C × C∣[a, b, c]} G is necessarily commutative are also cyclic Relations: Properties: x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)
submodules Properties: a ≤ c Ô⇒ a ∨ (b ∧ c) = (a ∨ b) ∧ c
Properties: For any chain of submodules S0 ⊆ S1 ⊆ ... ⊆ Sk there is some k ≥ 0 s.t. Sk = Sk+1 (M, +) is an abelian group Properties: [a, b, c] is cyclic, asymmetric, Properties: P is necessarily finitely presented x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z)
R × M is scalar multiplication by elements in a ring L is addition-
Integral Domain All submodules of M are finitely generated transitive and total All finitely gen- {Hi }i∈{1,2,..,n−1} ∶ Hi /Hi+1 is cyclic
Scalar multiplication is associative and distributes over addition G is a subgroup in ally algebraic
Types: A domain R erated subgroups another group V and atomic
Functions: of G are cyclic
Relations:
Add a functon, Ð→ Geometric Lattice
Properties: ⋅ is additionally commutative M ’s ring is differ- n≤2
Types: A semimodular, algebraic, atmoic lattice L
ential operators Heyting Algebra Functions:
Types: A distributive lattice H Relations:
Virtually Cyclic Group Functions: Ð→∶ H 2 → H Properties: L is finite
Locally Cyclic Group Metacyclic Group Relations:
Types: A group V with subgroup H
Types: A group L Ring addition is Types: A group G Properties: (c ∧ a) ≤ b ⇔ c ≤ (a Ð→ b)
All elements Functions:
Functions: the symmetric Functions: Monoid (H, ⋅, 1) has operation ⋅ = ∧
can be factored Relations: If a covers the
Relations: difference and Relations:
into the product Properties: ∃H ≤ V ∶ H is cyclic greatest lower L is additionally
Properties: ∀H ≤ L, if H is finitely generated, it is cyclic ring multiplica- Properties: n ≤ 2
of a unit and M has no ∣V ∶ H∣ = n, n ∈ N bound of a and algebraic and
zero divisors M is generated tion is greatest
prime elements b, then b is Atomic Lattice semimodular
D Module from a finite set lower bound a⋅b = a∧b
covered by the Types: A lattice L
Types: A module M [X]
greatest lower Functions:
Functions: ∂Ri ∶ M → M
bound of a and b Relations: ⋖= {(x, y) ∈ P ∣ ∄z ∶ x < z < y}
Relations: Finitely Generated Module L is additionally
Properties: ∀b ∈ L ∶ 0 ∧ b = 0
Properties: X = {x1 , x2 , ..., xn } where xi is an indeterminant Types: A module M H’s underlying semimodular
∃ai ∈ L ∶ 0 ⋖ ai
∂Ri is in the ring of scalar multiplication Functions: lattice is complete and atomic
∀b ≠ ai , ∃ai ∶ 0 < ai < b
∂Ri satisfies the Leibniz product rule Relations: M ’s generating Simple Module {ai }i∈I is the set of atoms in L
Properties: M has a finite number of generators set is one element Residuated Lattice
Unique Factorization Domain Types: A module M
Functions: Types: A lattice L
Types: An integral domain R Torsion Free Module Cyclic Module Complete Heyting Algebra
M has no proper Relations: Functions: ⋅ ∶ L2 → L
Functions: Types: A module M Types: A finitely generated module M submodules Types: A heyting algebra H
Properties: The only submodules of M are 0 and M 1∈L L only must satisfy
Relations: Functions: Functions: Functions:
Relations: the Modular law
Properties: All ideals are finitely generated Relations: Relations: Relations:
Properties: (L, ⋅, 1) is a monoid in the special
All irreducible elements are prime Properties: ∄m ∈ M, r, m ≠ 0 ∶ r ⋅ m = 0 Properties: M is generated from a single element Properties: H is complete as a lattice
(L, ≤) is a lattice case b = a⊥
∀x ∈ R, x ≠ 0, x = up1 p2 ...pn for u unit, pi prime All non zero ele-
∀z ∶ ∀x, there exists a greatest y and ∀y, there exists a greatest x s.t. x ⋅ y ≤ z Algebraic Lattice
ments are either
atoms or compa- Types: A continuous lattice A
rable to atoms Functions:
Relations:
Properties: Each element is the least of compact elements below it: those x who satisfy x ≪ a
All ideals are
principal
Lattice (order theory)
Types: A set L
L has an element Functions: each are the great-
Ð→= ¬x ∨ y
1 and a function ⋅ Relations: ≤= {(x, y) ∈ L × ∣ x ≤ y} est lower bound
Principal Ideal Domain such that (L, ⋅, 1) Properties: ∀x, y ∈ L, ∃c, d ∶ c is the greatest lower bound and d is the least upper bound of the compact
Types: A unique factorization domain R is a monoid elements below it
Functions:
Relations:
Properties: All ideals are principal
Any two elements have a greatet common divisor Relational Algebra
M has no re- Types: A commutative algebra R Complete Lattice
lators beyind Functions: ∨ ∶ R2 → R Types: A lattice L
module axioms ∧ ∶ R2 → R Functions:
−∶R→R Relations:
Relations: Properties: ∀A ⊆ L, A has a greatest lower bound and least upper bound
Properties: Lattice (Algebra)
R can be en- Types: A set L
dowed with a eu- Functions: ∨ ∶ L2 → L
clidean algorithm Orthomodular Lattice ∧ ∶ L2 → L
Types: A lattice L Relations:
a is the least upper
Lie Algebra Functions: Properties: (L, ∨), (L, ∧) are both semilattices connected by absorption laws
bound for the
Euclidean Domain :( Relations: ∀a, b ∈ L ∶ a ∨ (a ∧ b) = a, a ∧ (a ∨ b) = a
Types: A nonassociative Algebra g set of elements
Exponential Field
Types: A principal idea domain R Functions: [ ] ∶ g2 → g Properties: a ≤ b Ô⇒ b = a ∨ (b ∧ a⊥ ) way below a
Types: A field K
Functions: fi ∶ R ∖ {0} → R Relations:
Functions: Φ ∶ K+ → K×
Relations: Properties: ∀x, y ∈ g ∶ [x, y] = −[y, x]
Relations:
Properties: fi is the euclidean (gcf) algorithim ∀x, y, z ∈ g ∶ [x, [y, z]] + [y[z, x]] + [z, [x, y]] = 0 Polynomial Algebra
Properties: Φ is a homomorphism
R may have many fi or just one Differential Field ∀x, y, z ∈ g ∶ [ax + by, z] = a[x, z] + b[y, z] and [x, ay + bz] = a[x, y] + b[x, z] Types: A commutative Algebra A[X]
Free Module [x, x] = 0 Functions: 1 ∈ A[X]
Types: A polynomial field K every subset in Continuous Lattice
The euclidean Types: A projective module M Relations:
there exists a Functions: ∂i ∶ K → K L has a least Types: A complete lattice A
algorithm is one Functions: Properties: X = {x1 , x2 , ...xn } where xi is an indeterminate, n ≥ 1 Boolean Algebra L has a greatest
homomorphism Relations: upper bound Functions:
for all values Relations: Types: A complemented, distributive lattice and algebra B lower bound and
from the addivitive Properties: Finitely many ∂i exist over K All elements and a greatest Relations: ≪= {(x, y) ∈ L × L ∣ ∀D ⊆ L ∶ y ≤ sup D, ∃x ∈ L, ∃d ∈ D s.t. x ≤ d}
in the field Properties: M has no further relations beyond module axioms Functions: ¬ ∶ B → B least upper bound
to multiplica- K has finitely ∂i satisfies the Leibniz product rule have relative lower bound Properties: ∀x ∈ P, {a ∣ a ≪ x} is directed and has least upper bound x
M has a basis ⊕ ∶ B2 → B L satisfies a ∨ (a⊥ ∧
tive groups many dera- ∂i is a homomorphism of K + eqippued with A has an alphabet complements
Flexible Algebra Relations: c = c for a ≤ c
vations on it a function [ , ] of indeterminates
Types: A nonasscoative Algebra A Properties: ∀x ∈ B, x2 = x
Functions: ¬ is negation (complementation)
Relations: x ⊕ y = (x ∨ y) ∧ ¬(x ∧ y)
⊕ is algebra addition, ∧ is algebra multiplication L additionally
x(yx) = (xy)x Properties: ∀x, y ∈ A ∶ x(yx) = (xy)x satisfies (x ∧ y ′ )′ = Relatively Complemented Lattice
All elements y ∨ (x′ ∧ y ′ ) Types: A lattice L
are idempotent Functions:
Relations:
Field Power Associative Algebra Properties: ∀c∀d ≥ c, [c, d] ∶ ∀a ∈ [c, d], ∃b s.t.:
Types: A ring K Types: A nonassociative Algebra A Commutative Algebra a∨b=d
Orthocomplemented Lattice Bounded Lattice
Functions: + ∶ K2 → K Functions: Types: An algebra A a∧b=c
Indeterminates x(x(xx)) = Types: A lattice L Types: A lattice L
Characteristic Zero Field The multiplica- × ∶ K2 → K Relations: Functions: a and b are relative complements
in M are basis (xx)(xx) = Nonassocative Algebra Alternative Algebra Functions: ⊥∶ L → L Functions:
Types: A field K tive identity + ∶K →K
−−1 Properties: ∀x, y ∈ A ∶ x(x(xx)) = (xx)(xx) = (x(xx))x Relations:
vectors for V (x(xx))x Types: An algebra A Types: A nonassocative Algebra A Relations: Relations:
Functions: cannot be added × ∶ K/{0} → K/{0}
−−1 Properties: ⋅ is commutative
Functions: xx(y) = x(xy) Functions: Properties: ⊥ maps an element a to its complement Properties: ∀x ∈ L ∶
Relations: finitely many 0, 1 ∈ K A eqipped with
Relations: Relations: a ∨ a⊥ = 1 x∧1=x
Properties: ∄n ∈ N ∶ 1 + 1 + ... + 1 = 0 times tog et the Relations: finitely many
´¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¸¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¶ Properties: ⋅ is need not be associative Properties: ∀x, y ∈ A ∶ xx(y) = x(xy) a ∧ a⊥ = 0 x∨1=1
n additive identity Properties: +, × both associate and commute derivations L itself can act for each element
(a⊥ )⊥ = a x∨0=x
× distributes over + as the interval in L, there is a
a ≤ b Ô⇒ a⊥ ≥ b⊥ x∧0=0
0 is the identity for + and 1 is the identity for × K acts as scalars second element
equipped with a (K, +) and (K, ×) are groups Complements in L such that
over a free module
partial order, ≤ ⋅ is commutative Differential Algebra are unique glb and the lup
⋅ need not be Types: A commutative algebra A are the maxium
assocative Functions: ∂i ∶ A → A and minimum
Complemented Lattice
Ordered Field Relations: element of L
Types: A lattice L
Types: A characteristic zero field K Properties: There are finitely many ∂i over A Functions:
Functions: All ∂i satisfy the Leibniz product rule
(xy)(xx) = Relations:
Relations: ≤ ∂i is a homomorphism of A+
Vector Space (x(y(xx)) Properties: ∀a ∈ L, ∃b ∈ L ∶
Properties: ≤ respects + and ×
a∨b=1
K is necessarily infinite Types: A set V over a field K Jordan Algebra a∧b=0
The multiplica- Functions: + ∶ V 2 → V Types: A nonassociative algebra A
Extension such
tive identity + ∶V →V
−−1 Functions:
can be added that a polymonial K ×V →V
canbe decompased Relations:
finitely many 0∈V Properties: ∀x, y ∈ A ∶ (xy)(xx) = (x(y(xx))
times tog et the into liner factors Relations:
additive identity Properties: + is associative and commutative Zero Algebra
Characteristic Nonzero Field K × V is scalar multiplication by K Types: An algebra A
Types: A field K (V, +) is a group Algebra Over a Field Functions:
Functions: Types: A set of elements A, with underlying field K Relations:
Splitting Field
Relations: Functions: ⋅ ∶ A2 → A Properties: ∀u, v ∈ A, uv = 0
Types: A field K ′ , along with field K, polynomial ring K[X] the product of all
Properties: ∃n ∈ N ∶ 1 + 1 + ... + 1 = 0 + ∶ A2 → A A is inherently associative and commutative
´¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¸¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¶ Functions: elements in A is 0
n Relations: K ×A→A
Properties: K ′ is a algebraic extension of K Relations:
K ′ of some x ∈ K[X] is the smallest extension so that x can be decomposed into linear factors Properties: + is associative and commutative
⋅ is not assumed commutative or associative
equipped with a ⋅ distributes over + ⋅ is associative
A map from a
partial order, ≤ K × A represents scalar multiplication
g to a unital
(A, +, K) is a vector space
All polynomials assocative algebra
can be decompased ⋅ need not be
into linear factors commutative

??
Types: An associative algebra and locally finite poset, A
Finite Field Algebraically Closed Field
Noncommutative Algebra Associative Algebra Functions: δ∶A→A
Types: A characteristic nonzero field K Types: A field K and a polynomial ring K[X] A made up of
Types: An algebra A Types: An algebra A ∗ ∶ A2 → A
Functions: Functions: functions that
Functions: Functions: Relations:
Relations: Relations: assign subinte-
Relations: Relations: Properties: ∗ is algebra multiplication
Properties: K has a finite number of elements Properties: All polynomials x ∈ K[X] can be decomposed as the product of linear factors vals to scalars
Properties: ⋅ in A is need not be commutative Properties: ⋅ is associative Any a ∈ A behaves such that [b, c] ↦ a(b, c)
The order of some k ∈ K is pn for some p prime, n ∈ N Equivalently, there is no proper algebraic extension of K A has an alphabet The idenitity a(b, c) is taken from a commutative ring of scalars
Free Algebra of indeterminates for ⋅ is in A δ is the identity function
Types: A noncommutative algebra A[X]
Functions: 1 ∈ A[X] The symmetric
Relations: algebra is a free
Properties: X = {x1 , x2 , ..., xn }, xi is an indeterminate unital commu-
1 is the empty word tative algebra
Unital Algebra Members of A are
Types: An algebra A linear opertors
Functions: 1 ∈ A
T (V ) is the free Relations: Operator Algebra A equipped
algebra over a Properties: 1 is the identity for ⋅ Types: An associative Algebra A with a norm, ∥∥
vector space Functions: ○ ∶ A2 → A
⋅ is the ten- Relations:
sor product Properties: a ∈ A are continuous linear operators over a topological vector space
○ is operator composition (and algebra multiplication)
Tensor Algebra Banach Algebra
Types: A noncommutative Algebra T Types: An associative algebra A
Functions: ⊕ ∶ T 2 → T Functions: ∣∣ ∣∣ ∶ A → R
⊗ ∶ T2 → T Relations:
Relations: Properties: ∀x, y ∈ A ∶ ∣∣xy∣∣ ≤ ∣∣x∣∣ ∣∣y∣∣
Properties: T is defined over any vector space V A is also a Banach space
T k V = V ⊗1 V ⊗2 ... ⊗k V
T (V ) = C ⊕ V ⊕ (V ⊗ V ) ⊕ (V ⊗ V ⊗ V ) ⊕ ....
T k V ⊗ T l V = T k+l V
T (V ) is the most general algebra over V

⋀ is a quoient ⋀ is a quoient
algebra of T (V ) algebra of T (V )

⋁ is a quoient Exterior Algebra

Universal Enveloping Algebra
algebra of T (V ) Types: A nonassociative algebra ⋀(V ) of a vector space V
Types: A unital associative Algebra U(g) of a Lie Group g
Functions:
Functions:
Relations:
Relations:
Properties: I is the ideal generated from w ⊗ v + v ⊗ w, ∀w, v ∈ V
Properties: I is the ideal generated from x ⊗ y − y ⊗ x − [x, y]∀x, y ∈ T (g)
⋀(V ) = T (V )/I
U(g) = ⊗g)/I
Division by the anticommutator makes ⋁(V ) anticommutative

U(g)’s un-
derlying Lie
Algebra is abelian

Symmetric Algebra
Types: An associative, commutative algebra ⋁(V ) of a vector space V
Functions: 1 ∈ ⋁(V )
Relations:
Properties: I is the ideal generated from w ⊗ v − v ⊗ w, ∀w, v ∈ V
⋁(V ) = T (V )/I
Division by the commutator makes ⋁(V ) commutative
 2 ALGEBRA:COMMUTATIVE ALGEBRAS

Section 1
Algebra: Basic

Algebra Over a Field

Types: A set of elements A, with underlying field K
Functions: ⋅ ∶ A2 → A
+ ∶ A2 → A
K ×A→A
Relations:
Properties: + is associative and commutative
⋅ is not assumed commutative or associative
⋅ distributes over +
× by k ∈ K represents scalar multiplication
(A, +, K) is a vector space not assumed commutative or associative
⋅ distributes over +

Section 2
Algebra:Commutative Algebras

Commutative Algebra
Types: An algebra A
Functions:
Relations:
Properties: ⋅ is commutative

Differential Algebra
Types: A commutative algebra A
Functions: ∂i ∶ A → A
Relations:
Properties: There are finitely many ∂i over A
All ∂i satisfy the Leibniz product rule
∂i is a homomorphism of A+

2
 3 ALGEBRA: ASSOCIATIVE ALGEBRA

Polynomial Algebra
Types: A commutative Algebra A[X]
Functions: 1 ∈ A[X]
Relations:
Properties: X = {x1 , x2 , ...xn } where xi is an indeterminate, n ≥ 1

Heyting Algebra
Types: A distributive lattice H
Functions: Ð→∶ H 2 → H
Relations:
Properties: (c ∧ a) ≤ b ⇔ c ≤ (a Ð→ b)
Monoid (H, ⋅, 1) has operation ⋅ = ∧

Boolean Algebra
Types: A complemented, distributive lattice and algebra B
Functions: ¬ ∶ B → B
⊕ ∶ B2 → B
Relations:
Properties: ∀x ∈ B, x2 = x
¬ is negation (complementation)
x ⊕ y = (x ∨ y) ∧ ¬(x ∧ y)
⊕ is algebra addition, ∧ is algebra multiplication

Relational Algebra
Types: A commutative algebra R
Functions: ∨ ∶ R2 → R
∧ ∶ R2 → R
−∶R→R
Relations:
Properties:

Section 3
Algebra: Associative Algebra

3
 4 ALGEBRA: NONCOMMUTATIVE ALGEBRA

Associative Algebra
Types: An Algebra A
Functions:
Relations:
Properties: ⋅ is associative

Banach Algebra
Types: An associative algebra A
Functions: ∣∣ ∣∣ ∶ A → R
Relations:
Properties: ∀x, y ∈ A ∶ ∣∣xy∣∣ ≤ ∣∣x∣∣ ∣∣y∣∣
A is also a Banach space

An associative algebra and locally finite poset, A δ ∶ A → A

∗ ∶ A2 → A ∗ is algebra multiplication
Any a ∈ A behaves such that [b, c] ↦ a(b, c)
a(b, c) is taken from a commutative ring of scalars
δ is the identity function

Operator Algebra
Types: An associative Algebra A
Functions: ○ ∶ A2 → A
Relations:
Properties: a ∈ A are continuous linear operators over a topological vector space
○ is operator composition (and algebra multiplication)

Section 4
Algebra: Noncommutative Algebra

Noncommutative Algebra
Types: An algebra A
Functions:
Relations:
Properties: ⋅ in A is need not be commutative

4
 4 ALGEBRA: NONCOMMUTATIVE ALGEBRA

Free Algebra
Types: A noncommutative algebra A[X]
Functions: 1 ∈ A[X]
Relations:
Properties: X = {x1 , x2 , ..., xn } where xi is an indeterminate from an alphabet
1 is the empty word

Tensor Algebra
Types: A noncommutative Algebra T
Functions: ⊕ ∶ T 2 → T
⊗ ∶ T2 → T
Relations:
Properties: T is defined over any vector space V
T k V = V ⊗1 V ⊗2 ... ⊗k V
T (V ) = C ⊕ V ⊕ (V ⊗ V ) ⊕ (V ⊗ V ⊗ V ) ⊕ ....
T k V ⊗ T l V = T k+l V
T (V ) is the most general algebra over V

Universal Enveloping Algebra

Types: A unital associative Algebra U(g) of a Lie Group g
Functions:
Relations:
Properties: I is the ideal generated from x ⊗ y − y ⊗ x − [x, y]∀x, y ∈ T (g)
U(g) = ⊗g)/I

Symmetric Algebra
Types: An associative, commutative algebra ⋁(V ) of a vector space V
Functions: 1 ∈ ⋁(V )
Relations:
Properties: I is the ideal generated from w ⊗ v − v ⊗ w, ∀w, v ∈ V
⋁(V ) = T (V )/I
Division by the commutator makes ⋁(V ) commutative

Exterior Algebra
Types: A nonassociative algebra ⋀(V ) of a vector space V
Functions:
Relations:
Properties: I is the ideal generated from w ⊗ v + v ⊗ w, ∀w, v ∈ V
⋀(V ) = T (V )/I
Division by the anticommutator makes ⋁(V ) anticommutative

5
 5 ALGEBRA: NONASSOCIATIVE ALGEBRA

Section 5
Algebra: Nonassociative Algebra

Nonassocative Algebra
Types: An algebra A
Functions:
Relations:
Properties: ⋅ is need not be associative

Jordan Algebra
Types: A nonassociative algebra A
Functions:
Relations:
Properties: ∀x, y ∈ A ∶ (xy)(xx) = (x(y(xx))

Power Associative Algebra

Types: A nonassocative Algebra A
Functions:
Relations:
Properties: ∀x, y ∈ A ∶ x(x(xx)) = (xx)(xx) = (x(xx))x

Flexible Algebra
Types: A nonassociative Algebra A
Functions:
Relations:
Properties: ∀x, y ∈ A ∶ x(yx) = (xy)x

Alternative Algebra
Types: A nonassociative Algebra A
Functions:
Relations:
Properties: ∀x, y ∈ A ∶ xx(y) = x(xy)

6
 6 ALGEBRA: NOT FURTHER CATEGORIZED

Lie Algebra
Types: A nonassociative Algebra g
Functions: [ ] ∶ g2 → g
Relations:
Properties: ∀x, y ∈ g ∶ [x, y] = −[y, x]
∀x, y, z ∈ g ∶ [x, [y, z]] + [y[z, x]] + [z, [x, y]] = 0
∀x, y, z ∈ g ∶ [ax + by, z] = a[x, z] + b[y, z] and [x, ay + bz] = a[x, y] + b[x, z]
[x, x] = 0

Section 6
Algebra: Not further categorized

Zero Algebra
Types: An algebra A
Functions:
Relations:
Properties: ∀u, v ∈ A, uv = 0
A is inherently associative and commutative

Unital Algebra
Types: An algebra A
Functions: 1 ∈ A
Relations:
Properties: 1 is the identity for ⋅

7
 8 FIELDS: TOPOLOGICAL + RELATED

Section 7
Fields: Basic

Field
Types: A ring K
Functions: + ∶ K2 → K
× ∶ K2 → K
+ ∶K →K
−−1
× ∶ K/{0} → K/{0}
−−1
0, 1 ∈ K
Relations:
Properties: +, × both associate and commute
× distributes over +
0 is the identity for + and 1 is the identity for ×
(K, +) and (K, ×) are groups

Section 8
Fields: Topological + related

Topological Field
Types: A topological ring F
Functions: ⋅ ∶ R2 → R ∶ (x, y) ↦ x ⋅ y
+ ∶ R2 → R ∶ (x, y) ↦ x + y
+ ∶R→R
−−1
× ∶ F /{0} → F /{0}
−−1
Relations:
Properties: +,⋅, −−1
+ , −× are continuous mappings
−1

Local Field
Types: A topological Field K
Functions: ∣ ∣ ∶ K → R≥0
Relations:
Properties: ∀u, v ∈ K, ∃U, V ∈ τ ∶ u ∈ U, v ∈ V, U ∩ V = ∅
if C ⊆ τ satisfies X = ⋃x∈C x, then there exists F ⊆ C, F finite X = ⋃x∈F x

8
 9 FIELDS: CHARACTERISTICS

Archimedian Local Field

Types: A local field K
Functions:
Relations:
Properties: The sequence ∣n∣n≥1 is unbounded

Nonarchimedian Local Field

Types: A local field K
Functions:
Relations:
Properties: The sequence ∣n∣n≥1 is bounded

Section 9
Fields: Characteristics

Characteristic Zero Field

Types: A field K
Functions:
Relations:
Properties: ∄n ∈ N ∶ 1 + 1 + ... + 1 = 0
´¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¸¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¶
n

Ordered Field
Types: A characteristic zero field K
Functions:
Relations: ≤
Properties: ≤ respects + and ×
K is necessarily infinite

Characteristic Nonzero Field

Types: A field K
Functions:
Relations:
Properties: ∃n ∈ N ∶ 1 + 1 + ... + 1 = 0
´¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¸¹¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¹ ¶
n

9
 10 FIELDS: NOT FURTHER CATEGORIZED

Finite Field
Types: A characteristic nonzero field K
Functions:
Relations:
Properties: K has a finite number of elements
The order of some k ∈ K is pn for some p prime, n ∈ N

Section 10
Fields: Not further categorized

Vector Space
Types: A set V over a field K
Functions: + ∶ V 2 → V
+ ∶V →V
−−1
K ×V →V
0∈V
Relations:
Properties: + is associative and commutative
K × V is scalar multiplication by K
(V, +) is a group

Exponential Field
Types: A field K
Functions: Φ ∶ K+ → K×
Relations:
Properties: Φ is a homomorphism

Differential Field
Types: A polynomial field K
Functions: ∂i ∶ K → K
Relations:
Properties: Finitely many ∂i exist over K
∂i satisfies the Leibniz product rule
∂i is a homomorphism of K +

10
 12 GRAPHS: BASIC

Section 11
Fields: Algebraic

Splitting Field
Types: A polynomial field K
Functions:
Relations:
Properties: K is extended so that some polynomial (or set of polynomials) k ∈ K can
be written as the product n linear factors, where n is the degree of the polynomial

Algebraically Closed Field

Types: A field K and a polynomial ring K[X]
Functions:
Relations:
Properties: All polynomials x ∈ K[X] can be decomposed as the product of linear factors
Equivalently, there is no proper algebraic extension of K

Section 12
Graphs: Basic

Simple Graph
Types: A tuple G = (V, E), V, E are sets
Functions:
Relations: E
Properties: E is composed of unordred pairs of V
E is irreflexive and symmetric

11
 13 GRAPHS: UNDIRECTED GRAPHS

Section 13
Graphs: Undirected Graphs

Undirected graph
Types: A graph G = (V, E)
Functions:
Relations:
Properties: ∼ is irreflexive and symmetric

Tree
Types: A undirectd graph G = (V, E)
Functions:
Relations:
Properties: There are no cycles in G
G is connected

Forest
Types: An undirected graph G = (V, E)
Functions:
Relations:
Properties: G’s connected component are trees, but G need not be connected

Rooted Tree
Types: A tree G
Functions:
Relations:
Properties: One vertex is designated as the root

Line Graph
Types: An undirected graph L(G) = (V ∗ , E ∗ ), with underlying undirected graph G = (V, E)
Functions: f ∶E →V∗
Relations: ∼∗ = {{x, y} ∈ E ∗ }∣
Properties: f maps edges in G to vertexes in L(G)
An unordered pair of vertices {vi∗ , vj∗ } ∈ E ∗ iff their corresponding edges in G share an endpoin

12
 14 GRAPHS: DIRECTED GRAPHS

Section 14
Graphs: Directed Graphs

Simple Directed Graph

Types: A graph G = (V, E)
Functions:
Relations:
= {(x, y) ∈ V × V ∣(x, y) ∈ E}
Properties:
is irreflexive
∀u, v ∈ V, u
v ⇏ v
u

Polytree
Types: A directed graph G = (V, E)
Functions:
Relations:
Properties: G’s underlying undirected graph is a tree

Ordered Tree
Types: A directed graph G = (V, E)
Functions:
Relations:
Properties: The children of nodes in G are ordered

Arboresence and Antiarboresence

Types: A rooted polytree, G = (V, E)
Functions:
Relations:
Properties: Every node has a directed path away from or toward the root

Cayley Graph
Types: A directed graph Γ = Γ(G, S), S a generating set for group G
Functions: f ∶ G → V (G)
g ∶ S → CS
Relations: E(Γ) = {(g, gs) ∈ G × G ∣ ∀g ∈ G, ∀s ∈ S}
Properties: f assigns each g ∈ G to a vertex in Γ
g assigns each s ∈ S to a unique color
The identity element generally is ignored, so the graph does not contain loops

13
 15 GRAPHS: K-PARTITE GRAPHS

Graph Algebra
Types:
Functions: ⋅ ∶ V 2 → V ⋃ {0}
Relations:
⎧
⎪x x, y ∈ V, (x, y) ∈ E
⎪
Properties: x ⋅ y ∶ ⎨
⎪
⎪0 x, y ∈ V ⋃ {0}, (x, y) ∉ E
⎩
0∉V

Section 15
Graphs: K-Partite Graphs

K-partite Graph
Types: A graph G = (V, E)
Functions:
Relations:
Properties: V1 , V2 , ..., Vn are disjoint sets that partition G’s vertices
All ei ∈ E can be written as {vi , vj } where vi ∈ Vi , vj ∈ Vj and i ≠ j
G is k-colorable

Bipartite Graph
Types: A k-partite graph G = (V, E)
Functions:
Relations:
Properties: Special case of k-partite graph for k = 2
V1 , V2 are disjoint sets partition G’s vertices
All ei ∈ E can be written as {vi , vj } for some vi ∈ V1 and vj inV2
G has no odd cycles
G is 2-colorable

Hypercube Graph
Types: A regular, bipartite graph Qn = (X, E)
Functions:
Relations:
Properties: Qn has 2n vertices and 2n−1 n edges

14
 16 GRAPHS: PERFECT GRAPH

Section 16
Graphs: Perfect Graph

Perfect Graph
Types: A graph G = (X, E)
Functions: ω ∶ G ↦ n
χ∶G↦n
Relations:
Properties: ω(G) is the the size of the largest clique in G
χ(X) is the the chromatic number of G
ω(G) = χ(G)

Perfectly Orderable Graphs

Types: A perfect graph G = (V, E)
Functions:
Relations: <= {(x, y) ∈ V × V ∣ x < y}
Properties: < is a total order
For any chordless path abcd ∈ G and a < b, then d ≮ c

Chordal Graph
Types: A perfectly orderable graph G = (V, E)
Functions:
Relations:
Properties: All induced cycles are of order 3
G has a perfect elimination order

Comparability Graph
Types: A perfect graph C = (S, ⊥)
Functions:
Relations: ⊥= {(x, y) ∈ S ∣ x < y}
Properties: S is the set of vertices
S is a poset under <
⊥ is the edge relation
(x, y), (y, z) ∈ E Ô⇒ (x, z) ∈ E

15
 17 GRAPHS: NOT FURTHER CATEGORIZED

Section 17
Graphs: Not further categorized

Hyper Graph
Types: A tuple H = (V, E)
Functions:
Relations:
Properties: E = {ei ∣i ∈ Ie , ei ⊆ V }
Ie is an index set for edges in H

Connected Graph
Types: A graph G = (V, E)
Functions:
Relations:
Properties: There exists a path between any two v ∈ V in the graph

Multigraph
Types:
Functions:
Relations:
Properties: E is a multiset
More than one edge may connect the same two vertices

Vertex Labeled Graph

Types: A graph G = (V, E)
Functions: f ∶ V → L
Relations:
Properties: f maps vertexes to a set of labels L

Edge Labeled Graph

Types: A graph G = (V, E) and set L
Functions: f ∶ E → L
Relations:
Properties: f maps edges to a set of labels L

16
 18 GROUPS: PRELIMS

Weighted Graph
Types: An edge labeled graph G = (V, E) and labels L
Functions:
Relations:
Properties: L is an ordered set

Regular Graph
Types: A graph G = (V, E)
Functions:
Relations:
Properties: All v ∈ V are connected to the same number of edges

Section 18
Groups: Prelims

Magma
Types: A set M of elements
Functions: ⋅ ∶ M2 → M
Relations:
Properties: ∀u, v ∈ M ∶ u ⋅ v ∈ M

Semigroup
Types: A magma S of elements
Functions:
Relations:
Properties: ⋅ is associative

Monoid
Types: A semigroup S
Functions: 1∈S
Relations:
Properties: 1 is the identity for ⋅
1⋅ u=u⋅1=u

17
 19 GROUPS: RANDOM/UNCATAGORIZED

Quasigroup
Types: A magma Q
Functions: Ó∶ Q2 → Q
Ò∶ Q2 → Q
1R , 1L ∈ Q
Relations:
Properties: Q is a cancellative magma

Loop
Types: A quasigroup Q
Functions: 1∈Q
Relations:
Properties: 1 is the identity for ⋅
1⋅x=x⋅1=x

Group
Types: A set G
Functions: ⋅ ∶ G2 → G
−−1 ∶ G → G
1∈G
Relations:
Properties: ⋅ is associative
1 is the identity for ⋅
−−1 is the inverse map for ⋅

Section 19
Groups: Random/Uncatagorized

P Group
Types: A group G
Functions:
Relations:
Properties: ∀g ∈ G, ∣g∣ = pn , p prime, n ∈ N

18
 20 GROUPS: FINITE GROUPS

Torsion Free Group

Types: A group G
Functions:
Relations:
Properties: ∄g ∈ G, g ≠ 1 ∶ g n = 1, n ∈ N

Simple Group
Types: A group G
Functions:
Relations:
Properties: N ◁ G Ô⇒ N = {1} or G

Topological group
Types: A group G
Functions:
Relations:
Properties: −−1 and × are continuous maps

Lie Group
Types: A topological group G
Functions:
Relations:
Properties: ∀p ∈ G, ∃Up ≅ Br (p), for some r > 0
−−1 and × are smooth maps

Section 20
Groups: Finite Groups

Finite Group
Types: A group G
Functions:
Relations:
Properties: ∣G∣ = n, n ∈ N

19
 21 GROUPS: FREE GROUPS

Fintie Symmteric Group

Types: A finite group Sn
Functions:
Relations:
Properties: Sn = {σ∣σ ∶ X → X is bijective }

Permutation Group
Types: A group Pn
Functions:
Relations:
Properties: Pn ≤ Sp

Primitive Group
Types: A permutation group G that acts on a set X
Functions:
Relations:
Properties: G preserves only trivial partitions

Alternating Group
Types: A permutation group An
Functions:
Relations:
Properties: An = {σ∣σ ∈ Sn ∧ σ even }

Section 21
Groups: Free Groups

Free Group
Types: A group F
Functions:
Relations:
Properties: F is generated by a set S
There are no relations on FS (beyond group axioms)

20
 23 GROUPS: GROUP PRESENTATIONS

Free Abelian Group

Types: A group F
Functions:
Relations:
Properties: F is generated by a set S
The only relation on F is commutativity

Section 22
Groups: Abelian Groups

Abelian Group
Types: A group G
Functions:
Relations:
Properties: ⋅ is commutative

Section 23
Groups: Group Presentations

Finitely Generated Group

Types: A group G
Functions:
Relations:
Properties: G is of the form ⟨S∣R⟩, S a generating set, R relators
∣S∣ = n, n ∈ N

Finitely Presented Group

Types: A finitely generated group G
Functions:
Relations:
Properties: ∣R∣ = n, n ∈ N

21
 24 GROUPS: CYCLIC GROUPS

Section 24
Groups: Cyclic Groups

Cyclic Group
Types: A group G with element a
Functions:
Relations:
Properties: G can be generated from a and a set of relations R
G is necessarily commutative

Virtually Cyclic Group

Types: A group V with subgroup H
Functions:
Relations:
Properties: ∃H ≤ V ∶ H is cyclic
∣V ∶ H∣ = n, n ∈ N

Locally Cyclic Group

Types: A group L
Functions:
Relations:
Properties: ∀H ≤ L, if H is finitely generated, it is cyclic

Cyclically Ordered Group

Types: A group C
Functions:
Relations: [ , , ] = {(a, b, c) ∈ C × C × C∣[a, b, c]}
Properties: [a, b, c] is cyclic, asymmetric,
transitive and total

Polycyclic Group
Types: A group P with subgroups Hi
Functions:
Relations:
Properties: P is necessarily finitely presented
{Hi }i∈{1,2,..,n−1} ∶ Hi /Hi+1 is cyclic

22
 26 MODULES: NOT FURTHER CATEGORIZED

Metacyclic Group
Types: A group G
Functions:
Relations:
Properties: n ≤ 2

Section 25
Modules: Basic

Module
Types: A set M
Functions: + ∶ M2 → M
+ ∶M →M
−−1
R×M →R
Relations:
Properties: + is associative and commutative
(M, +) is an abelian group
R × M is scalar multiplication by elements in a ring
Scalar multiplication is associative and distributes over addition

Section 26
Modules: Not further categorized

Semimodule
Types: A set M
Functions: + ∶ M 2 → M
R×M →M
Relations:
Properties: + is associative and commutative
(M, +) is an commutative monoid
R × M is scalar multiplication by elements in a ring
Scalar multiplication is associative and distributes over addition

23
 27 MODULES: CHAINS

Simple Module
Types: A module M
Functions:
Relations:
Properties: The only submodules of M are 0 and M

D Module
Types: A module M [X]
Functions: ∂Ri ∶ M → M
Relations:
Properties: X = {x1 , x2 , ..., xn } where xi is an indeterminant
∂Ri is in the ring of scalar multiplication
∂Ri satisfies the Leibniz product rule

Section 27
Modules: Chains

Noetherian Module
Types: A module M
Functions:
Relations:
Properties: For any chain of submodules S0 ⊆ S1 ⊆ ... ⊆ Sk there is some k ≥ 0 s.t. Sk = Sk+1
All submodules of M are finitely generated

Artinian Module
Types: A module M
Functions:
Relations:
Properties: For any chain of submodules S0 ⊇ S1 ⊇ ... ⊇ Sk there is some k ≥ 0 s.t. Sk = Sk+1

24
 29 MODULES: TOWARD VECTOR SPACE

Section 28
Modules: Finitely Generated

Finitely Generated Module

Types: A module M
Functions:
Relations:
Properties: M has a finite number of generators

Cyclic Module
Types: A finitely generated module M
Functions:
Relations:
Properties: M is generated from a single element

Section 29
Modules: Toward Vector Space

Torsion Free Module

Types: A module M
Functions:
Relations:
Properties: ∄m ∈ M, r, m ≠ 0 ∶ r ⋅ m = 0

Flat Module
Types: A torsion Free module M
Functions:
Relations:
Properties: Taking the tensor product over M preserves exact sequences

Projective Module
Types: A flat module M
Functions:
Relations:
Properties:

25
 30 POSETS AND LATTICES: BASICS

Free Module
Types: A projective module M
Functions:
Relations:
Properties: M has no further relations beyond module axioms
M has a basis

Fintie DimensionalVector Space

Types: A set V over a field K
Functions: + ∶ V 2 → V
+ ∶V →V
−−1
K ×V →V
0∈V
Relations:
Properties: + is associative and commutative
K × V is scalar multiplication by K
(V, +) is a group

Section 30
Posets and Lattices: Basics

Set
Types: a collection of objects
Functions: ⊂, ∩, ∪, ∖, ×, ℘, ∥
Relations: ∈
Properties:

Preordered Set
Types: A set P
Functions:
Relations: ≤= {(x, y) ∈ P × P ∣x ≤ y}
Properties: All elements need not be comparable under ≤
≤ transitive and reflexive

26
 31 POSETS AND LATTICES: POSETS NOT FURTHER CATAGORIZED

Partially Ordered Set

Types: A set P
Functions:
Relations: ≤= {(x, y) ∈ P × P ∣x ≤ y}
Properties: All elements need not be comparable under ≤
≤ transitive, reflexive and antisymmteric

Section 31
Posets and Lattices: Posets not Further
Catagorized

Partially Ordered Space

Types: A poset X endowed with topology τ
Functions:
Relations: ≤= {(x, y) ∈ X × X∣x ≤ y}
Properties: ∀x, y ∈ X, x ≰ y ∶ ∃U, V ⊂ τ, x ∈ U, y ∈ V ∶ u ≰ v, ∀u ∈ U, ∀v ∈ V

Locally Finite Poset

Types: A poset P
Functions:
Relations:
Properties: ∀x, y ∈ P, x ≤ y ∶ [x, y] has finitely many elements

Partially Ordered group

Types: A poset and group G
Functions: + ∶ G2 → G
+ ∶G→G
−−1
0∈G
Relations: ≤= {(x, y) ∈ G × G ∣ 0 ≤ −x + y}
Properties: ≤ respects +

27
 33 POSETS AND LATTICES: GRADED STUFF

Section 32
Posets and Lattices: Strict/Total Posets

Strict Poset
Types: A poset P
Functions:
Relations: <= {(x, y) ∈ P 2 ∣ x < y}
Properties: < is irreflexive, transitive, and asymmetric

Totally Ordered Set

Types: A poset P
Functions:
Relations:
Properties: All elements are comparable under ≤

Strict Totally Ordered Set

Types: A poset P
Functions:
Relations: <= {(x, y) ∈ P × P ∣ x < y}
Properties: < is irreflexive, transitive, asymmetric and trichotomous

Section 33
Posets and Lattices: Graded Stuff

Graded Poset
Types: A poset P
Functions: ρ ∶ P → N
Relations: ⋖= {(x, y) ∈ P ∣ ∄z ∶ x < z < y
Properties: x < y Ô⇒ ρ(x) < ρ(y)
x ⋖ y Ô⇒ ρ(y) = ρ(x) + 1

Eulerian Poset
Types:
Functions:
Relations:
Properties:

28
 35 POSETS AND LATTICES: SEMILATTICES

Section 34
Posets and Lattices: Linked + Related

Upward (Downward) Linked Set

Types: A subset S of poset P
Functions:
Relations:
Properties: ∀x, y ∈ S ∶ ∃z ∈ P s.t. x ≤ (≥)z and y ≤ (≥)z

Upwards (Downwards) Centered Set

Types: A linked subset S of poset P
Functions:
Relations:
Properties: ∀Z ⊆ P, Z has an upper (lower) bound ∈ P

Upward (Downward) Directed Set

Types: A preset P
Functions:
Relations:
Properties: ≤ is a preorder
∀x, y ∈ P ∶ ∃z s.t. x ≤ (≥)z and y ≤ (≥)z

Algebraic Poset
Types: A poset P
Functions:
Relations:
Properties: each element is the least upper bound of the compact elements below it

Section 35
Posets and Lattices: Semilattices

29
 36 POSETS AND LATTICES: LATTICES

Meet Semilatttice: Order Theoretic Edition

Types: A poset P
Functions:
Relations: ≤= {(x, y) ∈ P × P ∣ x ≤ y}
Properties: ∀x, y ∈ S, ∃c ∶ c ≤ x, c ≤ y
c is the unique greatest lower bound

Meet Semilattice: Algebraic Edition

Types: A poset P
Functions: ∧ ∶ P 2 → P
Relations:
Properties: ∧ is associative, commutative, and idempotent

Join Semilatttice: Order Theoretic Edition

Types: A poset P
Functions:
Relations: ≤= {(x, y) ∈ P × P ∣ x ≤ y}
Properties: ∀x, y ∈ P, ∃c ∶ x ≤ c, y ≤ c
c is the unique least upper bound

Join Semilattice: Algebraic Edition

Types: A poset P
Functions: ∨ ∶ P 2 → P
Relations:
Properties: ∨ is associative, commutative, and idempotent

Section 36
Posets and Lattices: Lattices

Lattice (order theory)

Types: A set L
Functions:
Relations: ≤= {(x, y) ∈ L × ∣ x ≤ y}
Properties: ∀x, y ∈ L, ∃c, d ∶ c is the greatest lower bound and d is the least upper bound

30
 36 POSETS AND LATTICES: LATTICES

Lattice (Algebra)
Types: A set L
Functions: ∨ ∶ L2 → L
∧ ∶ L2 → L
Relations:
Properties: (L, ∨), (L, ∧) are both semilattices connected by absorption laws
∀a, b ∈ L ∶ a ∨ (a ∧ b) = a, a ∧ (a ∨ b) = a

Complete Lattice
Types: A lattice L
Functions:
Relations:
Properties: ∀A ⊆ L, A has a greatest lower bound and least upper bound

Continuous Lattice
Types: A complete lattice A
Functions:
Relations: ≪= {(x, y) ∈ L × L ∣ ∀D ⊆ L ∶ y ≤ sup D, ∃x ∈ L, ∃d ∈ D s.t. x ≤ d}
Properties: ∀x ∈ P, {a ∣ a ≪ x} is directed and has least upper bound x

Algebraic Lattice
Types: A continuous lattice A
Functions:
Relations:
Properties: Each element is the least of compact elements below it: those x who satisfy x ≪ a

31
 37 POSETS AND LATTICES: A BIG WEB OF LATTICES

Section 37
Posets and Lattices: A Big Web of Lattices

Relatively Complemented Lattice

Types: A lattice L
Functions:
Relations:
Properties: ∀c∀d ≥ c, [c, d] ∶ ∀a ∈ [c, d], ∃b s.t.:
a∨b=d
a∧b=c
a and b are relative complements

Bounded Lattice
Types: A lattice L
Functions:
Relations:
Properties: ∀x ∈ L ∶
x∧1=x
x∨1=1
x∨0=x
x∧0=0

Complemented Lattice
Types: A lattice L
Functions:
Relations:
Properties: ∀a ∈ L, ∃b ∈ L ∶
a∨b=1
a∧b=0

Residuated Lattice
Types: A lattice L
Functions: ⋅ ∶ L2 → L
1∈L
Relations:
Properties: (L, ⋅, 1) is a monoid
(L, ≤) is a lattice
∀z ∶ ∀x, there exists a greatest y and ∀y, there exists a greatest x s.t. x ⋅ y ≤ z

32
 37 POSETS AND LATTICES: A BIG WEB OF LATTICES

Atomic Lattice
Types: A lattice L
Functions:
Relations: ⋖= {(x, y) ∈ P ∣ ∄z ∶ x < z < y}
Properties: ∀b ∈ L ∶ 0 ∧ b = 0
∃ai ∈ L ∶ 0 ⋖ ai
∀b ≠ ai , ∃ai ∶ 0 < ai < b
{ai }i∈I is the set of atoms in L

Semimodular Lattice
Types: A semimodular lattice L
Functions:
Relations:
Properties: a ≤ c Ô⇒ a ∨ (b ∧ c) = (a ∨ b) ∧ c

Modular Lattice
Types: A semimodular lattice L
Functions:
Relations:
Properties: a ≤ c Ô⇒ a ∨ (b ∧ c) = (a ∨ b) ∧ c

Distributive Lattice
Types: A modular lattice L
Functions:
Relations:
Properties: x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z)
x ∨ (y ∧ z) = (x ∨ y) ∧ (x ∨ z)

Orthomodular Lattice
Types: A lattice L
Functions:
Relations:
Properties: a ≤ b Ô⇒ b = a ∨ (b ∧ a⊥ )

33
 37 POSETS AND LATTICES: A BIG WEB OF LATTICES

Orthocomplemented Lattice
Types: A lattice L
Functions: ⊥∶ L → L
Relations:
Properties: ⊥ maps an element a to its complement
a ∨ a⊥ = 1
a ∧ a⊥ = 0
(a⊥ )⊥ = a
a ≤ b Ô⇒ a⊥ ≥ b⊥

Geometric Lattice
Types: A semimodular, atomic, algebraic Lattice L
Functions:
Relations:
Properties: L is finite

Heyting Algebra
Types: A distributive lattice H
Functions: Ð→∶ H 2 → H
Relations:
Properties: (c ∧ a) ≤ b ⇔ c ≤ (a Ð→ b)
Monoid (H, ⋅, 1) has operation ⋅ = ∧

Complete Heyting Algebra

Types: A heyting algebra H
Functions:
Relations:
Properties: H is complete as a lattice

Boolean Algebra
Types: A complemented, distributive lattice and algebra B
Functions: ¬ ∶ B → B
⊕ ∶ B2 → B
Relations:
Properties: ∀x ∈ B, x2 = x
¬ is negation (complementation)
x ⊕ y = (x ∨ y) ∧ ¬(x ∧ y)
⊕ is algebra addition, ∧ is algebra multiplication

34
 39 RINGS: IDEALS + RELATED

Section 38
Rings: Basics

Ring
Types: A set R
Functions: ⋅ ∶ R2 → R
+ ∶ R2 → R
−−1+ ∶R→R
0∈R
Relations:
Properties: (R, +) is an abelian group
⋅ is a monoid and distributes over +

Commutative Ring
Types: A ring R
Functions:
Relations:
Properties: ⋅ is commutative

Noncommutative Ring
Types: A ring R
Functions:
Relations:
Properties: ⋅ need not be commutative

Section 39
Rings: Ideals + Related

Left (right) Ideal

Types: A subgroup of a ring, I
Functions:
Relations:
Properties: ∀x ∈ I, ∀r ∈ R ∶ rx (xr) ∈ I

35
 39 RINGS: IDEALS + RELATED

Ideal
Types: A subgroup of a ring, I
Functions:
Relations:
Properties: The left and right ideals generated by a subgroup are equal
∀x ∈ I, ∀r ∈ R ∶ rx ∈ I

Maximal ideal
Types: A subgroup of elements, I
Functions:
Relations:
Properties: I ⊆ J Ô⇒ I = J or J = R

Principal ideal
Types: A subgroup of elements, I
Functions:
Relations:
Properties: I is generated by a single element

Prime Ideal
Types: A subgroup of elements I
Functions:
Relations:
Properties: ab ∈ I Ô⇒ a ∈ I or b ∈ I

Quotient Ring
Types: A ring Q
Functions:
Relations: ∼= {(x, y} ∈ R × R ∣ x − y ∈ I}
Properties: Q is constructed by dividing R with one of its ideals

36
 40 RINGS: BOOLEANS + RELATED

Section 40
Rings: Booleans + Related

Boolean Ring
Types: A commutative ring R
Functions:
Relations:
Properties: ∀x ∈ R ∶ x2 = x
∀x ∈ R ∶ 2x = 0

Boolean Algebra
Types: A complemented, distributive lattice and algebra B
Functions: ¬ ∶ B → B
⊕ ∶ B2 → B
Relations:
Properties: ∀x ∈ B, x2 = x
¬ is negation (complementation)
x ⊕ y = (x ∨ y) ∧ ¬(x ∧ y)
⊕ is algebra addition, ∧ is algebra multiplication

Sigma Algebra
Types: A subset Σ, of ℘(X), X a set
Functions: ∩, ∪, ∖
Relations:
Properties: X ∈ Σ
∩, ∪ closed under countable operations

37
 41 RINGS: RANDOMS/NOT FURTHER CATAGORIZED

Section 41
Rings: Randoms/Not further catagorized

Semiring
Types: A set R
Functions: ⋅ ∶ R2 → R
+R2 → R
0∈R
Relations:
Properties: + is a commutative monoid
⋅ is a monoid and distributes over +

Noetherian Ring
Types: A ring R
Functions:
Relations:
Properties: For any I0 ⊆ I1 ⊆ ... ⊆ Ik there is some k ≥ 0 s.t. Ik = Ik+1

Artinian Ring
Types: A ring R
Functions:
Relations:
Properties: For any I0 ⊇ I1 ⊇ ... ⊇ Ik there is some k ≥ 0 s.t. Ik = Ik+1

Topological Ring
Types: A ring R with topology τ
Functions: ⋅ ∶ R2 → R ∶ (x, y) ↦ x ⋅ y
+ ∶ R2 → R ∶ (x, y) ↦ x + y
+ ∶R→R
−−1
Relations:
Properties: ⋅ distributes over +
+ are continuous mappings
+, ⋅, −−1

38
 42 RINGS: VALUATION BS

Section 42
Rings: Valuation bs

Domain
Types: A ring R
Functions:
Relations:
Properties: ∀a, b ∈ R, ab = 0 Ô⇒ a = 0 or b = 0

Integral Domain
Types: A ring R
Functions:
Relations:
Properties: ⋅ is additionally commutative

Unique Factorization Domain

Types: An integral domain R
Functions:
Relations:
Properties: All ideals are finitely generated
All irreducible elements are prime
∀x ∈ R, x ≠ 0, x = up1 p2 ...pn for u unit, pi prime

Principal Ideal Domain

Types: A unique factorization domain R
Functions:
Relations:
Properties: All ideals are principal
Any two elements have a greatet common divisor

Euclidean Domain
Types: A principal idea domain R
Functions: fi ∶ R ∖ {0} → R
Relations:
Properties: fi is the euclidean (gcf) algorithim
R may have many fi or just one

39
 43 RINGS: BUDGET VERSIONS OF FIELDS

Section 43
Rings: Budget versions of fields

Field
Types: A ring K
Functions: + ∶ K2 → K
×K 2 → K
+ ∶K →K
−−1
× ∶ K/{0} → K/{0}
−−1
0, 1 ∈ K
Relations:
Properties: +, × both associate and commute
× distributes over +

Module
Types: An abelian group (M, +)
Functions: ⋅∶r×M →M
⋅∶M ×r →M
Relations:
Properties: ⋅ is scalar multiplication by elements in a ring, R
⋅ associates and distributes over addition

Vector Space
Types: A set V over a field K
Functions: + ∶ V 2 → V
+ ∶V →V
−−1
K ×V →V
0∈V
Relations:
Properties: + is associative and commutative
K × V is scalar multiplication by K
(V, +) is a group

Finite Field
Types: A characteristic nonzero field K
Functions:
Relations:
Properties: K has a finite number of elements
The order of some k ∈ K is pn for some p prime and n ∈ N

40
 45 SETS: COUNTABLE

Section 44
Sets: Basics

Set
Types: a collection of objects
Functions: ⊂, ∩, ∪, ∖, ×, ℘, ∣ ∣
Relations: ∈
Properties:

Section 45
Sets: Countable

Countable Set
Types: A set S
Functions:
Relations:
Properties: ∣S∣ ≤ ℵ0

Infinite Countable Set

Types: A set S
Functions:
Relations:
Properties: ∣S∣ = ℵ0
bijection into N

Finite Countable Set

Types: A set S
Functions:
Relations:
Properties: ∣S∣ < ℵ0

41
 47 SETS: CLASSES

Section 46
Sets: Uncountable

Uncountable Set
Types: A set S
Functions:
Relations:
Properties: ∣S∣ > ℵ0

Section 47
Sets: Classes

Proper Class
Types: a collection, C of sets
Functions: ϕ(x)
Relations:
Properties: ϕ(x) is a membership function
C is not a set

Ordinal
Types: A collection of sets, Xi
Functions: ×, +, X n , S(n)
Relations: >
Properties: Xk = {0, 1, 2, ...Xk−1 }
> is trichotomous, transitive, and wellfounded

Cardinal
Types: Ordinals κ
Functions:
Relations:
Properties: The cardinality κ is the least ordinal, α, s.t. there is a bijection between S and α

42
 49 TOPOLOGIES: ALGEBRAIC TOPOLOGIES

Section 48
Topologies: Basics

Convergent Space
Types: A set S and filters on S, F
Functions:
Relations: →
Properties: ∀F ∈ F, x ∈ S, F → x ⇔ F convergences to X
→ is centered, isotone, and directed
N (x) = ⋂{F ∈ F∣F → x}

Topological Space
Types: A set X and τ ⊆ ℘(X)
Functions:
Relations:
Properties: X, ∅ ∈ τ
xi ∈ τ Ô⇒ ⋂i∈I xi ∈ τ for finite I
xi ∈ τ Ô⇒ ⋃j∈J xj ∈ τ

Section 49
Topologies: Algebraic Topologies

Topological Group
Types: A group G with topology τ
Functions: ⋅ ∶ G2 → G ∶ (x, y) ↦ x ⋅ y
−−1 ∶ G → G
1∈G
Relations:
Properties: ⋅, −−1 are continuous mappings

43
 49 TOPOLOGIES: ALGEBRAIC TOPOLOGIES

Topological Ring
Types: A ring R with topology τ
Functions: ⋅ ∶ R2 → R ∶ (x, y) ↦ x ⋅ y
+ ∶ R2 → R ∶ (x, y) ↦ x + y
+ ∶R→R
−−1
Relations:
Properties: ⋅ distributes over +
+ are continuous mappings
+, ⋅, −−1

Topological Field
Types: A topological ring K
Functions: A field K with topology τ
Relations: ⋅ ∶ K 2 → K ∶ (x, y) ↦ x ⋅ y
+ ∶ K 2 → K ∶ (x, y) ↦ x + y
−−1+ ∶K →R
−−1× ∶ K/{0} → K/{0}
Properties:

+ , −⋅
+, ⋅, −−1 are continuous mappings
−1

Topological Vector Space

Types: A vector space V over a topological field K
Functions: + ∶ V 2 → V
k×V →V
+ ∶V →V
−−1
Relations:
Properties: k × V represents scalar multiplication by elements in a field K
+ and scalar multiplication are continuous
+, −−1

44
 50 TOPOLOGIES: WEB I

Section 50
Topologies: Web I

Uniform Space
Types: A topological space U and entourages Φ
Functions:
Relations: U = {(x, y)∣x ≈u y}
Properties: Φ is a nonempty collection of relations on S
U ∈ Φ and U ⊆ V ⊆ X × X Ô⇒ V ∈ Φ
∀U ∈ Φ, ∃V ∈ Φ, ∀x, y, z ∶ V ○ V ⊆ Φ ∶ x ≈V y, y ≈V z Ô⇒ x ≈U z
∀U ∈ Φ, ∃V ∈ Φ, ∀x, y ∶ V ○ V ⊆ Φ ∶ y ≈V x Ô⇒ x ≈U y
U, V ∈ Φ Ô⇒ U ∩ V ∈ Φ

Complete Uniform Space

Types: A uniform Space U
Functions:
Relations:
Properties: ∀F ∀U ∶ ∃A ∈ F ∶ A × A ⊆ U, F converges

Manifold
Types: A topological space, M
Functions:
Relations:
Properties: ∀p ∈ M, ∃u ∈ U(p) ∶ u ≅ Rn
Manifolds are not inherently metric or inner product spaces

Compact Manifold
Types: A manifold M
Functions:
Relations:
Properties: X = ⋃x∈C x, then for F ⊆ C, F finite, X = ⋃x∈F x

Smooth Manifold
Types: A manifold M
Functions:
Relations:
Properties: Derivatives of arbitrary orders exist

45
 51 TOPOLOGIES: WEB II

Riemann Manifold
Types: A smooth manifold M
Functions: gp ∶ Tp M 2 → R
Relations:
Properties: gp is the inner product on the tangent space of a point p
gp (X, Y ) = gp (Y, X)
gp (aX + Y, Z) = agp (X, Z) + gp (Y, Z)

Pseudo Riemann Manifold

Types: A smooth manifold M
Functions: gp ∶ Tp M 2 → R
Relations:
Properties: gp is the inner product on the tangent space of a point p
gp (X, Y ) = 0 ∀Y Ô⇒ X = 0

Affine Space
Ð
→
Types: A set A and vector space A
Ð
→
Functions: A × A → A ∶ (a, v) ↦ a + v
Relations:
Ð
→
Properties: A ’s additive group acts freely and transitively on A
Ð→
∀v, w ∈ A , ∀a ∈ A, (a + w) + u = a + (w + u)
Ð
→
∀a, b ∈ A, ∃v ∈ R ∶ b = a + v
Ð→
∀a ∈ A, A → A ∶ v ↦ a + v is bijective

Section 51
Topologies: Web II

Metric Space
Types: A topological space M
Functions: d ∶ M 2 → R
Relations:
Properties: d(x, y) ≥ 0
d(x, y) = 0 ⇔ x = y
d(x, y) = d(y, x)
d(x, z) ≤ d(x, y) + d(y, z)

46
 51 TOPOLOGIES: WEB II

Complete Metric Space

Types: A metric space M
Functions:
Relations:
Properties: ∀F ∀U ∶ ∃A ∈ F ∶ A × A ⊆ U, F converges

Normed Vector Space

Types: A metric and topological vector space V
Functions: ∥ ∥ ∶ V → R
Relations:
Properties: ∥x∥ > 0 for x ≠ 0 and ∥x∥ = 0 iff x = 0
∥αx∥ = ∣α∣∥x∥
∥x + y∥ ≤ ∥x∥ + ∥y∥
∥ ∥ induces a metric on V ∶ d(x, y) = ∥x − y∥

Banach Space
Types: A vector space V
Functions:
Relations:
Properties: for any Cauchy Sequence {xn }limx→∞ ∥xn − x∥ = 0

Inner Product Space

Types: A vector space V and field of scalars F
Functions: ⟨⋅, ⋅⟩ ∶ V 2 → F
Relations:
Properties: ⟨x, y⟩ = ⟨y, x⟩
⟨x, x⟩ ≥ 0
⟨x, x⟩ = 0 iff x = 0
⟨ax, y⟩ = a⟨x, y⟩
⟨x + y, z⟩ = ⟨x, z⟩ + ⟨y, z⟩

Hilbert Space
Types: An inner product space H
Functions:
Relations: √
Properties: A norm may be defined as ∥x∥ = ⟨x, x⟩
for any Cauchy Squence {xn }, limx→∞ ∥xn − x∥ = 0

47
 51 TOPOLOGIES: WEB II

Euclidean Space
Types: A banach and hilbert space Rn
Functions:
Relations: √ √
Properties: A norm is√defined as ∥x∥ = ⟨x, x⟩ = ∑ni=1 (xi )2
d(x, y) = ∑ni=1 (xi − yi )2

48