32 Tables, Rules, Graphs, and Multiple Representations

Tables, Rules, Graphs, and Multiple Representations is the study of the four principal ways a functional relationship can be expressed — a symbolic rule, a table of values, a set of ordered pairs, and a coordinate graph — together with the procedures for translating any one of these forms into any other, and for confirming that two differently presented representations describe the identical underlying relationship.

The Scope of Multiple Representations

Every function or relation can, in principle, be presented in several equivalent forms: as a rule, an algebraic formula such as f(x) = 2x - 1 describing how to compute an output from any input; as a table, a finite listing of specific input-output pairs arranged in rows or columns; as a set of ordered pairs, the same input-output information written in (x, y) notation; and as a graph, a visual plot of those ordered pairs on the coordinate plane. Fluency across all four forms — recognizing what each communicates and how to move between them — is essential, since real problems and data sets present functional relationships in whichever form is most natural to their context, not necessarily the form most convenient for solving.

Generating a Table from a Function Rule

Converting a function rule into a table is performed by choosing a set of input values, typically evenly spaced for clarity, and evaluating the rule at each chosen input using ordinary substitution, recording each input alongside its corresponding output. For f(x) = 2x - 1, choosing inputs -1, 0, 1, and 2 produces the table pairing -1 with -3, 0 with -1, 1 with 1, and 2 with 3, obtained by direct evaluation of the rule at each chosen x-value.

Converting a Table to Ordered Pairs

Converting a table into a set of ordered pairs is a direct notational change: each row (or column pair) of input and output values in the table becomes a single ordered pair (x, y), with the input as the first coordinate and the output as the second. The table pairing -1 with -3 and 0 with -1 converts directly to the ordered pairs (-1, -3) and (0, -1), with no computation required beyond correctly matching each input to its corresponding output.

Graphing a Table of Values

Converting a table (or its equivalent set of ordered pairs) into a graph is performed by plotting each ordered pair as a point on the coordinate plane, using the plotting procedure established for the coordinate plane generally, and, if the underlying relationship is continuous, connecting the plotted points to reveal the overall shape of the graph.

Reading a Table and Ordered Pairs from a Graph

Converting in the reverse direction, a graph is read back into a table or a set of ordered pairs by identifying the coordinates of clearly plotted or labeled points along the graph, using the coordinate-reading procedure established for the coordinate plane, and recording each identified point as a row of a table or as an ordered pair. When a graph shows a continuous curve rather than isolated points, specific points are typically read at gridline intersections, where both coordinates can be determined precisely rather than estimated.

Verifying a Candidate Function Rule

Given a table or set of ordered pairs, a candidate rule can be tested for correctness by substituting each input value from the table into the candidate rule and confirming that the computed output matches the table's recorded output for every single pair, not merely the first one checked. A candidate rule that matches some but not all of the given pairs must be rejected or revised, since a valid rule for a data set must reproduce every listed output exactly.

Verifying That Representations Are Equivalent

Two representations of a relationship — say, a rule and a graph, or a table and a set of ordered pairs presented separately — are confirmed to be equivalent representations of the same relation by systematically checking that every point implied by one representation also appears in, or is consistent with, the other. A rule and a graph are equivalent if every plotted point on the graph satisfies the rule when its coordinates are substituted in, and if the rule's output at each labeled x-value on the graph matches the corresponding plotted y-value.

Diagnosing Errors Across Representations

Common errors in this area include swapping the input and output columns when building a table from a rule, plotting a point's coordinates in the wrong order when graphing from a table, verifying a candidate rule against only one or two pairs rather than every pair in the given data, and misreading a graph's coordinates due to miscounted gridlines, producing a table or set of ordered pairs that does not actually match the original graph. Because each representation encodes the identical underlying relationship, any conversion between them can and should be checked by converting back to the original form and confirming the result matches exactly.