🇮🇳 CSIR NET Mathematical Science · subject
CSIR NET Mathematical Science UNIT – 1 Syllabus
The UNIT – 1 syllabus for CSIR NET Mathematical Science in full: 2 chapters, 21 topics and 25 sub-topics, every one listed below, plus 51 UNIT – 1 flashcards with answers.
UNIT – 1 syllabus: all 2 chapters
Expand any chapter to see its topics and sub-topics.
-
Analysis
15 topics- Elementary set theory
- Finite, countable and uncountable sets
- Real number system as a complete ordered field
- Archimedean property
- supremum
- infimum
- Sequences and series
- convergence
- limsup
- liminf
- Bolzano Weierstrass theorem
- Heine Borel theorem
- Continuity
- uniform continuity
- Differentiability
- mean value theorem
- Sequences and series of functions
- uniform convergence
- Riemann sums and Riemann integral
- Improper Integrals
- Monotonic functions
- Types of discontinuity
- Functions of bounded variation
- Lebesgue measure
- Lebesgue integral
-
Linear Algebra
6 topics- Vector spaces
- subspaces
- linear dependence
- basis
- dimension
- algebra of linear transformations
- Algebra of matrices
- rank and determinant of matrices
- linear equations
- Eigenvalues and eigenvectors
- Cayley-Hamilton theorem
- Matrix representation of linear transformations
- Change of basis
- canonical forms
- diagonal forms
- triangular forms
- Jordan forms
- Inner product spaces
- orthonormal basis
- Quadratic forms
- reduction and classification of quadratic forms
- Vector spaces
CSIR NET Mathematical Science UNIT – 1 flashcards — 51 questions with answers
In elementary set theory, state De Morgan's laws for the complement of a union and an intersection of sets $A$ and $B$.
$(A \cup B)^{c} = A^{c} \cap B^{c}$ and $(A \cap B)^{c} = A^{c} \cup B^{c}$.
Define a countable set and distinguish countably infinite from finite.
A set is countable if it is finite or there is a bijection with $\mathbb{N}$. If the bijection with $\mathbb{N}$ exists it is countably infinite; otherwise (a finite bijection with $\{1,\dots,n\}$) it is finite.
Is the set of rational numbers $\mathbb{Q}$ countable or uncountable, and what is a key consequence for $\mathbb{R}$?
$\mathbb{Q}$ is countable. Since $\mathbb{R}$ is uncountable, the irrationals $\mathbb{R}\setminus\mathbb{Q}$ are uncountable.
State Cantor's diagonal argument conclusion about the interval $[0,1]$.
The interval $[0,1]$ (and hence $\mathbb{R}$) is uncountable: no surjection $f:\mathbb{N}\to[0,1]$ exists, shown by constructing a number differing from $f(n)$ in its $n$-th decimal digit.
Give the cardinality relationship (Cantor's theorem) between a set $A$ and its power set $\mathcal{P}(A)$.
$|A| < |\mathcal{P}(A)|$ always; there is no surjection from $A$ onto $\mathcal{P}(A)$. For finite $A$, $|\mathcal{P}(A)| = 2^{|A|}$.
Is a countable union of countable sets countable?
Yes. A countable union of countable sets is countable (using the axiom of choice).
What does it mean that $\mathbb{R}$ is a complete ordered field?
$\mathbb{R}$ is a field with a compatible total order, and it satisfies the completeness (least upper bound) axiom: every nonempty subset bounded above has a supremum in $\mathbb{R}$.
Define the supremum (least upper bound) of a nonempty set $S \subseteq \mathbb{R}$ bounded above.
$\sup S = M$ where (i) $M$ is an upper bound: $x \leq M$ for all $x \in S$, and (ii) $M$ is least: for every $\varepsilon > 0$ there exists $x \in S$ with $x > M - \varepsilon$.
Define the infimum (greatest lower bound) of a nonempty set $S \subseteq \mathbb{R}$ bounded below.
$\inf S = m$ where (i) $m$ is a lower bound: $x \geq m$ for all $x \in S$, and (ii) for every $\varepsilon > 0$ there exists $x \in S$ with $x < m + \varepsilon$.
State the Archimedean property of $\mathbb{R}$.
For any real numbers $x > 0$ and $y$, there exists $n \in \mathbb{N}$ such that $nx > y$. Equivalently, $\mathbb{N}$ is unbounded above and $\inf\{1/n : n \in \mathbb{N}\} = 0$.
What property of $\mathbb{Q}$ in $\mathbb{R}$ follows from the Archimedean property?
Density: between any two reals $a < b$ there exists a rational number $q$ with $a < q < b$ (and also an irrational).
Define convergence of a sequence $(a_n)$ to a limit $L$ (epsilon definition).
$a_n \to L$ means: for every $\varepsilon > 0$ there exists $N \in \mathbb{N}$ such that for all $n \geq N$, $|a_n - L| < \varepsilon$.
State the Monotone Convergence Theorem for sequences.
Every monotone (increasing or decreasing) sequence that is bounded converges. An increasing bounded sequence converges to its supremum; a decreasing bounded sequence to its infimum.
Define a Cauchy sequence and state its relation to convergence in $\mathbb{R}$.
$(a_n)$ is Cauchy if for every $\varepsilon > 0$ there is $N$ with $|a_m - a_n| < \varepsilon$ for all $m,n \geq N$. In $\mathbb{R}$ (complete), a sequence converges iff it is Cauchy.
Define $\limsup_{n\to\infty} a_n$ for a real sequence.
$\limsup_{n\to\infty} a_n = \lim_{n\to\infty}\Big(\sup_{k \geq n} a_k\Big) = \inf_{n}\sup_{k\geq n} a_k$, the largest subsequential limit.
Define $\liminf_{n\to\infty} a_n$ for a real sequence.
$\liminf_{n\to\infty} a_n = \lim_{n\to\infty}\Big(\inf_{k \geq n} a_k\Big) = \sup_{n}\inf_{k\geq n} a_k$, the smallest subsequential limit.
State the criterion relating $\limsup$, $\liminf$ to convergence.
A sequence $(a_n)$ converges to $L$ (in the extended reals) iff $\liminf a_n = \limsup a_n = L$. Always $\liminf a_n \leq \limsup a_n$.
State the Bolzano-Weierstrass theorem.
Every bounded sequence in $\mathbb{R}$ (or $\mathbb{R}^n$) has a convergent subsequence. Equivalently, every bounded infinite subset of $\mathbb{R}$ has a limit point.
State the Heine-Borel theorem for $\mathbb{R}^n$.
A subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded.
State the $n$-th term test (divergence test) for a series $\sum a_n$.
If $\sum a_n$ converges then $a_n \to 0$. Contrapositive: if $a_n \not\to 0$, the series diverges. (The converse is false, e.g. $\sum 1/n$.)
Show the other 31 UNIT – 1 flashcards
State the Ratio Test for the series $\sum a_n$.
Let $L = \lim_{n\to\infty}\left|\frac{a_{n+1}}{a_n}\right|$. If $L < 1$ the series converges absolutely; if $L > 1$ (or $\infty$) it diverges; if $L = 1$ the test is inconclusive.
State the Root Test for the series $\sum a_n$.
Let $L = \limsup_{n\to\infty}\sqrt[n]{|a_n|}$. If $L < 1$ converges absolutely; if $L > 1$ diverges; if $L = 1$ inconclusive.
For which values of $p$ does the $p$-series $\sum_{n=1}^{\infty} \frac{1}{n^{p}}$ converge?
It converges if and only if $p > 1$, and diverges for $p \leq 1$.
State the Leibniz (alternating series) test.
If $b_n \geq 0$ is decreasing with $b_n \to 0$, then the alternating series $\sum (-1)^{n} b_n$ converges. Also the remainder is bounded by the first omitted term.
Distinguish absolute convergence from conditional convergence of a series.
$\sum a_n$ converges absolutely if $\sum |a_n|$ converges. It converges conditionally if $\sum a_n$ converges but $\sum |a_n|$ diverges (e.g. $\sum (-1)^n/n$). Absolute convergence implies convergence.
Give the formula for the sum of a convergent geometric series and its convergence condition.
For $|r| < 1$, $\sum_{n=0}^{\infty} a r^{n} = \frac{a}{1-r}$. It diverges for $|r| \geq 1$.
State the epsilon-delta definition of continuity of $f$ at a point $c$.
$f$ is continuous at $c$ if for every $\varepsilon > 0$ there exists $\delta > 0$ such that $|x - c| < \delta \implies |f(x) - f(c)| < \varepsilon$.
State the Intermediate Value Theorem.
If $f$ is continuous on $[a,b]$ and $k$ lies between $f(a)$ and $f(b)$, then there exists $c \in [a,b]$ with $f(c) = k$.
State the Extreme Value Theorem.
If $f$ is continuous on a closed bounded interval $[a,b]$, then $f$ attains a maximum and a minimum value on $[a,b]$.
Define uniform continuity of $f$ on a set $S$ and contrast it with ordinary continuity.
$f$ is uniformly continuous on $S$ if for every $\varepsilon > 0$ there is a single $\delta > 0$ such that for all $x,y \in S$, $|x-y| < \delta \implies |f(x)-f(y)| < \varepsilon$. The $\delta$ does not depend on the point, unlike ordinary continuity.
State the theorem linking continuity on a compact set to uniform continuity.
If $f$ is continuous on a compact set (e.g. a closed bounded interval $[a,b]$), then $f$ is uniformly continuous there (Heine-Cantor theorem).
Give an example showing continuity does not imply uniform continuity, and identify why.
$f(x) = \frac{1}{x}$ on $(0,1)$ is continuous but not uniformly continuous; the required $\delta$ shrinks to $0$ as $x \to 0^{+}$. Also $f(x)=x^2$ on $\mathbb{R}$ is continuous but not uniformly continuous.
Define differentiability of $f$ at a point $c$.
$f$ is differentiable at $c$ if $f'(c) = \lim_{h\to 0} \frac{f(c+h) - f(c)}{h}$ exists (finitely).
State the relationship between differentiability and continuity.
If $f$ is differentiable at $c$, then $f$ is continuous at $c$. The converse is false (e.g. $f(x)=|x|$ at $x=0$).
State Rolle's theorem.
If $f$ is continuous on $[a,b]$, differentiable on $(a,b)$, and $f(a) = f(b)$, then there exists $c \in (a,b)$ with $f'(c) = 0$.
State the (Lagrange) Mean Value Theorem.
If $f$ is continuous on $[a,b]$ and differentiable on $(a,b)$, then there exists $c \in (a,b)$ such that $f'(c) = \frac{f(b) - f(a)}{b - a}$.
State Cauchy's Mean Value Theorem (generalized MVT).
If $f,g$ are continuous on $[a,b]$, differentiable on $(a,b)$, and $g'\neq 0$ on $(a,b)$, then there exists $c \in (a,b)$ with $\frac{f'(c)}{g'(c)} = \frac{f(b)-f(a)}{g(b)-g(a)}$.
State Taylor's theorem with the Lagrange form of the remainder.
$f(x) = \sum_{k=0}^{n} \frac{f^{(k)}(a)}{k!}(x-a)^{k} + R_n$, where $R_n = \frac{f^{(n+1)}(\xi)}{(n+1)!}(x-a)^{n+1}$ for some $\xi$ between $a$ and $x$.
How does the sign of $f'$ classify monotonicity of $f$ on an interval?
If $f' > 0$ on an interval, $f$ is strictly increasing there; if $f' < 0$, strictly decreasing; if $f' = 0$ throughout, $f$ is constant.
Define pointwise convergence of a sequence of functions $(f_n)$ to $f$ on a set $E$.
$f_n \to f$ pointwise on $E$ if for each $x \in E$ and each $\varepsilon > 0$ there is $N$ (depending on $x$) with $|f_n(x) - f(x)| < \varepsilon$ for all $n \geq N$.
Define uniform convergence of $(f_n)$ to $f$ on a set $E$.
$f_n \to f$ uniformly on $E$ if for every $\varepsilon > 0$ there is $N$ (independent of $x$) with $|f_n(x) - f(x)| < \varepsilon$ for all $n \geq N$ and all $x \in E$. Equivalently $\sup_{x\in E}|f_n(x)-f(x)| \to 0$.
State the theorem on uniform convergence preserving continuity.
If each $f_n$ is continuous on $E$ and $f_n \to f$ uniformly on $E$, then the limit $f$ is continuous on $E$.
State the theorem on interchanging limit and integral under uniform convergence.
If $f_n \to f$ uniformly on $[a,b]$ and each $f_n$ is integrable, then $\int_a^b f_n \to \int_a^b f$, i.e. $\lim_n \int_a^b f_n = \int_a^b \lim_n f_n$.
State the theorem for term-by-term differentiation of $(f_n)$.
If $f_n \to f$ pointwise on $[a,b]$, each $f_n$ is differentiable, and $f_n'$ converges uniformly to $g$, then $f$ is differentiable and $f' = g$ (i.e. $\lim f_n' = (\lim f_n)'$).
State the Weierstrass M-test for uniform convergence of $\sum f_n$.
If $|f_n(x)| \leq M_n$ for all $x \in E$ and $\sum M_n$ converges, then $\sum f_n$ converges uniformly (and absolutely) on $E$.
State the Cauchy criterion for uniform convergence of $(f_n)$.
$(f_n)$ converges uniformly on $E$ iff for every $\varepsilon > 0$ there is $N$ such that $\sup_{x\in E}|f_m(x) - f_n(x)| < \varepsilon$ for all $m,n \geq N$.
Give an example where pointwise convergence fails to preserve continuity.
$f_n(x) = x^{n}$ on $[0,1]$ converges pointwise to $f(x)=0$ for $x\in[0,1)$ and $f(1)=1$, a discontinuous limit; convergence is not uniform.
State the Comparison Test for series of nonnegative terms.
If $0 \leq a_n \leq b_n$: if $\sum b_n$ converges then $\sum a_n$ converges; if $\sum a_n$ diverges then $\sum b_n$ diverges.
State the Integral Test for convergence of a series.
If $f$ is positive, continuous, and decreasing on $[1,\infty)$ with $f(n)=a_n$, then $\sum_{n=1}^\infty a_n$ converges iff $\int_1^\infty f(x)\,dx$ converges.
Give the formula for the radius of convergence $R$ of a power series $\sum a_n x^n$.
$\frac{1}{R} = \limsup_{n\to\infty}\sqrt[n]{|a_n|}$ (Cauchy-Hadamard). The series converges absolutely for $|x| < R$ and diverges for $|x| > R$.
What is the Nested Interval Property and what completeness fact does it express?
If $I_n = [a_n,b_n]$ are closed bounded intervals with $I_1 \supseteq I_2 \supseteq \cdots$, then $\bigcap_n I_n \neq \emptyset$. If additionally $b_n - a_n \to 0$, the intersection is a single point. It is equivalent to completeness of $\mathbb{R}$.
CSIR NET Mathematical Science UNIT – 1 FAQ
What is in the CSIR NET Mathematical Science UNIT – 1 syllabus?
CSIR NET Mathematical Science UNIT – 1 is split into 2 chapters: Analysis and Linear Algebra. Together they contain 21 topics and 25 sub-topics.
How many chapters are in CSIR NET Mathematical Science UNIT – 1?
2 chapters, containing 21 topics and 25 sub-topics. The largest chapter is Analysis, with 15 topics.
Are there flashcards for CSIR NET Mathematical Science UNIT – 1?
Yes — a 51-card UNIT – 1 deck, printed in full in the flashcards section of this page and available in the Examius app with spaced repetition. The free plan covers one exam of your choice, including its flashcards; Examius Pro, a one-time purchase, unlocks every other exam and deck.