11th Maths: Ch 02 - Relations and Functions | NCERT Flashcards

Cartesian Product of Sets ( $A \times B$ )

Define the Cartesian Product of two non-empty sets A and B, and state the strict result if one of the sets is empty.

DEFINITION

Definition

The set of all possible ordered pairs where the first element strictly belongs to set $A$ and the second element strictly belongs to set $B$ .

Set-Builder Notation

$A \times B = \{(a,b): a \in A, b \in B\}$

Boundary Condition

If either $A$ or $B$ is the empty set ( $\emptyset$ ), then their Cartesian product is also the empty set: $A \times \emptyset = \emptyset$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Condition for Equality of Ordered Pairs

DEFINITION Formula

(x_1, y_1) = (x_2, y_2) \iff x_1 = x_2 \text{ and } y_1 = y_2

The mathematical condition required for two ordered pairs to be strictly equal.

Derivation

Equality strictly implies $x_1 = x_2$ simultaneously with $y_1 = y_2$ .

Component Anatomy:

$(x_1, y_1)$ & $(x_2, y_2)$ : Two distinct ordered pairs.
Equality: Implies strict position-wise matching of elements.

Boundary Conditions / Domain:

The elements must correspond to the exact same position (first to first, second to second).
The internal ordering is strictly non-commutative. $(a,b) \neq (b,a)$ unless $a=b$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Cardinality of a Cartesian Product

CONCEPT Formula

n(A \times B) = n(A) \cdot n(B) = pq

Calculates the total number of elements in the Cartesian product $A \times B$ , given $n(A) = p$ and $n(B) = q$ .

Derivation

By the Fundamental Principle of Counting:

There are $p$ independent ways to choose the first element.
There are $q$ independent ways to choose the second element.
Total ordered pairs mathematically equals $p \times q$ .

Component Anatomy:

$n(A), n(B)$ : Cardinalities of individual sets.
$n(A \times B)$ : The total number of ordered pairs in the Cartesian product.

Boundary Conditions / Domain:

Sets A and B must be finite.
If either A or B is an infinite set (and the other is non-empty), then $A \times B$ is strictly infinite.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Ordered Triplet ( $A \times A \times A$ )

What is an ordered triplet, and what does the specific Cartesian product $\mathbb{R} \times \mathbb{R} \times \mathbb{R}$ geometrically represent?

CONCEPT

Definition

The Cartesian product of a set with itself three times, yielding a set of ordered triplets.

Set-Builder Notation

$A \times A \times A = \{(a,b,c): a, b, c \in A\}$

Geometric Application

The product $\mathbb{R} \times \mathbb{R} \times \mathbb{R}$ represents the coordinates of all points in three-dimensional space.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Non-Commutativity of the Cartesian Product

Is the Cartesian product of two sets mathematically commutative? If not, what are the only two strict exceptions where $A \times B = B \times A$ ?

DISTINCTION

Concept: The Cartesian product operation is strictly non-commutative. Mathematically, $A \times B \neq B \times A$ .
Reasoning: Ordered pairs are strictly position-dependent. The coordinate pair $(a, b)$ is fundamentally distinct from $(b, a)$ unless $a = b$ .
The Absolute Exceptions: $A \times B = B \times A$ $A \times B = B \times A$ if and only if:
1. Sets $A$ and $B$ are strictly identical sets ( $A = B$ ).
2. At least one of the component sets is the empty set ( $\emptyset$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Mathematical Definition of a Relation

How is a mathematical 'Relation' strictly defined in terms of a Cartesian product?

DEFINITION

Definition: A relation $R$ from a non-empty set $A$ to a non-empty set $B$ is structurally any subset of the Cartesian product $A \times B$ .
Derivation: It is derived by describing a specific mathematical or logical relationship between the first element $x$ and the second element $y$ of the ordered pairs in $A \times B$ .
Notation: If $(x,y) \in R$ , we say $x$ is related to $y$ under $R$ (often written $x R y$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Relation Anatomy: Domain vs. Range vs. Codomain

Differentiate between the Domain, Range, and Codomain of a mathematical relation R from set A to set B.

DISTINCTION

Domain: The set of all first elements $x$ of the ordered pairs that strictly belong to the relation $R$ . (Domain $\subseteq A$ ).
Range: The set of all second elements $y$ (images) of the ordered pairs that strictly belong to $R$ . (Range $\subseteq B$ ).
Codomain: The entirety of set $B$ . The range is always a subset (or equal to) the codomain.
Image/Pre-image: In $(x,y)$ , $y$ is the image of $x$ , and $x$ is the pre-image of $y$ .

Prism Memory Hook

Domain drives first, Range reacts second. Codomain is the entire target board.

Total Number of Possible Relations

APPLICATION Formula

2^{pq}

Calculates the total number of distinct relations possible from a set A of order p to a set B of order q.

Derivation

A relation is simply a subset of $A \times B$ .
The number of elements in $A \times B$ is exactly $p \times q = pq$ .
The total number of subsets of any set with $n$ elements is strictly $2^n$ .
Therefore, total relations = $2^{pq}$ .

Component Anatomy:

$p, q$ : Cardinalities of sets A and B respectively.
$2^{pq}$ : The total possible subset combinations forming unique relations.

Boundary Conditions / Domain:

A and B must strictly be finite sets.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Total Number of Non-Empty Relations

APPLICATION Formula

2^{mn} - 1

Calculates the total number of strictly non-empty relations from a finite set A (order m) to a finite set B (order n).

Derivation

The total number of relations is $2^{mn}$ . Since the empty set $\emptyset$ is considered a valid subset, it forms exactly one 'empty relation'. Subtracting this yields $2^{mn} - 1$ non-empty relations.

Component Anatomy:

$m, n$ : Cardinalities of set A and set B.
$2^{mn}$ : Total possible relations (subsets of $A \times B$ ).
$- 1$ : The exclusion of the strict null relation (empty set).

Boundary Conditions / Domain:

Sets A and B must strictly be finite sets.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Inverse Relation ( $R^{-1}$ )

Define the Inverse Relation $R^{-1}$ and state how its Domain and Range correspond to the original relation R.

DEFINITION

Definition: If $R$ is a relation from set $A$ to set $B$ , its inverse $R^{-1}$ is the relation from $B$ to $A$ obtained by flipping the ordered pairs.
Mathematical Notation: $R^{-1} = \{(b,a): (a,b) \in R\}$ .
Property 1: The Domain of $R^{-1}$ is exactly the Range of $R$ .
Property 2: The Range of $R^{-1}$ is exactly the Domain of $R$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Strict Mathematical Definition of a Function

What are the two strict boundary conditions a relation must satisfy to be mathematically classified as a Function?

DEFINITION

Definition: A relation $f$ from set $A$ to set $B$ is a function if and only if every element of set $A$ has one and only one image in set $B$ .
Condition 1 (Exhaustion): The domain of the function must be the entirety of set $A$ .
Condition 2 (Uniqueness): No two distinct ordered pairs in $f$ can have the same first element.

Prism Memory Hook

Every child (Input) must have exactly one biological mother (Output).

Functions vs. Relations (The Convergence/Divergence Trap)

Explain the difference between 'Many-to-One' and 'One-to-Many' mappings, and state which one strictly violates the definition of a function.

DISTINCTION

Valid Function (Many-to-One): Multiple inputs can share the exact same output (e.g., $f(x) = x^2$ where $f(2)=4$ and $f(-2)=4$ ). This is mathematically permitted.
Invalid Function (One-to-Many): A single input CANNOT produce multiple distinct outputs (e.g., $f(4) = 2$ and $f(4) = -2$ ). This breaks the definition of a function; it is merely a relation.
Vertical Line Test: Graphically, if any vertical line intersects a curve more than once, it fails the function test (One-to-Many).

Prism Memory Hook

Many inputs can CONVERGE to one output. One input CANNOT DIVERGE to many outputs.

Multiplicative Trap in Function Definitions ( $ab, a+b$ )

Mathematically prove via a counter-example why the integer relation $f = \{(ab, a+b)\}$ strictly fails the definition of a function.

DISTINCTION

The Trap: A relation defined as ordered pairs $(ab, a+b)$ for integers $a, b$ looks like a legitimate mathematical mapping formula, but completely fails the strict definition of a function.
Counter-example (NCERT): Let the domain input be $6$ . The integer factors of $6$ could be $a=1, b=6$ or $a=2, b=3$ .
The Failure: If $a=1, b=6$ , the pair mapped is $(6, 7)$ . If $a=2, b=3$ , the pair mapped is $(6, 5)$ .
Conclusion: Since the single isolated input $6$ definitively maps to two entirely distinct outputs ( $7$ and $5$ ), this is a One-to-Many relationship. It is strictly a relation, NOT a function.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Piecewise Definitions: Function vs. Relation Boundary Check

How do you algebraically determine if a continuous piecewise relation is mathematically classified as a function at its boundary points?

DISTINCTION

Concept: When a mapping is defined piecewise, the critical boundary points where the rules switch must yield a mathematically identical output to remain a function.
Example (Function): $f(x) = x^2$ for $0 \le x \le 3$ , and $f(x) = 3x$ for $3 \le x \le 10$ . At the boundary $x=3$ , $3^2 = 9$ and $3(3) = 9$ . It yields a unique image, so it is a valid function.
Example (Relation Only): $g(x) = x^2$ for $0 \le x \le 2$ , and $g(x) = 3x$ for $2 \le x \le 10$ . At the boundary $x=2$ , $2^2 = 4$ but $3(2) = 6$ . A single input yields two distinct outputs, which strictly violates the mathematical definition of a function.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Total Number of Functions

APPLICATION Formula

q^p

Calculates the total number of valid functions that can be mapped from a finite set A (order p) to a finite set B (order q).

Derivation

By the Fundamental Principle of Counting: Every single element in Set A (total $p$ elements) MUST be mapped (exhaustion rule), and each has exactly $q$ independent choices in Set B. Therefore, total combinations = $q \times q \times \dots \times q$ ( $p$ times) = $q^p$ .

Component Anatomy:

$p$ : Cardinality of the Domain (set A).
$q$ : Cardinality of the Codomain (set B).

Boundary Conditions / Domain:

Both sets must be strictly finite.
Not every relation is a function, thus $q^p \le 2^{pq}$ .

Prism Memory Hook

Outputs to the power of Inputs (Codomain ^ Domain).

Real-Valued Function vs. Real Function

What is the strict mathematical distinction between a Real-Valued Function and a Real Function?

DISTINCTION

Real-Valued Function: A function where only the Range is strictly a subset of the Real Numbers ( $\mathbb{R}$ ). The inputs (Domain) could theoretically be anything (e.g., matrices, complex numbers).
Real Function: A function where BOTH the Domain and the Range are strictly $\mathbb{R}$ or subsets of $\mathbb{R}$ .

Prism Memory Hook

Real-Valued = Real Output. Real Function = Real In AND Real Out.

The Identity Function

CONCEPT Formula

f(x) = x

The algebraic equation for the Identity Function on real numbers.

Derivation

Output simply maps mathematically to itself.

Component Anatomy:

$f(x) = x$ : The output is identically equal to the input.

Boundary Conditions / Domain:

Domain: $\mathbb{R}$
Range: $\mathbb{R}$
Graph: A straight continuous line passing strictly through the origin $(0,0)$ making a 45-degree angle with both positive coordinate axes ( $y=x$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Constant Function

CONCEPT Formula

f(x) = c

The algebraic equation for the Constant Function on real numbers.

Derivation

Output ignores input entirely, remaining at fixed value $c$ .

Component Anatomy:

$c$ : A specific real constant mapped to all inputs.

Boundary Conditions / Domain:

Domain: $\mathbb{R}$ (Accepts any real number).
Range: $\{c\}$ (A singleton set containing strictly only the constant $c$ ).
Graph: A straight horizontal line perfectly parallel to the x-axis, intersecting the y-axis exactly at $(0,c)$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Modulus (Absolute Value) Function

CONCEPT Formula

f(x) = \begin{cases} x, & \text{if } x \ge 0 \ -x, & \text{if } x < 0 \end{cases}

The complete piecewise algebraic definition of the Modulus Function $f(x) = |x|$ .

Component Anatomy:

$x$ : When input is $\ge 0$ , it passes through unchanged.
$-x$ : When input is $< 0$ , applying a negative sign algebraically flips it to positive.

Boundary Conditions / Domain:

Domain: $\mathbb{R}$
Range: $\mathbb{R}^+ \cup \{0\}$ (Strictly $[0, \infty)$ ). Non-negative reals.
Graph: A V-shaped continuous curve meeting precisely at a vertex at the origin.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Graphical Shift of the Modulus Function ( $f(x) = |x-a|$ )

How does the geometric graph of $f(x) = |x-a|$ differ from $f(x) = |x|$ , and where is its critical point of non-differentiability located?

APPLICATION

Property: The standard modulus function $f(x) = |x|$ has its absolute minimum and sharp geometric non-differentiable turn (vertex) precisely at the origin $(0,0)$ .
Horizontal Shift: For the transformed function $f(x) = |x-a|$ , the entire V-shaped graph shifts strictly horizontally by $a$ units along the x-axis.
Critical Point: The sharp turn occurs precisely at $(a, 0)$ , representing the mathematical root of the internal expression.
Domain & Range: Domain remains unchanged as $\mathbb{R}$ . Range remains strictly $[0, \infty)$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Signum Function

CONCEPT Formula

f(x) = \begin{cases} 1, & \text{if } x > 0 \ 0, & \text{if } x = 0 \ -1, & \text{if } x < 0 \end{cases}

The complete piecewise algebraic definition of the Signum function.

Derivation

Alternatively represented as $f(x) = \frac{|x|}{x}$ when $x \neq 0$ .

Component Anatomy:

$\frac{|x|}{x}$ : Yields strictly $+1$ for any positive number, and $-1$ for any negative number.
$0$ : A forced discrete piecewise condition at the origin to prevent division by zero.

Boundary Conditions / Domain:

Domain: $\mathbb{R}$
Range: $\{-1, 0, 1\}$ (Strictly a finite set of three integers).

Prism Memory Hook

Signum just reads the SIGN. +1, 0, or -1.

The Greatest Integer (Step) Function

CONCEPT Formula

f(x) = [x]

The Greatest Integer Function notation and its strict evaluation rule.

Derivation

Examples:
$[1.99] = 1$
$= 2$
$[0.5] = 0$
$[-1.2] = -2$

Component Anatomy:

$[x]$ : Assumes the value of the greatest integer that is strictly less than or equal to $x$ .

Boundary Conditions / Domain:

Domain: $\mathbb{R}$
Range: $\mathbb{Z}$ (The set of all integers).
Trap: For negative decimals, it inherently steps DOWN to the more negative integer. $[ -1.5 ] = -2$ , NOT $-1$ .

Prism Memory Hook

Always step DOWN the number line to the nearest whole integer.

Algebra of Real Functions: Addition & Multiplication

PROCEDURAL Formula

\begin{aligned} (f+g)(x) &= f(x) + g(x) \ (fg)(x) &= f(x)g(x) \end{aligned}

The algebraic definition for the sum and product of two real functions.

Derivation

To safely evaluate $f(x) + g(x)$ , the input $x$ must be permissible in $f$ AND permissible in $g$ . Therefore, the new domain is their strict intersection.

Component Anatomy:

$(f+g)(x)$ : Pointwise addition of outputs.
$(fg)(x)$ : Pointwise multiplication of outputs.

Boundary Conditions / Domain:

The operations are mathematically valid ONLY where BOTH functions simultaneously exist.
Strict Domain: $D_f \cap D_g$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Algebra of Real Functions: Quotient Domain

PROCEDURAL Formula

\left(\frac{f}{g}\right)(x) = \frac{f(x)}{g(x)} \quad \implies \quad \text{Domain} = D_f \cap D_g - \{x: g(x) = 0\}

The algebraic definition for the quotient of two real functions and its strict domain constraint.

Derivation

Zero in the denominator mathematically evaluates to an undefined operation, creating asymptotes or geometric holes.

Component Anatomy:

$f(x) / g(x)$ : Pointwise mathematical division of outputs.

Boundary Conditions / Domain:

The input $x$ must be valid for both original functions $f$ and $g$ ( $D_f \cap D_g$ ).
Critical Restriction: The denominator function strictly evaluated at $x$ cannot be zero ( $g(x) \neq 0$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain Algorithm for a Rational Function

PROCEDURAL Formula

f(x) = \frac{p(x)}{q(x)} \quad \implies \quad q(x) \neq 0

The exact algebraic condition used to algorithmically evaluate the domain of a rational function.

Derivation

Algorithmic SOP to find Domain:

Isolate the denominator expression $q(x)$ .
Set $q(x) = 0$ and solve for $x$ to find the critical crash points.
The Domain strictly spans all Real Numbers excluding these crash points: $\mathbb{R} - \{\text{roots}\}$ .

Component Anatomy:

$p(x)$ : The numerator polynomial.
$q(x)$ : The denominator polynomial.

Boundary Conditions / Domain:

The function mathematically crashes (approaches undefined/infinity) precisely at roots of the denominator.
Domain: $\mathbb{R} - \{x: q(x) = 0\}$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain of a Square Root Function ( $y = \sqrt{g(x)}$ )

PROCEDURAL Formula

g(x) \ge 0

The fundamental inequality required to algebraically find the domain of a square root function.

Derivation

Algorithmic SOP:

Extract the inner expression $g(x)$ .
Set up the strict inequality $g(x) \ge 0$ .
Solve the inequality using the wavy curve method (number line).
Express the valid intervals using appropriate brackets $[a, b]$ , ensuring roots of the inequality are included.

Component Anatomy:

$g(x)$ : The internal function (radicand) strictly under the even root.

Boundary Conditions / Domain:

Under the scope of real functions, the radicand of an even root must strictly be non-negative to avoid complex numbers.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain of Denominator Square Root ( $y = \frac{1}{\sqrt{g(x)}}$ )

PROCEDURAL Formula

g(x) > 0

The fundamental inequality required to find the domain of a function with a square root in the denominator.

Derivation

Algorithmic SOP:

Extract inner expression $g(x)$ .
Set up strict inequality $g(x) > 0$ (Equal to zero is rejected to prevent undefined division).
Solve using the number line.
Use strictly open brackets $(a, b)$ for the boundary roots since they are geometrically excluded.

Component Anatomy:

$\sqrt{g(x)}$ : Located purely in the denominator.

Boundary Conditions / Domain:

Normal root rule is $g(x) \ge 0$ .
Normal fraction rule is $\sqrt{g(x)} \neq 0 \implies g(x) \neq 0$ .
Combining these forces strict inequality.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain of a Logarithmic Function ( $y = \log_{a} g(x)$ )

PROCEDURAL Formula

g(x) > 0

The mathematical inequality required to evaluate the domain of a logarithmic function.

Derivation

Strictly set the argument $g(x) > 0$ and solve the resulting algebraic inequality.

Component Anatomy:

$g(x)$ : The argument of the logarithm.

Boundary Conditions / Domain:

A fundamental rule of mathematics: Logarithms only accept strictly positive real inputs.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain of Reciprocal Square Root with Subtractive Modulus

PROCEDURAL Formula

\text{Domain} = \emptyset

The exact algebraic domain for the function $f(x) = \frac{1}{\sqrt{x - |x|}}.$

Derivation

Algorithmic SOP:

Since the root is in the denominator, set up a strict inequality: $x - |x| > 0$ .
Rearrange the inequality: $x > |x|$ .
Mathematically evaluate: The absolute value of any number is always greater than or equal to the number itself.
Conclusion: There exists no real number $x$ that is strictly greater than its absolute value. The domain is strictly the empty set.

Component Anatomy:

$\sqrt{x - |x|}$ : A root expression strictly in the denominator.

Boundary Conditions / Domain:

A fundamental property of absolute values states that $|x| \ge x$ for all real numbers.
Thus, the expression inside the root $(x - |x|)$ will always evaluate to $\le 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain of Reciprocal Square Root with Additive Modulus

PROCEDURAL Formula

\text{Domain} = (0, \infty)

The exact algebraic domain for the function $f(x) = \frac{1}{\sqrt{x + |x|}}.$

Derivation

Algorithmic SOP:

Set strict denominator root condition: $x + |x| > 0$ .
Case 1 ( $x \le 0$ ): $|x| = -x$ . The expression becomes $x - x = 0$ . Since $0 > 0$ is false, all negative numbers and zero are strictly rejected.
Case 2 ( $x > 0$ ): $|x| = x$ . The expression becomes $x + x = 2x$ . Solving $2x > 0 \implies x > 0$ .
Conclusion: The valid interval is strictly positive real numbers.

Component Anatomy:

$\sqrt{x + |x|}$ : A root expression strictly in the denominator.

Boundary Conditions / Domain:

Since the expression must strictly be positive, negative numbers will annihilate the expression.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain via GIF Inequalities: Part 1 (Factorization)

PROCEDURAL Formula

[x] < -2 \text{ or } [x] > 3

Step 1 of evaluating the domain of $f(x) = \frac{1}{\sqrt{[x]^2 - [x] - 6}}$ .

Derivation

Algorithmic SOP (Part 1):

Establish boundary condition for denominator root: $[x]^2 - [x] - 6 > 0$ .
Factorize quadratic: $([x] - 3)([x] + 2) > 0$ .
Apply wavy curve rules purely to the GIF block: $[x] < -2$ or $[x] > 3$ .

Component Anatomy:

$[x]$ : The greatest integer less than or equal to $x$ .
$[x]^2 - [x] - 6$ : A quadratic expression constructed with the GIF.

Boundary Conditions / Domain:

A strict inequality inside a denominator root $>0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Standard Algorithm for Finding Range via Inversion

PROCEDURAL Formula

x = h(y)

The Standard Operating Procedure (SOP) to analytically determine the Range of a basic rational function.

Derivation

Algorithmic SOP:

Set the function equal to $y$ : $y = f(x)$ .
Algebraically cross-multiply and rearrange the equation to express $x$ entirely in terms of $y$ (i.e., find $x = h(y)$ ).
Find the 'Domain' of this new inverted function $h(y)$ (e.g., if $x = \frac{2y}{y-1}$ , then $y \neq 1$ ).
This calculated 'Domain' constraint on $y$ represents the true Range of the original function $f(x)$ .

Component Anatomy:

$y = f(x)$ : We shift perspective to treat the output variable $y$ as the independent parameter.

Boundary Conditions / Domain:

Must cross-reference the final Range answers with any strict Domain restrictions initially placed on $x$ (e.g., if $x \neq 3$ , ensure $y$ does not assume the value that would require $x=3$ ).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Range via Quadratic Discriminant: Part 1 (Formulation)

PROCEDURAL Formula

(yp-a)x^2 + (yq-b)x + (yr-c) = 0

Step 1 of the discriminant method for finding the range of a quadratic rational function.

Derivation

Algorithmic SOP (Part 1):

Let $y = \frac{ax^2+bx+c}{px^2+qx+r}$ .
Cross multiply to clear the denominator.
Algebraically group terms to form a standard quadratic equation strictly in terms of $x$ : $(yp-a)x^2 + (yq-b)x + (yr-c) = 0$ .

Component Anatomy:

$Ay^2 + By + C = 0$ : A quadratic equation mapped in terms of $x$ , with algebraic coefficients containing $y$ .

Boundary Conditions / Domain:

Strictly used when the function is a rational function of the form $\frac{\text{Quadratic}}{\text{Quadratic}}$ or $\frac{\text{Linear}}{\text{Quadratic}}$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Range of a Rational Function with a Removable Discontinuity

DISTINCTION Formula

\text{Range} = \mathbb{R} - \{2a\}

The step-by-step mathematical trap evaluation for the Range of $f(x) = \frac{x^2 - a^2}{x - a}$ .

Derivation

Algorithmic SOP:

Lock the Domain: The original denominator strictly dictates $x \neq a$ . Therefore, Domain = $\mathbb{R} - \{a\}$ .
Algebraic Simplification: Factor and cancel: $\frac{(x-a)(x+a)}{x-a} = x + a$ .
The Trap Execution: The simplified function operates as a straight line $y = x + a$ . However, because $x$ is explicitly forbidden from being exactly $a$ , $y$ is mathematically forbidden from being exactly $a + a = 2a$ .
Conclusion: The range spans all reals except the geometric hole at $y = 2a$ .

Component Anatomy:

$x - a$ : Present in both numerator and denominator, algebraically canceling but leaving a permanent topological constraint.

Boundary Conditions / Domain:

A function's strict Domain is irrevocably defined by its RAW original form, not its simplified algebraic form. Therefore, $x \neq a$ carries over universally.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Range of a Bounded Rational Function: Part 1

PROCEDURAL Formula

yx^2 - x + y = 0

Setup steps to calculate the exact bounded Range interval for $f(x) = \frac{x}{1+x^2}$ .

Derivation

Algorithmic SOP (Part 1):

Set up standard range variable: $y = \frac{x}{1+x^2}$ .
Cross-multiply to generate a quadratic equation strictly in terms of $x$ : $y(1+x^2) = x \implies yx^2 - x + y = 0$ .

Component Anatomy:

$x$ over $1+x^2$ : A classic function that grows linearly but is eventually crushed asymptotically by a higher power denominator.

Boundary Conditions / Domain:

Since $1+x^2$ can never mathematically equal $0$ , the Domain is universally $\mathbb{R}$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Range of Non-Negative Rational: Part 1 (Isolation)

PROCEDURAL Formula

x^2 = \frac{y}{1-y}

Setup steps to isolate $x^2$ for the function $f(x) = \frac{x^2}{1+x^2}$ .

Derivation

Algorithmic SOP (Part 1):

Set $y = \frac{x^2}{1+x^2}$ .
Cross-multiply and algebraically solve purely for $x^2$ : $y + yx^2 = x^2$ .
Factor $x^2$ : $x^2(1-y) = y \implies x^2 = \frac{y}{1-y}$ .

Component Anatomy:

$x^2$ : Forces all domain inputs algebraically into purely non-negative outputs.
$1+x^2$ : Ensures the denominator is strictly greater than the numerator, preventing the value from ever geometrically reaching $1$ .

Boundary Conditions / Domain:

The Domain is universally $\mathbb{R}$ because $1+x^2 \neq 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Range of Trig Rational: Part 1 (Universal Bounding)

PROCEDURAL Formula

3 \ge 1 - 2\cos x \ge -1

Step 1: Bounding the denominator for $f(x) = \frac{1}{1 - 2\cos x}$ .

Derivation

Algorithmic SOP (Part 1):

Establish the universal mathematical bound: $-1 \le \cos x \le 1$ .
Multiply universally by $-2$ (strictly flips inequality signs): $2 \ge -2\cos x \ge -2$ .
Add $1$ algebraically to all sides: $3 \ge 1 - 2\cos x \ge -1$ . (This establishes the raw continuous range of the denominator).

Component Anatomy:

$\cos x$ : The core continuous oscillatory function strictly bounded between $-1$ and $1$ .
$1 - 2\cos x$ : The linear mathematical transformation of the core function located precisely in the denominator.

Boundary Conditions / Domain:

While $\cos x$ sweeps continuously, the full denominator fundamentally cannot equal zero.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

GIF Equation Solution Set: Part 1 (Roots)

PROCEDURAL Formula

[x] = 2, \quad [x] = 3

Step 1: Finding discrete integer roots for $[x]^2 - 5[x] + 6 = 0$ .

Derivation

Algorithmic SOP (Part 1):

Treat $[x]$ as an algebraic variable (like $u$ ).
Factorize the quadratic equation: $([x] - 2)([x] - 3) = 0$ .
Extract the integer roots purely for the GIF block: $[x] = 2$ and $[x] = 3$ .

Component Anatomy:

Roots of $[x]$ : Treating the entire greatest integer block strictly as an independent algebraic variable to find discrete integer solutions.

Boundary Conditions / Domain:

Ensure the roots found for $[x]$ are mathematically integers. If a fractional root emerges for a GIF, that specific branch yields no solution.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Domain and Range of a Semi-Circle Function

FACT Formula

\begin{aligned} \text{Domain} &= [-a, a] \ \text{Range} &= [0, a] \end{aligned}

Determine the exact Domain and Range for the generic semi-circle function $f(x) = \sqrt{a^2 - x^2}$ .

Derivation

Domain: Radicand must be strictly non-negative: $a^2 - x^2 \ge 0 \implies x^2 \le a^2 \implies x \in [-a, a]$ .
Range:

The mathematical minimum possible valid value of $x^2$ is $0$ , which maximizes the output: $\sqrt{a^2 - 0} = a$ .
The mathematical maximum possible valid value of $x^2$ is $a^2$ , which minimizes the output: $\sqrt{a^2 - a^2} = 0$ .
Therefore, output bounds span strictly $[0, a]$ .

Component Anatomy:

$a^2 - x^2$ : A downward opening parabola inside a root, geometrically representing the strict upper half of a circle of radius $a$ centered at the origin.

Boundary Conditions / Domain:

Radicand constraint rigorously requires $a^2 - x^2 \ge 0$ to stay firmly in the real number plane.

Prism Memory Hook

Domain stretches Left-Right (-a to a). Range stretches Floor-Ceiling (0 to a).

Evaluating Word Rule Functions (Highest Prime Factor)

Given the Domain $\{9, 10, 11, 12, 13\}$ , how do you algorithmically determine the exact Range for the descriptive function $f(n) =$ 'highest prime factor of n'?

APPLICATION

Concept: Converting an English descriptive algorithmic rule strictly into mathematical mapped outputs.
Execution SOP: Break down each domain element strictly into its prime factorization tree, then isolate the largest value.
- $9 = 3^2 \implies f(9) = 3$
- $10 = 2 \times 5 \implies f(10) = 5$
- $11 = 11^1 \implies f(11) = 11$
- $12 = 2^2 \times 3 \implies f(12) = 3$
- $13 = 13^1 \implies f(13) = 13$
Range Consolidation: The set of outputs is strictly written as distinct, non-repeating mathematical elements: $\{3, 5, 11, 13\}$ . (The duplicate output 3 from inputs 9 and 12 merges).

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Linear Function Parameters: Part 1 (Setup)

PROCEDURAL Formula

y_i = ax_i + b

Step 1: Setting up equations to analytically find constants $a$ and $b$ given a relation $f = \{(x_1, y_1), (x_2, y_2)\}$ .

Derivation

Algorithmic SOP (Part 1):

Extract exactly two given ordered pairs $(x_1, y_1)$ and $(x_2, y_2)$ directly from the relation set.
Substitute the first coordinate pair directly into the linear function equation: $y_1 = ax_1 + b$ .
Substitute the second coordinate pair directly into the linear function equation: $y_2 = ax_2 + b$ .

Component Anatomy:

$x_i, y_i$ : The specific domain and range mathematical values provided by the relation's given coordinate points.
$a, b$ : The unknown coefficients strictly defining the linear mapping.

Boundary Conditions / Domain:

A straight geometric line mathematically requires exactly two distinct valid points to lock in its algebraic formula.

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Self-Inverse Rational Function Identity

APPLICATION Formula

f(f(x)) = x

If $f(x) = \frac{ax - b}{cx - a}$ , what does the composite evaluation mathematically collapse down to?

Derivation

Direct algebraic substitution of $f(x)$ into itself strictly yields total cancellation, leaving only $x$ .

Component Anatomy:

$f(f(x))$ : The strict composition of a mathematical function precisely with itself.
Coefficient Symmetry: Notice that the constant in the denominator ( $-a$ ) is the exact algebraic negative of the leading coefficient of the numerator ( $a$ ).

Boundary Conditions / Domain:

This identity algebraically proves that the function is functionally its own identical inverse.
Requires $cx - a \neq 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Functional Equation Identity for Logarithms

FACT Formula

f(xy) = f(x) + f(y)

Given that $f(x) = \log x$ , state the fundamental functional equation linking $f(xy)$ with $f(x)$ and $f(y)$ .

Derivation

Step-by-step substitution:

Insert the mathematical product $(xy)$ into the core function definition: $\log(xy)$ .
Invoke the foundational Product Rule property of logarithms: $\log(xy) = \log(x) + \log(y)$ .
Substitute the functional notations strictly back in: $f(x) + f(y)$ .

Component Anatomy:

$f(xy)$ : Evaluating the mathematical function on an algebraic product.
$f(x) + f(y)$ : The arithmetic sum of distinct independent function evaluations.

Boundary Conditions / Domain:

Holds mathematically exclusively for strictly positive real inputs ( $x > 0, y > 0$ ).

Prism Memory Hook

Logarithms mathematically break Multiplication strictly into Addition.

Functional Equations via Reciprocal Sub: Part 1

PROCEDURAL Formula

x \to \frac{1}{x}

Step 1: Generating a secondary equation for a composite linear functional equation like $2f(x) - 3f(1/x) = x^2$ .

Derivation

Algorithmic SOP (Part 1):

Write the primary functional equation strictly as given: e.g., $2f(x) - 3f(1/x) = x^2$ .
Substitute $x$ with $1/x$ globally to mathematically generate a distinct secondary equation: $2f(1/x) - 3f(x) = \frac{1}{x^2}$ .

Component Anatomy:

$x \to \frac{1}{x}$ : Replacing every single algebraic instance of the independent variable with its mathematical reciprocal.

Boundary Conditions / Domain:

Strictly valid only when $x \neq 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

The Polynomial Reciprocal Null Identity

APPLICATION Formula

f(x) + f\left(\frac{1}{x}\right) = 0

State the exact algebraic result of the functional addition specifically when evaluating $f(x) = x^3 - \frac{1}{x^3}$ .

Derivation

Step 1: Mathematically evaluate the reciprocal input: $f(1/x) = (1/x)^3 - \frac{1}{(1/x)^3} = \frac{1}{x^3} - x^3$ .
Step 2: Add this resultant strictly to the original $f(x)$ : $\left(x^3 - \frac{1}{x^3}\right) + \left(\frac{1}{x^3} - x^3\right)$ .
Step 3: All mathematical terms perfectly cancel out, algebraically yielding exactly $0$ .

Component Anatomy:

$f(1/x)$ : Evaluating the mathematical function strictly using the mathematical reciprocal of the continuous input.
Cancellation: The specific alternating signs of the polynomial powers mathematically force a perfect algebraic cancellation symmetry.

Boundary Conditions / Domain:

The continuous input $x$ is strictly bounded to $x \neq 0$ .

Prism Memory Hook

A premium mnemonic for this topic is available in the Prism App.

Define the Cartesian Product of two non-empty sets A and B, and state the strict result if one of the sets is empty.

Definition

Set-Builder Notation

Boundary Condition

Prism Memory Hook

Condition for Equality of Ordered Pairs

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

Cardinality of a Cartesian Product

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

What is an ordered triplet, and what does the specific Cartesian product R×R×R\mathbb{R} \times \mathbb{R} \times \mathbb{R}R×R×R geometrically represent?

Definition

Set-Builder Notation

Geometric Application

Prism Memory Hook

Is the Cartesian product of two sets mathematically commutative? If not, what are the only two strict exceptions where A×B=B×AA \times B = B \times AA×B=B×A?

Prism Memory Hook

Learning through recall beats re-reading.

How is a mathematical 'Relation' strictly defined in terms of a Cartesian product?

Prism Memory Hook

Differentiate between the Domain, Range, and Codomain of a mathematical relation R from set A to set B.

Prism Memory Hook

Total Number of Possible Relations

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

Total Number of Non-Empty Relations

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

Define the Inverse Relation R−1R^{-1}R−1 and state how its Domain and Range correspond to the original relation R.

Prism Memory Hook

Formulas require repetition, not just reading.

What are the two strict boundary conditions a relation must satisfy to be mathematically classified as a Function?

Prism Memory Hook

Explain the difference between 'Many-to-One' and 'One-to-Many' mappings, and state which one strictly violates the definition of a function.

Prism Memory Hook

Mathematically prove via a counter-example why the integer relation f={(ab,a+b)}f = \{(ab, a+b)\}f={(ab,a+b)} strictly fails the definition of a function.

Prism Memory Hook

How do you algebraically determine if a continuous piecewise relation is mathematically classified as a function at its boundary points?

Prism Memory Hook

Total Number of Functions

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

NCERT + Active Recall = Exam Mastery.

What is the strict mathematical distinction between a Real-Valued Function and a Real Function?

Prism Memory Hook

The Identity Function

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

The Constant Function

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

The Modulus (Absolute Value) Function

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

How does the geometric graph of f(x)=∣x−a∣f(x) = |x-a|f(x)=∣x−a∣ differ from f(x)=∣x∣f(x) = |x|f(x)=∣x∣, and where is its critical point of non-differentiability located?

Prism Memory Hook

Download Prism to study offline.

The Signum Function

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

The Greatest Integer (Step) Function

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

Algebra of Real Functions: Addition & Multiplication

Component Anatomy:

Boundary Conditions / Domain:

Prism Memory Hook

Algebra of Real Functions: Quotient Domain

Component Anatomy:

What is an ordered triplet, and what does the specific Cartesian product $\mathbb{R} \times \mathbb{R} \times \mathbb{R}$ geometrically represent?

Is the Cartesian product of two sets mathematically commutative? If not, what are the only two strict exceptions where $A \times B = B \times A$ ?

Define the Inverse Relation $R^{-1}$ and state how its Domain and Range correspond to the original relation R.

Mathematically prove via a counter-example why the integer relation $f = \{(ab, a+b)\}$ strictly fails the definition of a function.

How does the geometric graph of $f(x) = |x-a|$ differ from $f(x) = |x|$ , and where is its critical point of non-differentiability located?

Domain of a Square Root Function ( $y = \sqrt{g(x)}$ )

Domain of Denominator Square Root ( $y = \frac{1}{\sqrt{g(x)}}$ )

Domain of a Logarithmic Function ( $y = \log_{a} g(x)$ )

Given the Domain $\{9, 10, 11, 12, 13\}$ , how do you algorithmically determine the exact Range for the descriptive function $f(n) =$ 'highest prime factor of n'?