- ES Español (Latinoamérica)

- EN English

4.2. Algebra and Number Theory (ANT)
This area covers the algebraic structures underlying modern mathematics and their applications, from the foundations of linear algebra and group theory to the arithmetic of number fields, algebraic coding, and cryptography.
| Knowledge Area (KA) | Core Tier1 | Core Tier2 |
4.2.1 Matrices and Systems of Linear Equations | 1 | 1 |
4.2.2 Vector Spaces and Linear Transformations | 1 | 1 |
4.2.3 Eigenvalues, Inner Product Spaces, and Quadratic Forms | 1 | 1 |
4.2.4 Group Theory | 1 | 1 |
4.2.5 Rings, Fields, and Galois Theory | 1 | 1 |
4.2.6 Module Theory and Commutative Algebra | Elective | |
4.2.7 Analytic Number Theory | Elective | |
4.2.8 Algebraic Number Theory | Elective | |
4.2.9 Representation Theory | Elective | |
4.2.10 Cryptography and Coding Theory | 1 | 1 |
4.2.1. ANT/Matrices and Systems of Linear Equations (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Matrix algebra, systems of linear equations and their solution methods, determinants, and matrix decompositions.
Topics:
Core
- Matrix algebra: addition, scalar multiplication, matrix multiplication, transpose, types of matrices, and the inverse of a matrix
- Solving systems of linear equations via Gaussian elimination and Gauss-Jordan; row echelon form, rank, and consistency of systems
- Determinants: definition, properties, Cramer's rule, and geometric interpretation
- Matrix decompositions: LU, QR, and singular value decomposition (SVD)
Learning Outcomes:
Core:
- Identify types of matrices and perform basic matrix algebra operations, including computing the inverse of a matrix [Familiarity]
- Solve systems of linear equations using Gaussian elimination or Gauss-Jordan, determining the rank and consistency of the system [Usage]
- Apply Cramer's rule and the LU, QR, and SVD decompositions to solve linear systems and factor matrices [Assessment]
4.2.2. ANT/Vector Spaces and Linear Transformations (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Vector spaces, subspaces, bases, and linear maps between vector spaces.
Topics:
Core
- Vector spaces and subspaces; bases, dimension, and linear independence
- Linear maps, kernel and image, rank-nullity theorem, and matrix representations
Learning Outcomes:
Core:
- Identify whether a set with given operations forms a vector space and determine a basis [Familiarity]
- Determine the kernel, image, and matrix representation of a linear map, verifying the rank-nullity theorem [Usage]
- Apply linear transformations to model and solve problems involving change of basis and composition of maps [Assessment]
4.2.3. ANT/Eigenvalues, Inner Product Spaces, and Quadratic Forms (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Eigenvalues, diagonalization, inner product spaces, and quadratic forms, with applications to optimization and data approximation.
Topics:
Core
- Eigenvalues and eigenvectors; diagonalization and the spectral theorem
- Inner product spaces, orthogonality, Gram-Schmidt process, and least squares
- Quadratic forms and definiteness: classification as positive, negative, or indefinite via eigenvalues
Learning Outcomes:
Core:
- Identify the eigenvalues and eigenvectors of a matrix and determine whether it is diagonalizable [Familiarity]
- Compute the diagonalization of matrices via the spectral theorem and apply the Gram-Schmidt process to obtain orthogonal bases [Usage]
- Apply least squares methods and the classification of quadratic forms via eigenvalues to solve approximation and optimization problems [Assessment]
4.2.4. ANT/Group Theory (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Groups, subgroups, homomorphisms, quotient groups, and the classification of finite groups.
Topics:
Core
- Groups, subgroups, cyclic groups, and order of elements
- Cosets, Lagrange's theorem, and normal subgroups
- Group homomorphisms, isomorphisms, and the isomorphism theorems
- Group actions, orbits, stabilizers, and Burnside's lemma
- Sylow theorems and classification of finite groups of small order
Learning Outcomes:
Core:
- State Lagrange's theorem and explain the relationship between subgroups and cosets [Familiarity]
- Apply the isomorphism theorems to analyze homomorphic images and quotient groups [Usage]
- Use Sylow theorems to determine the structure and number of subgroups of a finite group [Assessment]
4.2.5. ANT/Rings, Fields, and Galois Theory (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Rings, ideals, polynomial rings, field extensions, and the Galois correspondence between field extensions and permutation groups.
Topics:
Core
- Rings, ideals, quotient rings, and the ring isomorphism theorems
- Polynomial rings: irreducibility, factorization, and unique factorization domains
- Field extensions: algebraic and transcendental elements, degree, and splitting fields
- Galois groups, the Galois correspondence, and solvability by radicals
- Finite fields: structure, existence, and applications in coding theory
Learning Outcomes:
Core:
- Classify rings as integral domains, PIDs, or UFDs and justify the classification [Familiarity]
- Determine the Galois group of a polynomial and apply the Galois correspondence [Usage]
- Prove that general quintic equations are not solvable by radicals using Galois theory [Assessment]
4.2.6. ANT/Module Theory and Commutative Algebra ↑ Back to top
Modules over rings, free and projective modules, the structure theorem for finitely generated modules, and commutative algebra.
Topics:
Non Core
- Modules over rings: definitions, submodules, quotients, and homomorphisms
- Free and projective modules; exact sequences and split sequences
- Structure theorem for finitely generated modules over a PID (Jordan normal form)
- Tensor products of modules: definition, properties, and applications
- Localization, prime and maximal ideals, Noetherian rings, and Hilbert's basis theorem
Learning Outcomes:
NonCore:
- Explain the structure theorem for finitely generated modules over a PID and derive the Jordan normal form [Familiarity]
- Construct tensor products and apply them to multilinear algebra problems [Usage]
- Analyze a commutative ring by identifying its prime spectrum and applying localization [Assessment]
4.2.7. ANT/Analytic Number Theory ↑ Back to top
Distribution of prime numbers, Dirichlet series, the Riemann zeta function, and L-functions.
Topics:
Non Core
- Arithmetic functions, the prime counting function, and the Prime Number Theorem
- Dirichlet series: convergence, the Euler product, and multiplicative functions
- The Riemann zeta function: analytic continuation, functional equation, and the critical strip
- Dirichlet characters, L-functions, and primes in arithmetic progressions
- Sieve methods: Eratosthenes, Legendre, and the large sieve
Learning Outcomes:
NonCore:
- State the Prime Number Theorem and describe the role of the Riemann zeta function in its proof [Familiarity]
- Apply Dirichlet series and multiplicative functions to derive asymptotic estimates [Usage]
- Analyze the distribution of primes in arithmetic progressions using Dirichlet's theorem [Assessment]
4.2.8. ANT/Algebraic Number Theory ↑ Back to top
Number fields, rings of integers, ideal factorization, class groups, and the geometry of numbers.
Topics:
Non Core
- Number fields: algebraic integers, rings of integers, and their basic properties
- Unique factorization of ideals in Dedekind domains
- Ideal class group, Minkowski's theorem, and finiteness of the class number
- Units, Dirichlet's unit theorem, and ramification of primes
- \(p\)-adic numbers and valuations; local fields
Learning Outcomes:
NonCore:
- Describe the ring of integers of a number field and explain why unique prime factorization of elements may fail [Familiarity]
- Compute the class group and unit group of quadratic number fields using Minkowski's bound [Usage]
- Apply the factorization of ideals in Dedekind domains to solve Diophantine equations [Assessment]
4.2.9. ANT/Representation Theory ↑ Back to top
Representations of finite groups, characters, Schur's lemma, the character table, and applications to physics and combinatorics.
Topics:
Non Core
- Linear representations of groups: definitions, subrepresentations, and direct sums
- Schur's lemma, irreducible representations, and Maschke's theorem
- Characters, character tables, orthogonality relations, and the number of irreducible representations
- Induced representations, Frobenius reciprocity, and Mackey's theorem
- Applications to physics (molecular symmetry), combinatorics, and modular representation theory
Learning Outcomes:
NonCore:
- Explain Schur's lemma and Maschke's theorem and their role in decomposing representations [Familiarity]
- Construct the character table of a finite group and verify orthogonality relations [Usage]
- Apply representation theory to determine the vibrational modes of a symmetric molecule [Assessment]
4.2.10. ANT/Cryptography and Coding Theory (Core Tier1: 1 hr, Core Tier2: 1 hr) ↑ Back to top
Mathematical foundations of modern cryptography and error-correcting codes, including RSA, elliptic curves, and linear codes.
Topics:
Core
- Modular arithmetic, the RSA cryptosystem, and discrete logarithm problem
- Elliptic curves over finite fields and elliptic curve cryptography (ECC)
- Linear codes: generator and parity-check matrices, Hamming distance, and error correction
- Cyclic codes: polynomial representation, BCH codes, and Reed-Solomon codes
Non Core
- Post-quantum cryptography: lattice-based schemes and the Learning With Errors (LWE) problem
Learning Outcomes:
Core:
- Explain the mathematical hardness assumptions underlying RSA and elliptic curve cryptography [Familiarity]
- Construct a linear code, compute its parameters, and determine its error-correction capability [Usage]
NonCore:
- Analyze the security assumptions of lattice-based cryptographic schemes in the post-quantum context [Assessment]