Relations And Functions Questions And Answers

Working Through Relations And Functions

Most students stumble on this material not because it's inherently difficult, but because they try to memorize procedures without actually visualizing what's happening. I've seen it constantly. The relationship between an input set and an output set is straightforward once you stop treating it like algebra word problems and start treating it like mapping. Let's begin with the mechanics rather than the theory. When you're given a relation and asked whether it qualifies as a function, you apply one test: each element in the domain maps to exactly one element in the range. That's it. A single input producing two different outputs disqualifies the relation immediately. Period. I remember grading a mid-term where a student wrote that the relation {(1, 3), (2, 5), (1, 7)} was a function because "the outputs are increasing." That reasoning doesn't hold water. The repeated domain value of 1 invalidates it regardless of what the outputs happen to do. Students confuse pattern recognition with definition compliance all the time.

Common Relations And Functions Questions And Answers

Q1: How do you determine if a graph represents a function?

Apply the vertical line test. Draw any vertical line through the graph. If it intersects the curve at more than one point, the relation fails the function test. This works for continuous graphs, piecewise functions, and discrete point plots alike. The test assumes the graph is plotted on a standard Cartesian plane with the independent variable on the horizontal axis. Q2: What is the difference between a relation and a function? Every function is a relation, but not every relation is a function. A relation is simply any subset of the Cartesian product of two sets. A function imposes the additional constraint that no two ordered pairs share the same first element. In set notation: a relation R from set A to set B is a function if and only if for every a A, there exists a unique b B such that (a, b) R.

Q3: Find the domain and range of f(x) = (4 - x²). The expression under the radical must be non-negative, so 4 - x² 0. Solving gives x² 4, which means the domain is [-2, 2]. For the range, note that the maximum value of (4 - x²) occurs at x = 0, giving f(0) = 2. The minimum occurs at the endpoints x = ±2, where f(±2) = 0. So the range is [0, 2]. This particular function traces the upper semicircle of radius 2 centered at the origin. Q4: Is g(x) = x³ - x a one-to-one function?

No. A function is one-to-one (injective) only if different inputs always produce different outputs. Testing g(1) = 1 - 1 = 0 and g(-1) = -1 + 1 = 0 shows two distinct inputs mapping to the same output. The horizontal line test would confirm this visually — the line y = 0 intersects the graph at x = -1, 0, and 1.

One counter-intuitive point that rarely gets emphasized: composition of functions does not commute. f(g(x)) is generally not the same as g(f(x)), even when both compositions are defined. I once had a colleague insist they were equivalent for all polynomial functions. They aren't. Take f(x) = x + 1 and g(x) = 2x. Then f(g(x)) = 2x + 1 while g(f(x)) = 2x + 2. The outputs differ by exactly 1 for every input x. This matters when you're solving functional equations or working with inverse pairs.

Another thing people miss is the distinction between the codomain and the range. Textbooks sometimes blur this. The codomain is the set you declare the function maps into. The range is the actual subset of outputs produced. For f: ℝ ℝ defined by f(x) = e, the codomain is all real numbers, but the range is only (0, ). This distinction becomes critical when discussing surjectivity — a function is surjective precisely when its range equals its codomain. Here's a practical edge case I encountered dealing with piecewise relations. A student presented the relation defined as f(x) = x for x < 0 and f(x) = x + 1 for x 0, then claimed it wasn't a function because of the jump at x = 0. It is a perfectly valid function. The discontinuity doesn't violate the definition. Each input still has exactly one output. The issue here is continuity, not functionality. Students conflate the two constantly because early courses often introduce them together. When working with inverse relations, remember that the inverse of a function exists only if the original function is one-to-one. If it isn't, you can sometimes restrict the domain to create an invertible subset. The classic example is f(x) = x². Restrict the domain to [0, ) and the inverse is f¹(x) = x. Restrict to (-, 0] and the inverse becomes f¹(x) = -x. Both are valid inverses on their respective restricted domains. For computational purposes, I usually recommend organizing the work in a table when dealing with finite relations. List every domain element, compute the corresponding range element, and flag any duplicates in the domain column. This catches errors faster than symbolic manipulation alone, especially under exam conditions where time pressure leads to careless mistakes. The material breaks down when you move into infinite sets without careful attention to cardinality. Countably infinite sets like the integers and uncountably infinite sets like the reals behave very differently under function mapping. There exist bijections between ℝ and ℝ², which defies intuition but follows from Cantor's results. This isn't something you need for introductory courses, but it's worth knowing the boundary of what's actually provable versus what feels wrong.