Trace it. Derive it. Know it.
Every cluster below maps one schematic path — from first principles to the final equation. Expand a node to follow the full derivation trace.
Cartesian Product of Sets, Ordered Pairs & Cardinality of A × B
2 concepts · 2.1What is an ordered pair, how is the Cartesian product A × B constructed, and what algebraic and cardinality laws govern it?
An ordered pair (a, b) consists of two objects listed in a rigid order; (a, b) = (c, d) if and only if a = c and b = d. In contrast to sets where {a, b} = {b, a}, ordered pairs are strictly directional: (a, b) != (b, a) unless a = b. For non-empty sets A and B, the Cartesian product A × B is the set of all ordered pairs (a, b) such that a in A and b in B: A × B = {(a, b) : a in A and b in B}. If n(A) = p and n(B) = q, then n(A × B) = p * q. If either A or B is infinite and the other non-empty, A × B is infinite; if either set is empty (∅), then A × B = ∅. The Cartesian product is non-commutative (A × B != B × A when A != B), but satisfies distributivity over union, intersection, and difference: A × (B ∪ C) = (A × B) ∪ (A × C), A × (B ∩ C) = (A × B) ∩ (A × C), and A × (B - C) = (A × B) - (A × C). Furthermore, R × R = R² represents the Euclidean coordinate plane, and R × R × R = R³ represents 3D coordinate space.
Ordered Pairs & Component-Wise Equality
An ordered pair (a, b) lists elements in strict order. (a, b) = (c, d) iff a = c and b = d.
Cartesian Product Cardinality & Algebraic Laws
A × B = {(a, b) : a in A, b in B}. Cardinality is n(A × B) = n(A) * n(B). Distributes over ∪, ∩, and -.
Relations: Definition, Arrow Diagrams, Domain, Range, Codomain & Total Relations
2 concepts · 2.2What defines a relation from set A to set B, how are Domain, Range, and Codomain extracted, and why are there 2^(mn) possible relations?
A relation R from a non-empty set A to a non-empty set B is formally defined as any subset of the Cartesian product A × B: R ⊆ A × B. The relationship is established by specifying a linking condition between the first element x and the second element y, denoted as (x, y) in R or x R y. If (x, y) in R, y is called the image of x under R, and x is the pre-image of y. The Domain of R is the set of all first elements in the ordered pairs belonging to R: Dom(R) = {x in A : (x, y) in R for some y in B} ⊆ A. The Range of R is the set of all second elements: Range(R) = {y in B : (x, y) in R for some x in A} ⊆ B. The entire target set B is termed the Codomain of R, establishing that Range(R) ⊆ Codomain(B). If n(A) = m and n(B) = n, then n(A × B) = mn. Since every subset of A × B is a relation, the total number of relations from A to B is the number of subsets of A × B, given by 2^(mn). The empty set ∅ and A × B itself are extreme relations, termed the Empty Relation and Universal Relation respectively.
Relation as a Subset & Arrow Diagram Representation
A relation R from A to B is a subset of A × B. Elements are linked by arrows from pre-images in A to images in B.
Domain, Range, Codomain & Total Number of Relations
Dom(R) = {x : (x, y) in R}, Range(R) = {y : (x, y) in R}. Codomain is B. Total relations = 2^(mn).
Function Definition as a Special Relation, Vertical Line Test & Criteria
2 concepts · 2.3What two mandatory conditions transform a relation into a function, and how does the Vertical Line Test determine functionality geometrically?
A function f from a set A to a set B (written f : A -> B) is a special relation that satisfies two non-negotiable criteria: (1) Every element of A has an image in B (Existence: no element of A is left unmapped, meaning Dom(f) = A); (2) Every element of A has a unique image in B (Uniqueness: no element of A is mapped to more than one element of B). In ordered pair notation, if (a, b) in f and (a, c) in f, then b = c. We write y = f(x), where y is the image of x under f, and x is the pre-image of y. A function can be many-to-one (distinct x values mapped to the same y) or one-to-one, but it can NEVER be one-to-many. Geometrically, on the Cartesian plane, a relation represents a real function y = f(x) if and only if EVERY vertical line x = c (for c in Dom(f)) intersects the graph at EXACTLY ONE point (Vertical Line Test). If any vertical line intersects a curve at two or more points, the input c possesses multiple outputs, disqualifying the curve as a function of x.
Formal Function Criteria & Arrow Mappings
f : A -> B is a function iff every a in A has exactly one image b in B. Dom(f) = A.
The Vertical Line Test (VLT)
A curve y = f(x) represents a function iff every vertical line x = c intersects the curve at most once.
Standard Real Functions I: Identity, Constant, Polynomial, Rational & Modulus (|x|)
2 concepts · 2.4What are the analytical forms, graphs, domains, and ranges of the Identity, Constant, Polynomial, Rational, and Modulus functions?
Standard real functions serve as elementary building blocks across calculus. (1) Identity Function: f(x) = x, Dom(f) = R, Range(f) = R; straight line through origin at 45° angle. (2) Constant Function: f(x) = c, Dom(f) = R, Range(f) = {c}; horizontal line parallel to x-axis with slope 0. (3) Polynomial Function: f(x) = a_n x^n + ... + a_1 x + a_0 (a_n != 0, n in W), Dom(f) = R; includes square function f(x) = x² (Range = [0, ∞)) and cube function f(x) = x³ (Range = R). (4) Rational Function: f(x) = P(x) / Q(x), where P, Q are polynomials and Q(x) != 0; Dom(f) = R - {x : Q(x) = 0}; classic example is the rectangular hyperbola f(x) = 1/x (Dom = R - {0}, Range = R - {0}). (5) Modulus (Absolute Value) Function: f(x) = |x| = x for x >= 0, and -x for x < 0; Dom(f) = R, Range(f) = [0, ∞); V-shaped graph with vertex at (0, 0), symmetric about y-axis (f(-x) = f(x), even function). The modulus satisfies |x| <= a <=> -a <= x <= a, and |x| >= a <=> x <= -a or x >= a, alongside the Triangle Inequality |x + y| <= |x| + |y|.
Identity, Constant & Rational Functions
Identity f(x) = x (Dom=R, Range=R). Constant f(x) = c (Range={c}). Rational f(x) = P(x)/Q(x) requires Q(x) != 0.
Modulus Function |x| & Metric Properties
|x| = x for x >= 0, and -x for x < 0. Dom = R, Range = [0, ∞). √(x²) = |x|.
Standard Real Functions II: Signum, Greatest Integer Function ([x]), Fractional Part ({x})
2 concepts · 2.5How are Signum, Greatest Integer, Fractional Part, Exponential, and Logarithmic functions defined, and what jump discontinuities characterize them?
Piecewise and transcendental functions play central roles in higher mathematics. (1) Signum Function: sgn(x) = |x|/x = 1 (x > 0), 0 (x = 0), -1 (x < 0); Dom(sgn) = R, Range(sgn) = {-1, 0, 1}; exhibits a jump discontinuity of magnitude 2 across x = 0. (2) Greatest Integer Function (Floor / Step Function): f(x) = [x] represents the greatest integer less than or equal to x (e.g. [3.7] = 3, [-2.3] = -3); Dom = R, Range = Z. Properties: [x] <= x < [x] + 1; [x + k] = [x] + k for k in Z; [x] + [-x] = 0 (if x in Z) and -1 (if x not in Z). (3) Fractional Part Function: {x} = x - [x]; Dom = R, Range = [0, 1); periodic with fundamental period T = 1; {x} + {-x} = 0 (if x in Z) and 1 (if x not in Z). (4) Exponential Function: f(x) = a^x (a > 0, a != 1); Dom = R, Range = (0, ∞); strictly increasing for a > 1 and strictly decreasing for 0 < a < 1. (5) Logarithmic Function: f(x) = log_a(x) (a > 0, a != 1, x > 0); Dom = (0, ∞), Range = R; inverse of the exponential function, reflecting across the line y = x.
Greatest Integer Function [x] (Floor)
[x] is the greatest integer <= x. Dom = R, Range = Z. Staircase graph with jump 1 at every integer.
Fractional Part Function {x} & Periodic Properties
{x} = x - [x]. Dom = R, Range = [0, 1). Periodic with period 1: {x + 1} = {x}.
Algebra of Real Functions & Rigorous Domain/Range Computation Algorithms
2 concepts · 2.6How are sum, difference, product, and quotient of functions constructed, and what systematic algorithms compute Domain and Range?
Let f : X -> R and g : Y -> R be real functions. Their algebraic combinations are defined pointwise on the intersection of their domains: (1) Sum: (f + g)(x) = f(x) + g(x), Dom(f + g) = X ∩ Y; (2) Difference: (f - g)(x) = f(x) - g(x), Dom(f - g) = X ∩ Y; (3) Scalar Multiple: (c * f)(x) = c * f(x), Dom(c * f) = X; (4) Product: (f * g)(x) = f(x) * g(x), Dom(f * g) = X ∩ Y; (5) Quotient: (f / g)(x) = f(x) / g(x), Dom(f / g) = (X ∩ Y) - {x : g(x) = 0}. To systematically compute the Domain of any real function, enforce three cardinal rules: (A) Expressions under even roots must be non-negative: √(P(x)) requires P(x) >= 0; (B) Denominators must be non-zero: 1/Q(x) requires Q(x) != 0; (C) Logarithmic arguments must be strictly positive: log_b(u(x)) requires u(x) > 0, b > 0, and b != 1. The domain is the simultaneous intersection of all such constraints. To compute the Range, express x in terms of y (x = phi(y)) and determine values of y for which real x exists, or apply inequalities (AM-GM, bounded ranges of trigonometric/modulus functions, or completing the square).
Pointwise Algebra of Functions & Intersection Domains
(f ± g)(x) = f(x) ± g(x), (f * g)(x) = f(x)g(x) with domain X ∩ Y. (f/g)(x) = f(x)/g(x) with domain (X ∩ Y) - {x : g(x) = 0}.
Algorithmic Domain & Range Determination
Domain: radicals >= 0, denominators != 0, log args > 0. Range: solve for x in terms of y and find valid y, noting non-negativity.