Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Definitions: Domain, range, and the vertical line test.Function Types: Linear, quadratic, exponential, and logarithmic functions.Operations: Composition of functions and finding inverses.Graphing: Step-by-step instructions for plotting various function transformations.Whether you are studying for a midterm or need a quick reference for homework, these notes summarize everything you need to know about functions in a clear, organized format.
Typology: Study Guides, Projects, Research
1 / 10
This page cannot be seen from the preview
Don't miss anything!
Class XII • CBSE / NCERT Standardized Reference
Comprehensive Theory, Properties, and Analytical Notes
Designed for high-tier academic clarity and Board Examination revision
Structured into exactly 10 comprehensive page intervals for advanced structural learning.
Table of Contents
Prerequisites & Scope: This high-yield manual covers the abstract structures of Chapter 1 (Relations and Functions) for Class 12. Emphasis is placed on structural clarity, explicit mappings, algebraic validations, and proof strategies used in testing environments. Students are expected to understand basic set theory definitions from Class 11.
Relations vary in structure based on their constraints. We begin with extreme boundary conditions: relations that contain no elements or all possible elements.
Definition 1.1: The Empty Relation A relation R in a set A is called an empty relation if no element of A is related to any element of A , implying R = ∅ ⊂ A × A.
Definition 1.2: The Universal Relation A relation R in a set A is called a universal relation if each element of A is related to every element of A , implying R = A × A.
Both the Empty Relation and the Universal Relation represent boundary conditions. For this reason, they are collectively referred to as Trivial Relations within set theory.
Illustrative Example of Trivial Bounds Let A be the set of all students in a boys' school.
The core of Class 12 Relation Theory focuses on evaluating three properties that determine a relation's algebraic consistency.
A relation R defined on a non-empty set A is classified under the following terms:
When evaluating these conditions, watch out for these subtle points:
Reflexive vs. Identity: The identity relation I_A = {(a,a) : a ∈ A} requires only identity pairs to exist. A reflexive relation must contain all identity pairs, but can also contain other pairs like (a, b). Transitive Vacuous Truth: The transitive property states that if (a,b) ∈ R and (b,c) ∈ R are both true, then (a,c) must be in R. If there is no pair where the second element matches another first element, the condition cannot be falsified. Therefore, the relation is considered transitively valid by default (vacuously true).
Functions are a specialized type of relation where every element in the input set maps to exactly one element in the output set.
Definition: A relation f from set X to set Y is defined as a function if every element of set X has one, and only one, image in set Y. We denote this structure as f : X → Y.
For a function f: X → Y , if f(x) = y , then:
y is called the image of x under the mapping f. x is called the pre-image of y under the mapping f.
The Real Number Domain Challenge Consider the function f : ℝ → ℝ defined by f(x) = x².
In Class 12, functions are categorized based on their mapping properties: injectivity (one-to-one) and surjectivity (onto).
Definition 1.4: One-to-One Function (Injection) A function f : X → Y is defined to be one-to-one (or injective) if the images of distinct elements of X under f are distinct. For all x₁, x₂ ∈ X, f(x₁) = f(x₂) ➔ x₁ = x₂
Definition 1.5: Onto Function (Surjection) A function f : X → Y is defined to be onto (or surjective) if every element of Y is the image of at least one element of X under f. This means the Range of f = Codomain Y.
Functions that satisfy both conditions have unique invertible properties:
Bijective Function: A function f : X → Y is classified as bijective if it is simultaneously one-to-one (injective) and onto (surjective).
If a function is not injective, it is classified as Many-to-One. If it is not surjective, it is classified as Into.
This final page acts as an analytical summary of Chapter 1, providing formulas for calculating the number of possible relations and functions.
Mathematical Structure Configuration
Exact Quantitative Formula Limit Variable Definition Bounds
Total Number of Relations 2^(n × n) = 2^(n²) Defined on a single set containing n elements.
Total Reflexive Relations 2^(n² - n) Diagonal identity pairs are fixed; others vary.
Total Symmetric Relations 2^( n(n+1) / 2 ) Determined by choices in the upper triangular matrix.
Total Mapping Functions m^n From a set with^ n^ elements to a set with m elements.
Total Injective Functions ⁿP_m = n! / (n - m)! Valid only when codomain size m ≥ n.
Before completing your study of Chapter 1, ensure you can confidently handle these core tasks:
Can you identify vacuously true transitivity when the pairing chain is incomplete? Can you show how an equivalence relation partitions a set into disjoint equivalence classes? Can you algebraically show injectivity using the condition f(x₁) = f(x₂) ➔ x₁ = x₂? Do you verify that the calculated pre-image x fits within the specified domain restrictions for surjective proofs?
—— End of Class XII Chapter 1 Reference Guide ——
