Course11110800158 lectures
Introduction to Algebraic Structures
Prof. Mahesh Kakde and Prof. R. Venkatesh · IISc Bangalore
About
This course aims to offer an accessible introduction to algebraic structures to undergraduate students, exploring foundational topics such as set theory, combinatorics, graph theory, number theory, and group theory. It presents fundamental counting techniques and applies them to solve introductory counting problems, including those related to graphs. Gradually, the course transitions into basic number theory and introduces the concept of groups, using examples derived from combinatorics and number theory to provide a deeper understanding of these mathematical structures. This course does not require any prior knowledge of mathematics.
Intended audience: UG level course
Lectures
Week 1 Introduction to set theory and functions
- Introduction to mathematics and set theory
- Set identities, Cartesian product, relations and functions
- Logic and construction of new sets
- Functions
- Properties of functions
Week 2 Further set theory and the use of functions
- Composing functions and Cantor's theorem
- Don Zaiger's proof: Primes of the form 4k+1 can written as sum of two squares.
- Axiom of choice and Paritition of a set.
- Correspondence between partitions of a set and equivalence relations on it.
- Partially ordered sets, well-ordering principle and Zorn's lemma.
Week 3: Natural numbers, order properties, finite sets, countably infinite sets and uncountable sets")
- Defining natural numbers: Peano axioms.
- Order properties of natural numbers and notion of cardinality of a set.
- Cardinality of a finite set.
- Countable sets
- Uncountable sets
Week 4 Foundations of Number Systems and Counting Techniques
- Schroder-Bernstein theorem
- Integers and Rational Numbers
- The Construction of Rational Numbers and Counting Principles
- Counting in Two Ways
- Binomial Coefficients and Properties
Week 5 Pigeonhole Principle, Formal Series, Linear Recurrence Relations, Inclusion–Exclusion Principle
- The Pigeonhole Principle
- Formal Series
- Formal Series and Applications
- Solving Linear Recurrences
- Principle of Inclusion and Exclusion
Week 6 Partially Ordered Sets, Möbius Function, Graph Theory
- Möbius Function on Finite Posets
- Möbius Inversion Formula
- Möbius Inversion Formula and Applications
- Introduction to Graph Theory, Graphs and Special Graph Families
- Graph Representations and Basic Graph Operations
Week 7 Graph Structures and Properties
- Handshake Lemma and Graph Connectivity
- Cycles, Bipartite Graphs, and Trees
- Trees and Their Properties
- Eulerian and Hamiltonian Graphs
- Matchings and Graph Coloring
Week 8 Introduction to number theory
- Number theory and divisibility
- Greatest Common Divisor - I
- Greatest Common Divisor - II
- LCM, primes and prime factorisation
- Consequences of prime factorisation and infinitude of primes
Week 9 Modular arithmetic
- Euler's proof of infinitude of primes
- Congruencies and modular arithmetic
- Diophantine equations and residue classes
- Solving Diophantine equations in one variable and Chinese remainder theorem
- Solving Diophantine equations using CRT
Week 10 Congruencies and Mobius inversion
- Proof of Hensel's lemma
- Introduction to Euler's totient function
- More on totient function
- Mobius inversion formula
- Euler's theorem
Week 11 Ring of reside classes and its group of units, polynomial ring over a field, primitive roots and linear…
- Ring structure on set of residue classes
- Polynomial ring over a field, division algorithm and consequences.
- Wilson's theorem, Lagrange's theorem and introduction to cyclic groups
- Classification of cyclic unit groups modulo m and proof.
- Primitive roots modulo m and application in solving linear congruences
Week 12 Quadratic residue, Legendre symbol and primes in AP.
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IISc Bangalore
- Department
- Mathematics
- Taught by
- Prof. Mahesh Kakde, Prof. R. Venkatesh
- Level
- Undergraduate
- Language
- English
- Subjects
- Mathematics
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed