Functions, Models, and Domain-Range Definitions

Chapter 1 focuses on the core mathematical concepts of Functions and Models.
Section 1.1 examines the four primary ways to represent a function:
- Verbal representation (description in words)
- Numerical representation (table of values)
- Visual representation (graph)
- Algebraic representation (explicit mathematical formula)

A function $f$ is a rule that assigns or pairs elements from an input set called the domain $D$ to a target set $E$ .
Formal Mapping Rule: For each input element $x$ in the domain set $D$ , the function $f$ assigns exactly one (at most one) corresponding output value denoted as $f(x)$ in the set $E$ .
Mapping Restrictions:
- Ambiguity is not allowed: a single element $x \neq \text{null}$ in domain $D$ cannot map to two or more distinct output values in set $E$ .
- Every input element in domain $D$ must map to a valid element in set E$.\n\n# Range of a Function and Set-Builder Notation\n\n* Range Definition: The range of a function f $is the set of all actual output values produced as$ x $varies throughout the entire domain set$ D.\n* Set-Builder Notation:\n ext{Range of } f = {f(x) \mid x \in D}\n* Set-builder notation is the standard mathematical method for defining a set by specifying the precise conditions and membership criteria that elements must satisfy.\n\n# Student-to-Chair Mapping Analogy\n\n* Domain (D): Defined as a set of Students.\n* Target Set (E): Defined as a set of Chairs.\n* Range: Defined specifically as the subset of Chairs that are paired to a Student.\n* Mapping Principle:\n * Each Student in domain set D $must be assigned to at most one Chair in target set$ E$.
- Having one student assigned to multiple chairs simultaneously is not allowed, mirroring the fundamental requirement of mathematical functions.