🇮🇳 CSIR NET Mathematical Science · flashcards

CSIR NET Mathematical Science UNIT – 1 Flashcards

51 question-and-answer cards covering UNIT – 1 as it is examined in CSIR NET Mathematical Science. 24 of them are printed below, taken from across the deck — no signup, no paywall on the preview.

51Cards in deck
24Free preview
21Syllabus topics
~154Chars per answer
FreePrice

24 sample cards from the UNIT – 1 deck

Sampled from the end of the deck, so these are different cards from the ones shown on the syllabus page.

  1. 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$.

  2. 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]$.

  3. 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.

  4. 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).

  5. 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.

  6. 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).

  7. 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$).

  8. 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$.

  9. 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}$.

  10. 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)}$.

  11. 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$.

  12. 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.

  13. 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$.

  14. 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$.

  15. 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$.

  16. 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$.

  17. 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)'$).

  18. 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$.

  19. 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$.

  20. 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.

  21. 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.

  22. 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.

  23. 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$.

  24. 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}$.

What this deck covers

The UNIT – 1 deck follows the CSIR NET Mathematical Science UNIT – 1 syllabus — 2 chapters and 21 topics — so questions land on material that is genuinely examinable rather than trivia around it. That works out to roughly 25.5 cards per chapter.

Answers are written to be recallable, not just readable — averaging about 154 characters, which is long enough to carry the reasoning and short enough to say out loud.

A deck like this earns its keep on the second and third pass. Read the syllabus first so you know the shape of the subject, then use the cards to find the specific facts that have not stuck.

UNIT – 1 flashcards FAQ

How many UNIT – 1 flashcards are in this CSIR NET Mathematical Science deck?

51 cards. This page previews 24 of them, sampled evenly across the deck so you can judge the difficulty before installing anything.

Are these CSIR NET Mathematical Science flashcards free?

Yes. The preview here is free to read with no signup, and the full 51-card deck is free inside the Examius app.

What do the UNIT – 1 cards cover?

They follow the CSIR NET Mathematical Science UNIT – 1 syllabus — 2 chapters and 21 topics — so the questions track what is actually examinable.

How should I use these flashcards?

Read the syllabus first so you know the shape of the subject, then drill the deck. Examius schedules each card with spaced repetition, so cards you keep missing come back sooner and ones you know drift further apart.