0% found this document useful (0 votes)
14 views2 pages

MA Mathematics: Calculus

Uploaded by

sourav ganguly
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
14 views2 pages

MA Mathematics: Calculus

Uploaded by

sourav ganguly
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MA Mathematics

Calculus: Functions of two or more variables, continuity, directional derivatives, partial derivatives,
total derivative, maxima and minima, saddle point, method of Lagrange’s multipliers; Double and
Triple integrals and their applications to area, volume and surface area; Vector Calculus: gradient,
divergence and curl, Line integrals and Surface integrals, Green’s theorem, Stokes’ theorem, and
Gauss divergence theorem.

Linear Algebra: Finite dimensional vector spaces over real or complex fields; Linear
transformations and their matrix representations, rank and nullity; systems of linear equations,
characteristic polynomial, eigenvalues and eigenvectors, diagonalization, minimal polynomial,
Cayley-Hamilton Theorem, Finite dimensional inner product spaces, Gram-Schmidt
orthonormalization process, symmetric, skew-symmetric, Hermitian, skew-Hermitian, normal,
orthogonal and unitary matrices; diagonalization by a unitary matrix, Jordan canonical form;
bilinear and quadratic forms.

Real Analysis: Metric spaces, connectedness, compactness, completeness; Sequences and series
of functions, uniform convergence, Ascoli-Arzela theorem; Weierstrass approximation theorem;
contraction mapping principle, Power series; Differentiation of functions of several variables,
Inverse and Implicit function theorems; Lebesgue measure on the real line, measurable functions;
Lebesgue integral, Fatou’s lemma, monotone convergence theorem, dominated convergence
theorem.

Complex Analysis: Functions of a complex variable: continuity, differentiability, analytic functions,


harmonic functions; Complex integration: Cauchy’s integral theorem and formula; Liouville’s
theorem, maximum modulus principle, Morera’s theorem; zeros and singularities; Power series,
radius of convergence, Taylor’s series and Laurent’s series; Residue theorem and applications for
evaluating real integrals; Rouche’s theorem, Argument principle, Schwarz lemma; Conformal
mappings, Mobius transformations.

Ordinary Differential Equations: First order ordinary differential equations, existence and
uniqueness theorems for initial value problems, linear ordinary differential equations of higher order
with constant coefficients; Second order linear ordinary differential equations with variable
coefficients; Cauchy-Euler equation, method of Laplace transforms for solving ordinary differential
equations, series solutions (power series, Frobenius method); Legendre and Bessel functions and
their orthogonal properties; Systems of linear first order ordinary differential equations, Sturm's
oscillation and separation theorems, Sturm-Liouville eigenvalue problems, Planar autonomous
systems of ordinary differential equations: Stability of stationary points for linear systems with
constant coefficients, Linearized stability, Lyapunov functions.

Algebra: Groups, subgroups, normal subgroups, quotient groups, homomorphisms,


automorphisms; cyclic groups, permutation groups, Group action, Sylow’s theorems and their
applications; Rings, ideals, prime and maximal ideals, quotient rings, unique factorization domains,
Principle ideal domains, Euclidean domains, polynomial rings, Eisenstein’s irreducibility criterion;
Fields, finite fields, field extensions, algebraic extensions, algebraically closed fields

Functional Analysis: Normed linear spaces, Banach spaces, Hahn-Banach theorem, open mapping
and closed graph theorems, principle of uniform boundedness; Inner-product spaces, Hilbert
spaces, orthonormal bases, projection theorem, Riesz representation theorem, spectral theorem
for compact self-adjoint operators.
Numerical Analysis: Systems of linear equations: Direct methods (Gaussian elimination, LU
decomposition, Cholesky factorization), Iterative methods (Gauss-Seidel and Jacobi) and their
convergence for diagonally dominant coefficient matrices; Numerical solutions of nonlinear
equations: bisection method, secant method, Newton-Raphson method, fixed point iteration;
Interpolation: Lagrange and Newton forms of interpolating polynomial, Error in polynomial
interpolation of a function; Numerical differentiation and error, Numerical integration: Trapezoidal
and Simpson rules, Newton-Cotes integration formulas, composite rules, mathematical errors
involved in numerical integration formulae; Numerical solution of initial value problems for ordinary
differential equations: Methods of Euler, Runge-Kutta method of order 2.

Partial Differential Equations: Method of characteristics for first order linear and quasilinear partial
differential equations; Second order partial differential equations in two independent variables:
classification and canonical forms, method of separation of variables for Laplace equation in
Cartesian and polar coordinates, heat and wave equations in one space variable; Wave equation:
Cauchy problem and d'Alembert formula, domains of dependence and influence, non-
homogeneous wave equation; Heat equation: Cauchy problem; Laplace and Fourier transform
methods.

Topology: Basic concepts of topology, bases, subbases, subspace topology, order topology,
product topology, quotient topology, metric topology, connectedness, compactness, countability
and separation axioms, Urysohn’s Lemma.

Linear Programming: Linear programming models, convex sets, extreme points; Basic feasible
solution, graphical method, simplex method, two phase methods, revised simplex method ;
Infeasible and unbounded linear programming models, alternate optima; Duality theory, weak
duality and strong duality; Balanced and unbalanced transportation problems, Initial basic feasible
solution of balanced transportation problems (least cost method, north-west corner rule, Vogel’s
approximation method); Optimal solution, modified distribution method; Solving assignment
problems, Hungarian method.

Common questions

Powered by AI

The method of characteristics transforms a first-order partial differential equation (PDE) into ordinary differential equations along characteristic curves where solutions can be directly integrated. For a PDE of the form a(x, y)u_x + b(x, y)u_y = c(x, y), characteristics are curves defined by dy/dx = b/a. Along these curves, the problem reduces to a set of ODEs that can be solved independently, allowing the construction of an integral surface as a combination of characteristic curves. This method simplifies the resolution of complex PDEs by leveraging solutions of simpler, ordinary equations .

The spectral theorem for compact self-adjoint operators in Hilbert spaces is significant because it extends the concept of diagonalization from finite-dimensional spaces to infinite-dimensional settings. It states that any compact self-adjoint operator can be expressed as a convergent series of orthogonal projections weighted by eigenvalues. This allows one to express the operator in terms of its action on simple, orthogonal building blocks, making it possible to analyze its spectral properties and, therefore, its impact on the Hilbert space. It is crucial in quantum mechanics and PDEs, where it helps in understanding the stability and behavior of solutions .

The method of Lagrange's multipliers is used to find the extrema of a function subject to a constraint by introducing a new variable, the Lagrange multiplier. For a function f(x, y) subject to a constraint g(x, y) = 0, the method involves forming the Lagrangian function L(x, y, λ) = f(x, y) + λ(g(x, y) − c), where c is a constant. The extrema points are then found by solving the system of equations ∇L = 0, which includes the gradient equations ∇f(x, y) = λ∇g(x, y) and the constraint g(x, y) = 0 .

The Hahn-Banach theorem is fundamental in functional analysis as it extends a bounded linear functional defined on a subspace of a normed space to the entire space without increasing its norm. The theorem allows for the separation of points and provides the existence of non-trivial functionals, which is crucial in dual space theory. Its implications are sweeping, playing a significant role in proving other results like the open mapping and closed graph theorems, thus underpinning much of the modern functional analysis framework .

Legendre and Bessel functions are solutions to specific types of differential equations often encountered in physics and engineering. Legendre functions solve Legendre's differential equation, frequently appearing in spherical coordinates problems. They possess orthogonality properties over specific intervals under certain weight functions, crucial for generating solutions in series form. Bessel functions solve Bessel's differential equation, common in cylindrical coordinates, and also exhibit orthogonal properties, making them indispensable in expansions of solutions in problems with cylindrical symmetry. These properties enable them to form bases for function spaces needed to systematically tackle boundary value problems .

Rouche's theorem is a powerful tool in complex analysis for determining the number of zeros inside a closed contour. The theorem states that if two holomorphic functions, f and g, satisfy |f(z) + g(z)| < |f(z)| on a simple closed contour C, then f and f + g have the same number of zeros inside C. This implies that small perturbations in a holomorphic function do not change the number of zeros within a contour, allowing us to count zeros indirectly by comparing with a simpler function. This has significant implications in the study of stability and bifurcations in dynamical systems .

The Weierstrass approximation theorem states that any continuous real-valued function defined on a closed interval [a, b] can be uniformly approximated to any desired degree of accuracy by a polynomial function. This means that for every ε > 0, there exists a polynomial P(x) such that for all x in [a, b], |f(x) - P(x)| < ε. This theorem facilitates the approximation process by providing a constructive basis that guarantees the ability to approximate complex functions with simple polynomial expressions, thus simplifying analysis and computation in various applications .

The Sylow theorems provide crucial insights into the structure of finite groups by describing the number and structure of p-subgroups (Sylow p-subgroups) for a given prime p dividing the order of the group. The first Sylow theorem guarantees the existence of at least one Sylow p-subgroup. The second theorem establishes that all Sylow p-subgroups are conjugate, hence isomorphic, which greatly restricts the possible configurations of subgroups. The third theorem describes the number of such subgroups and ensures that it divides the group's order. These theorems are fundamental in classifying finite groups and predicting their properties .

The Gram-Schmidt process is a method for producing an orthonormal basis from a set of vectors in an inner product space. Starting with a basis {v_1, v_2, ..., v_n}, the process iteratively applies orthogonalization and normalization steps. For each vector, subtract projections onto previously found orthonormal vectors and normalize the resulting vector. This process transforms the original basis into a set of orthonormal vectors, maintaining span equivalency. The significance lies in simplifying many computations, such as in solving linear equations, by converting a basis into a form where orthogonality aids in faster and more numerically stable solutions .

Green's theorem establishes a fundamental connection between a line integral around a simple closed curve C and a double integral over the plane region D bounded by C. It states that the line integral of a vector field F around C is equal to the double integral of the curl of F over the region D, i.e., \( \int_C \mathbf{F} \cdot d\mathbf{r} = \int \int_D ( \partial N / \partial x - \partial M / \partial y ) \, dA \). The theorem is significant because it provides a method to convert a complex line integral problem into a simpler double integral problem over an area, allowing for easier computation and insights into fluid dynamics and other applications in physics and engineering .

You might also like