Comprehensive Study Notes: NCERT Mathematics Textbook for Class XI
Foreword and Educational Philosophy of NCF 2005
Linkage to Life Outside School: The National Curriculum Framework (NCF) 2005 recommends connecting a child's school life to their life outside school to bridge the gap between school, home, and community.
Discouraging Rote Learning: Syllabi and textbooks are designed to discourage rote learning and maintain the fluidity between different subject areas.
Child-Centred Education: The framework builds upon the National Policy on Education (1986), shifting towards a system where children generate knowledge by engaging with information rather than being passive receivers.
Rationalisation of Content: In response to the COVID-19 pandemic and the National Education Policy 2020, content was rationalized to reduce load and promote experiential learning. Criteria included:
* Overlapping content with other subjects.
* Content included in lower or higher classes.
* Difficulty level and accessibility for self-learning.
* Irrelevance to current contexts.
Chapter 1: Sets
Introduction: The theory of sets was developed by the German mathematician Georg Cantor (1845–1918) while working on "problems on trigonometric series."
Definition: A set is a well-defined collection of objects. Objects, elements, and members are synonymous terms. Sets are typically denoted by capital letters (A,B,C) and elements by small letters (a,b,c).
Standard Mathematical Sets:
* N: Set of all natural numbers.
* Z: Set of all integers.
* Q: Set of all rational numbers.
* R: Set of real numbers.
* Z+: Set of positive integers.
* Q+: Set of positive rational numbers.
* R+: Set of positive real numbers.
Representations of Sets:
* Roster or Tabular Form: All elements are listed, separated by commas, and enclosed in braces ({}). Order is immaterial and elements are generally not repeated (e.g., the word SCHOOL is represented as {S,C,H,O,L}).
* Set-builder Form: Elements possess a single common property. Written as V={x:x is a vowel in English alphabet}. The colon ":" stands for "such that."
Types of Sets:
* Empty Set (Null or Void Set): A set containing no elements, denoted by ϕ or {}.
* Finite and Infinite Sets: A set is finite if it is empty or consists of a definite number of elements (n(S) is a natural number). Otherwise, it is infinite.
* Equal Sets: Two sets A and B are equal (A=B) if they have exactly the same elements.
Subsets:
* Definition:A⊂B if every element of A is also an element of B. Symbolically: a∈A⇒a∈B.
* Proper Subset: If A⊂B and A=B, then A is the proper subset and B is the superset.
* Intervals as Subsets of R:
* Open Interval: (a,b)={y:a<y<b}.
* Closed Interval: [a,b]={x:a≤x≤b}.
* Semi-open/Closed: [a,b) and (a,b].
* Universal Set (U): The basic set relevant to a particular context from which all subsets are derived.
Venn Diagrams: Relationships represented by rectangles (Universal set) and closed curves/circles (Subsets).
Operations on Sets:
* Union (A∪B): Elements in A or B or both. A∪B={x:x∈A or x∈B}.
* Intersection (A∩B): Elements common to both. A∩B={x:x∈A and x∈B}.
* Disjoint Sets: If A∩B=ϕ.
* Difference (A−B): Elements in A but not in B.
Complement of a Set (A′): Let U be the universal set. A′={x:x∈U and x∈/A}. Note that A′=U−A.
De Morgan’s Laws:
* (A∪B)′=A′∩B′
* (A∩B)′=A′∪B′
Chapter 2: Relations and Functions
Cartesian Product of Sets: Given non-empty sets P and Q, P×Q={(p,q):p∈P,q∈Q}. If n(A)=p and n(B)=q, then n(A×B)=pq.
Relations: A relation R from set A to set B is a subset of the Cartesian product A×B.
* Domain: The set of all first elements of the ordered pairs in a relation.
* Range: The set of all second elements.
* Codomain: The entire set B. Note that Range ⊂ Codomain.
* Total number of relations: If n(A)=p and n(B)=q, there are 2pq relations.
Functions: A relation f from A to B where every element of A has exactly one image in B.
* Real Valued Function: Range is R or a subset of R.
* Real Function: Both domain and range are subsets of R.
Specific Functions and Graphs:
* Identity Function:f(x)=x. Domain and Range = R. Graph is a line through origin.
* Constant Function:f(x)=c.
* Polynomial Function:f(x)=a0+a1x+a2x2+...+anxn.
* Rational Function:f(x)/g(x) where g(x)=0.
* Modulus Function:f(x)=∣x∣={x,−x,x≥0x<0.
* Signum Function:f(x)=⎩⎨⎧1,0,−1,x>0x=0x<0. Range is {−1,0,1}.
* Greatest Integer Function:f(x)=[x], the greatest integer less than or equal to x. (e.g., [2.3]=2, [−1.1]=−2).
Algebra of Real Functions:
* (f+g)(x)=f(x)+g(x)
* (f−g)(x)=f(x)−g(x)
* (fg)(x)=f(x)g(x)
* (f/g)(x)=f(x)/g(x),g(x)=0
Chapter 3: Trigonometric Functions
Angles: Measure of rotation of a ray from initial side to terminal side. Anticlockwise is positive; clockwise is negative.
Measuring Units:
* Degree Measure:1∘=60′ (minutes), 1′=60′′ (seconds).
* Radian Measure: Angle subtended at the centre by an arc of length 1 unit in a unit circle. Relation: l=rθ (θ in radians).
Argand Plane: Geometrical representation where x-axis is the real axis and y-axis is the imaginary axis.
Chapter 5: Linear Inequalities
Definition: Two real numbers or algebraic expressions related by symbols <,>,≤,≥.
Rules for Solving:
* Rule 1: Equal numbers may be added to or subtracted from both sides without changing the inequality sign.
* Rule 2: Both sides can be multiplied/divided by a positive number. Crucial: If multiplied/divided by a negative number, the sign is reversed (e.g., if 3>2 then −3<−2).
Graphical Representation: On a number line, a strict inequality (<,>) uses a hollow circle; a slack inequality (≤,≥) uses a dark circle.
Chapter 6: Permutations and Combinations
Fundamental Principle of Counting: If one event occurs in m ways and a second in n ways, the total occurrences in that order is m×n.
Factorial Notation:n!=1×2×3×...×n. Note 0!=1.
Permutations (nPr): Arrangement in a definite order.
* Formula: nPr=(n−r)!n!,0≤r≤n.
* When objects are not distinct: p1!p2!...pk!n!.
Combinations (nCr): Selection where order does NOT matter.
* Formula: nCr=r!(n−r)!n!.
* Relation: nPr=nCr×r!.
* Identity: nCr+nCr−1=n+1Cr.
Chapter 7: Binomial Theorem
Theorem: For any positive integer n, (a+b)n=nC0an+nC1an−1b+nC2an−2b2+...+nCnbn.
Pascal’s Triangle: A triangular array of binomial coefficients. Each interior number is the sum of the two numbers directly above it.
Observations:
* Total terms = n+1.
* Sum of indices of a and b in each term = n.
Chapter 8: Sequences and Series
Sequence: A function whose domain is the set of natural numbers. Terms are denoted a1,a2,...,an.
Series: The indicated sum of terms of a sequence (a1+a2+...+an).
Geometric Progression (G.P.): A sequence where each term (except the first) bears a constant ratio (r) to the preceding term.
* General term: an=arn−1.
* Sum of n terms: Sn=1−ra(1−rn) or Sn=r−1a(rn−1) if r=1.
Arithmetic Mean (A.M.) and Geometric Mean (G.M.):
* A.M.=(a+b)/2; G.M.=ab.
* Relation: A≥G.
Chapter 9: Straight Lines
Slope (m):m=tanθ where θ is inclination. Slope through points (x1,y1) and (x2,y2) is m=x2−x1y2−y1.
Parallel and Perpendicular Lines:
* Parallel: m1=m2.
* Perpendicular: m1m2=−1.
Angle between Two Lines:tanθ=1+m1m2m2−m1.
Equations of Line:
* Point-slope: y−y0=m(x−x0).
* Two-point: y−y1=x2−x1y2−y1(x−x1).
* Slope-intercept: y=mx+c (where c is y-intercept).
* Intercept form: ax+by=1.
* General Equation: Ax+By+C=0.
Distance Formulas:
* Point (x1,y1) to line Ax+By+C=0: d=A2+B2∣Ax1+By1+C∣.
* Distance between parallel lines: d=A2+B2∣C1−C2∣.
Chapter 10: Conic Sections
Sections of a Cone: Intersections of a plane with a double-napped right circular cone result in circle, ellipse, parabola, or hyperbola.
Circle: Set of points equidistant from a fixed point. Equation: (x−h)2+(y−k)2=r2.
Parabola: Set of points equidistant from a fixed line (directrix) and a fixed point (focus). Standard form: y2=4ax. Latus rectum = 4a.
Ellipse: Sum of distances from two foci is constant (2a). Standard: a2x2+b2y2=1. Relation: c2=a2−b2. Eccentricity e=c/a<1.
Hyperbola: Difference of distances from two foci is constant (2a). Standard: a2x2−b2y2=1. Relation: c2=a2+b2. Eccentricity e=c/a>1.
Chapter 11: Three Dimensional Geometry
Coordinate System: Three mutually perpendicular axes (x,y,z) intersecting at origin (0,0,0).
Octants: The coordinate planes divide space into eight parts (Octants I to VIII).
Limits:L is the limit of f(x) as x→a if the left hand limit and right hand limit coincide.
Special Limits:
* limx→ax−axn−an=nan−1.
* limx→0xsinx=1.
* limx→0x1−cosx=0.
Derivatives: Measure of rate of change. First principle: f′(x)=limh→0hf(x+h)−f(x).
* Rule: dxd(xn)=nxn−1.
* Product Rule: (uv)′=u′v+uv′.
* Quotient Rule: (vu)′=v2u′v−uv′.
Chapter 13: Statistics
Measures of Central Tendency: Mean (xˉ), Median (M), Mode.
Measures of Dispersion:
* Range: Max value - Min value.
* Mean Deviation (M.D.):M.D.(xˉ)=n∑∣xi−xˉ∣.
* Variance (σ2): Mean of the squares of deviations from the mean. σ2=n∑(xi−xˉ)2.
* Standard Deviation (σ): Positive square root of variance.
Chapter 14: Probability
Event: Any subset of a sample space S.
* Impossible Event:ϕ.
* Sure Event: Set S.
* Simple Event: One sample point.
* Compound Event: More than one sample point.
Mutually Exclusive Events: If A∩B=ϕ; they cannot occur simultaneously.