Abstract algebra

Dong-Ling Deng (邓东灵)

Tsinghua University

Abstract Algebra-2023 Spring

 Course information
Time: Monday 1:30-4:05 PM
Location: 六教6A117
About me: Prof. Dong-Ling Deng (邓东灵)
Email: [email protected]; 13146062508
o ce: S-311, MMW Building (蒙民伟科技⼤楼)
TA:Weikang Li (李炜康), [email protected]
Zide Lu (鲁智德), [email protected]
Qi Ye (叶奇), [email protected]
Weiyuan Gong (龚维元), [email protected]
ffi
 Course information
Time: Monday 1:30-4:05 PM
Location: 六教6A117
About me: Prof. Dong-Ling Deng (邓东灵)
Email: [email protected]; 13146062508
o ce: S-311, MMW Building (蒙民伟科技⼤楼)
TA:Weikang Li (李炜康), [email protected]
Zide Lu (鲁智德), [email protected]
Qi Ye (叶奇), [email protected]
Weiyuan Gong (龚维元), [email protected]
Grades: HW 30% + Mid rm 30% + Final 40%
HW: Assigned weekly, due in class on Monday (need a class
representa ve); Team work encouraged, but NO copy!
Of ce hour: by individual appointment
fi
ffi
ti
te
 Course information
Textbook: Abs act algebra, by Dummit & Foo , ird edi on
References:
a) Algebra, by Ar n, Second edi on
b) Abs act algebra: eory and applica on, by Judson, 2017 edi on
c) Abs act algebra: An In oduc on, by Hungerford, ird edi on
tr
tr
ti
Th
tr
tr
ti
ti
ti
Th
th
te
ti
Th
ti
ti
 What is abstract algebra?
Wikipedia:
e study of algebraic s uctures, such as groups, rings,
elds, modules, …
Reading: A his ry of abs act algebra, by Kleiner, @2007
fi
Th
to
tr
tr
 What is abstract algebra?
Wikipedia:
e study of algebraic s uctures, such as groups, rings,
elds, modules, …
Reading: A his ry of abs act algebra, by Kleiner, @2007

Why study abstract algebra?

Applications:
a) Ma ema cs: Topology, ca gory eory, di eren al geome y, …
b) Compu r science: coding eory, cryp graphy, quantum compu ng, …
c) Physics: standard model, s ing eory, pological phases of ma er, …
fi
th
Th
te
ti
to
th
tr
te
th
tr
th
tr
to
to
ff
ti
tr
tt
ti
 What is abstract algebra?
Wikipedia:
e study of algebraic s uctures, such as groups, rings,
elds, modules, …
Reading: A his ry of abs act algebra, by Kleiner, @2007

Why study abstract algebra?

Applications:
a) Ma ema cs: Topology, ca gory eory, di eren al geome y, …
b) Compu r science: coding eory, cryp graphy, quantum compu ng, …
c) Physics: standard model, s ing eory, pological phases of ma er, …
Poetry and future:
a) Be able apprecia e beau (elegance) of algebraic s uctures, …
b) Be able ink in e spirit of abs act algebra, …
fi
th
Th
te
to
to
ti
th
te
th
to
th
th
tr
te
ty
th
tr
th
tr
tr
to
to
ff
ti
tr
tr
tt
ti
 Feel it via concrete examples
In mathematical sciences
3128
Arithmetic problem: What are the last three digits of 37 ?
 Feel it via concrete examples
In mathematical sciences
3128
Arithmetic problem: What are the last three digits of 37 ?
Three geometric problems posed by the Greeks:
1. Doubling the Cube: Is it possible using only straightedge and
compass to construct a cube with precisely twice the volume of
a given cube?
2. Trisecting an Angle: Is it possible using only straightedge and
compass to trisect any given angle?
3. Squaring the Circle: Is it possible using only straightedge and
compass to construct a square whose area is precisely the area
of a given circle?
 Feel it via concrete examples
In mathematical sciences
3128
Arithmetic problem: What are the last three digits of 37 ?
Three geometric problems posed by the Greeks:
1. Doubling the Cube: Is it possible using only straightedge and
compass to construct a cube with precisely twice the volume of
a given cube?
2. Trisecting an Angle: Is it possible using only straightedge and
compass to trisect any given angle?
3. Squaring the Circle: Is it possible using only straightedge and
compass to construct a square whose area is precisely the area
of a given circle?
Algebraic problem: is it possible to solve the roots of a polynomial
by radicals in general?
……
 Feel it via concrete examples
In computer sciences
A counting problem: For positive integers w, h, s consider the equivalence
classes of w×h matrices, with entries on the set S={1,2,3,…,s}, identified by
arbitrary permutations of the rows and the columns. The goal is to compute the
number of those classes.
 Feel it via concrete examples
In computer sciences
A counting problem: For positive integers w, h, s consider the equivalence
classes of w×h matrices, with entries on the set S={1,2,3,…,s}, identified by
arbitrary permutations of the rows and the columns. The goal is to compute the
number of those classes.

The odd neighborhood covers

Consider an m×n grid graph. At each vertex is a turned on light bulb and also a
switch that changes the state of its bulb and those of its neighbors (adjacent
vertices). Can all the lights be turned off?
 Feel it via concrete examples
In computer sciences
A counting problem: For positive integers w, h, s consider the equivalence
classes of w×h matrices, with entries on the set S={1,2,3,…,s}, identified by
arbitrary permutations of the rows and the columns. The goal is to compute the
number of those classes.

The odd neighborhood covers

Consider an m×n grid graph. At each vertex is a turned on light bulb and also a
switch that changes the state of its bulb and those of its neighbors (adjacent
vertices). Can all the lights be turned off?
This problem was open for many years until in 1989 K. Sutner, then a graduate
student, showed using automata theory that the answer is yes for any ( nite)
graph! More explicitly, let G be a nite graph with a turned on light bulb at each
vertex. At each vertex is a switch that changes the state of that vertex and all its
neighbors. Then it is possible to turn off all the lights.
fi
fi
 Feel it via concrete examples
The Barrington's theorem
A branching program with n variables of width k and length m consists of a sequence
of m instructions. Each of the instructions is a tuple (i, p, q) where i is the index of
variable to check (1 ≤ i ≤ n), and p and q are functions from {1, 2, ..., k} to {1, 2, ...,
k}. Numbers 1, 2, ..., k are called states of the branching program. The program
initially starts in state 1, and each instruction (i, p, q) changes the state from x to p(x)
or q(x), depending on whether the ith variable is 0 or 1.
A family of branching programs consists of a branching program with n variables for
each n.
 Feel it via concrete examples
The Barrington's theorem
A branching program with n variables of width k and length m consists of a sequence
of m instructions. Each of the instructions is a tuple (i, p, q) where i is the index of
variable to check (1 ≤ i ≤ n), and p and q are functions from {1, 2, ..., k} to {1, 2, ...,
k}. Numbers 1, 2, ..., k are called states of the branching program. The program
initially starts in state 1, and each instruction (i, p, q) changes the state from x to p(x)
or q(x), depending on whether the ith variable is 0 or 1.
A family of branching programs consists of a branching program with n variables for
each n.
It is easy to show that every language L on {0,1} can be recognized by a family of
branching programs of width 5 and exponential length, or by a family of exponential
width and linear length.
Every regular language on {0,1} can be recognized by a family of branching programs
of constant width and linear number of instructions (since a DFA can be converted to a
branching program). BWBP denotes the class of languages recognizable by a family of
branching programs of bounded width and polynomial length.
Barrington's theorem says that BWBP is exactly nonuniform NC1. The proof uses
the nonsolvability of the symmetric group S5
 Feel it via concrete examples
In physical sciences
Classi cations of topological phases of matter

[1] Deng, Topological phases of matter: classification, realization and application, Ph.D. Thesis, 2015
[2] Chen, Gu, Liu, and Wen, “Symmetry-protected topological orders in interacting bosonic systems,” Science, 338,1604 (2012).
fi
 Feel it via concrete examples
In physical sciences
Quantum computing
Given a group G, a subgroup H ≤ G, and a set X, we say a function f : G → X hides the subgroup H if
for all g1, g2 ∈ G, f(g1) = f(g2) if and only if g1H = g2H. Equivalently, the function f is constant on the
cosets of H, while it is different between the different cosets of H.
Hidden subgroup problem: Let G be a group, X a nite set, and f : G → X a function that hides a
subgroup H ≤ G. The function f is given via an oracle, which uses O(log |G|+log|X|) bits. Using
information gained from evaluations of f via its oracle, determine a generating set for H.
A special case is when X is a group and f is a group homomorphism in which case H corresponds to the
kernel of f.

fi
 Feel it via concrete examples
In physical sciences
Quantum computing
Given a group G, a subgroup H ≤ G, and a set X, we say a function f : G → X hides the subgroup H if
for all g1, g2 ∈ G, f(g1) = f(g2) if and only if g1H = g2H. Equivalently, the function f is constant on the
cosets of H, while it is different between the different cosets of H.
Hidden subgroup problem: Let G be a group, X a nite set, and f : G → X a function that hides a
subgroup H ≤ G. The function f is given via an oracle, which uses O(log |G|+log|X|) bits. Using
information gained from evaluations of f via its oracle, determine a generating set for H.
A special case is when X is a group and f is a group homomorphism in which case H corresponds to the
kernel of f.

The hidden subgroup problem is especially important in the theory of quantum computing for the
following reasons.
• Shor's quantum algorithm for factoring and discrete logarithm (as well as several of its
extensions) relies on the ability of quantum computers to solve the HSP for nite Abelian groups.
• The existence of ef cient quantum algorithms for HSPs for certain non-Abelian groups would
imply ef cient quantum algorithms for two major problems: the graph isomorphism problem and
certain shortest vector problems (SVPs) in lattices. More precisely, an ef cient quantum
algorithm for the HSP for the symmetric group would give a quantum algorithm for the graph
isomorphism. An ef cient quantum algorithm for the HSP for the dihedral group would give a
quantum algorithm for the poly(n) unique SVP.
fi
fi
fi
fi
fi
fi
 Outline of this course
Contents:
a) Group eory (4 weeks, Ch. 1, 2,3,4,5): groups, subgroups, groups’ ac ons,
Sylow eory, homomorphism and isomorphism, Cauchy’s eorem, direct
and semi-direct product, …
b) Module eory (1 week, Ch. 10): modules, quo ent modules, direct sum,
nsor product, exact sequences, ex rior algebras, …
c) Representa on eory for groups (1 week, lecture no s)
d) Ring eory (4 weeks, Ch. 7,8,9): rings, e Chinese remainder eorem,
principal idea domains, polynomial rings, …
e) Field eory (4 weeks, Ch. 13,14): eld ex nsion, spli ing eld,
ndamental eorem of algebra, Galois eory, …
f) La ices, Boolean algebras, and group cohomology (1 week, lecture no s)
te
fu
tt
th
th
th
th
Th
ti
th
th
fi
te
th
th
te
ti
te
tt
fi
th
th
ti
te
Warning: Cha
ll
enging but wor it! WORK VERY HARD!

th
Warning: Cha enging but wor it! WORK VERY HARD!

Do not go gentle into that good night

Rage, rage against the dying of the light
—Dylan Thomas
ll
th
Warning: Cha enging but wor it! WORK VERY HARD!

Do not go gentle into that good night

Rage, rage against the dying of the light
—Dylan Thomas

May e power of P versus NP be wi you!

th
ll
th
th