A set of ordered pairs fails to represent a function when one x-value appears with two different y-values, and the fastest way to prove it is to sort or scan the x-column for any repeat that carries a changed output. The set {(1, 2), (2, 4), (3, 6), (1, 8)} does not represent a function, because the input 1 is paired with both 2 and 8. The condition is one-directional: repeated y-values are legal, repeated x-values with identical y-values are legal, and only repeated inputs with different outputs break the rule.

The query is usually a multiple-choice test question or a homework check, so this article works the way the grader does. You'll get four independent tests that reach the same verdict, worked examples of each kind of failing set, and the edge cases that trip people up β€” including coordinate pairs written in tables, mapping diagrams, and disguised forms where the repeat hides. Every example below can be verified by hand in under a minute.

The One-Sentence Rule That Decides Every Disqualified Set

A relation is a function when each input in the domain maps to exactly one output in the range. That's the whole test. The formal statement appears in most Algebra I curricula and in the standard function definition used by the National Council of Teachers of Mathematics: a function assigns to each element of the domain precisely one element of the range. Read it as a supply rule β€” one input, one output, no exceptions.

The wording matters because students invert it. "Each output has one input" is wrong, and it disqualifies correct answers. Many-to-one relations are perfectly valid functions: {(βˆ’2, 5), (0, 5), (3, 5)} is a function even though three different inputs all land on 5. Vertical lines test the same property on a graph β€” a vertical line crossing a curve twice means one x has two y's, which is the same failure you see in a suspect set of pairs.

Here's the version to memorize for exams: repeated x is the alarm, and different y is the fire. If the x repeats and the y matches, nothing has broken. The relation still satisfies the definition, since input 4 with output 9 twice is still one assignment, just written twice. Teachers sometimes call this a redundant pair and count it as a function.

One more framing helps on multiple-choice items. Ask which set gives you two different answers to the same question. If someone asks "what is f(1)?" and your set contains both (1, 2) and (1, 8), the set cannot answer without contradicting itself, so it isn't a function. That question-and-answer framing is the mental model to carry into every example below.

Four Independent Tests That Reach the Same Verdict

Four methods catch a repeat input, and using two of them together eliminates almost all careless errors. The table below shows what each test looks for and what it costs you in time on a typical five-pair set.

Test What it checks Typical time for 5 pairs Failure signal
X-scan Sort or scan first coordinates for repeats 10–20 seconds Same x, different y
Mapping diagram Draw arrows from domain to range 30–45 seconds Two arrows leave one input
Vertical line test Plot the points, sweep a vertical line 40–60 seconds Line hits two points in one column
Question test Ask "what is f(x)?" for each repeated input 15 seconds Two conflicting answers

The x-scan is fastest and catches most exam items. Write the x-values in a column, cross out duplicates, then check whether the duplicated input kept its partner. For {(2, 3), (4, 5), (2, 3), (7, 1)}, the x-scan shows 2 twice but with the same y, so the set passes.

Mapping diagrams earn their extra seconds on word problems and diagram-based questions. Draw two ovals, list inputs on the left and outputs on the right, and draw one arrow per pair. A function has at most one arrow leaving each input; multiple arrows arriving at one output are fine. If two arrows leave the same left-hand value, the diagram fails immediately.

The vertical line test is the graphical twin of the x-scan and is the one your teacher will use on a coordinate plane. Plot each pair as a dot, then imagine a vertical line sliding left to right. If any vertical position contains two dots, the relation is not a function. Use this test when the question gives you a graph or asks you to sketch one from a table.

The question test is the quickest sanity check under exam pressure. Pick the repeated x, substitute it into the relation, and see whether two outputs appear. If they do, stop β€” you have your answer. If they don't, move to the next repeated value or conclude the set passes.

The Classic Easiest Case: A Repeated X With a Changed Y

The most common failing set looks like {(1, 2), (2, 4), (3, 6), (1, 8)}. Input 1 appears twice, with outputs 2 and 8. Two outputs for one input, so the set is not a function. That's the answer in one line, and it's the pattern most standardized tests build the distractors around.

A second worked example: {(0, 1), (1, 3), (2, 5), (3, 7), (1, 9)}. Scan the first coordinates β€” 0, 1, 2, 3, 1. The 1 repeats, and it carries 3 in one pair and 9 in another. Not a function. Note how the set is otherwise tidy and arithmetic-looking, which is exactly why students skim past the repeat.

A third: {(βˆ’3, 4), (βˆ’1, 0), (2, 4), (βˆ’3, βˆ’2)}. Here the y-value 4 appears twice at different inputs, which is fine, but βˆ’3 appears twice with outputs 4 and βˆ’2. The repeat input is the disqualifier; the repeat output is a decoy. Recognizing which column carries the violation is half the battle.

A fourth, slightly longer case: {(5, 6), (6, 6), (7, 6), (8, 6), (5, 0)}. Five pairs, four distinct inputs, one repeat at 5 with outputs 6 and 0. The verdict is not a function despite the tidy constant-output pattern. Long sets reward the x-scan because the eye is drawn to the repetition in the second column, which is legal.

These four examples share a structure: one repeated input, two different outputs, everything else irrelevant. Train your eye to check the first coordinate before anything else, and these items become five-second questions.

Failing Sets That Hide Their Violation in Ordering or Notation

Not every failing set announces itself. Rearranged pairs, table format, and interval notation can mask the same violation, and the masked version is where careless errors live.

Consider {(3, 7), (1, 2), (2, 5), (3, 7), (4, 9)}. The x-value 3 repeats, but the y-value stays 7 both times, so this set is a function. Now change a single digit: {(3, 7), (1, 2), (2, 5), (3, 0), (4, 9)}. The set is no longer a function, and nothing about the ordering or the length changed. That one-digit sensitivity is why you check the paired value, not just the repeat.

Tables hide repeats because the x-column isn't printed as coordinate pairs. A table showing x = 2, 4, 6, 2 with y = 8, 16, 24, 10 is the set {(2, 8), (4, 16), (6, 24), (2, 10)}, and it fails at x = 2. Read table rows as pairs before testing; the conversion takes seconds and prevents a wrong answer.

Interval notation and inequalities can also encode a non-function without any coordinate pair in sight, and many exams test this form. The vertical rule for inequalities is stated clearly in open course materials such as Lumen Learning's college algebra texts: an equation defines y as a function of x if, for every x in the domain, a vertical line crosses it no more than once. A relation like yΒ² = x fails this test because the input 4 returns both y = 2 and y = βˆ’2. The failure is the same one you spot in a pair list, dressed differently.

Disguised word problems behave the same way. If a table maps students to their biological mothers and two students share a mother, that's a function on students; if one student has two mothers listed, the mapping fails. Read the input column as the first coordinate no matter what the labels say.

Worked Example Set: Five Relations Graded in Under a Minute

Here's a graded set to practice against. Each verdict below is derivable by hand from the pairs shown, and every disqualified set has exactly one violation.

Relation Verdict Reason
{(1, 3), (2, 3), (3, 3), (4, 3)} Function Repeated output, no repeated input
{(βˆ’1, 1), (0, 0), (1, 1), (βˆ’1, 2)} Not a function βˆ’1 maps to 1 and 2
{(2, 4), (2, 4), (5, 25)} Function Duplicate pair, consistent assignment
{(a, 1), (b, 2), (c, 3), (d, 1)} Function Outputs repeat, inputs do not
{(0, 5), (1, 6), (0, 5), (2, 7), (1, 9)} Not a function 1 maps to 6 and 9; 0 is fine

The second row is the classic trap in table form. The first row is a constant function, one of the most common legitimate functions students misread as non-functions. The fourth row uses letters as inputs to show the rule has nothing to do with numbers β€” any set of distinct first elements with single assignments qualifies.

Row three deserves a note. A duplicated pair changes nothing about the assignment. Your teacher may still mark the set as a function, though some curricula ask students to remove duplicates for cleanliness. Don't let tidiness obscure the mathematical verdict.

Use this table as a self-check pattern. If a set has exactly one repeated input and that input carries two outputs, the verdict is immediate. If the repeat carries the same output, or if every input is distinct, the set passes. Three cases cover nearly every exam item you'll meet.

Repeated Y-Values Are Legal: The Misconception That Costs Points

The single biggest error on this topic is treating repeated outputs as disqualifying. They aren't. The set {(0, 4), (1, 4), (2, 4)} is a function, and it always has been, because each input still answers to exactly one output. That's a constant function, and it shows up on tests as a deliberate distractor.

Students conflate "one-to-one" with "function," and the confusion has a name. A one-to-one function requires distinct outputs for distinct inputs; functions only require single outputs per input. The Khan Academy unit on functions and the standard textbook definitions agree: the many-to-one direction is permitted. If your exam asks which set does not represent a function, any option with repeat y-values and distinct x-values is a wrong answer, and choosing it loses the point.

Run the check the same way every time. {(5, 1), (6, 1), (7, 1), (5, 2)} fails, and the repeat is at 5, not at 1. The repeated output is a bystander. Students who circle the 1 and stop get the wrong answer.

A second trap: confusing the pair count with the function question. A set with twelve pairs can be a function while a set with three pairs is not. Length tells you nothing. Only the input-output relationship matters, which is why the tests in the earlier table all scale to long sets without added complexity.

The fix is a two-second habit. Before choosing an answer, state the violation aloud: "input blank has outputs blank and blank." If you can't complete the sentence, the set is probably a function. If you can, you've found your answer and you can stop scanning.

What a Mapping Diagram and Table Reveal That a Pair List Hides

Diagrams surface violations that lists bury. Suppose a mapping diagram shows inputs 1, 2, 3 with arrows 1 β†’ 5, 2 β†’ 6, 3 β†’ 5, 3 β†’ 7. The list looks manageable, but the diagram makes the doubled exit arrow from 3 obvious at a glance. Two arrows leaving one input is the visual signature of a non-function, and it's the same violation as a repeated x with different y's.

Tables reveal a different kind of problem: the input column isn't labeled as the first coordinate, so students test the wrong column. A table with x = 4, 5, 6, 4 and y = 2, 3, 4, 9 is a non-function, but a table with x = 4, 5, 6, 7 and y = 2, 3, 2, 9 is a function. The two tables look alike until you isolate the repeated column and check its partner.

In both formats, draw arrows before you decide. On a table, small penciled arrows from each x to its y take ten seconds and make violations visible. On a diagram, count arrows leaving each input; one is acceptable, two is a failure. The physical act of drawing grooves the pattern better than rereading the numbers.

Teachers often ask for the domain and range alongside the verdict, which is another reason diagrams help. The domain is the set of first coordinates (no repeats needed in listing, though order is often ignored), and the range is the set of second coordinates. If the diagram's domain oval shows one input feeding two outputs, you can name the violation precisely when you justify your answer in writing.

Disqualified Relations in Scientific and Real-World Data

Real-world mappings fail this test constantly, and the failures are instructive. A weather table that lists one date twice with two different high temperatures isn't a function of date β€” either the table is a data-entry error or the variable isn't date at all. A payroll list that assigns one employee two pay rates is the same violation: one input, two outputs.

The scientific standard names the input variable the independent variable and the output the dependent variable, and it requires a single response per input. That's why experiments control for confounders: if a single condition produces two different measurements, the relation isn't deterministic, and the data has to be reported as a scatter of values rather than a function. The failure you see in a textbook pair set is the abstract form of that table problem.

A useful real case is a student roster mapping students to homerooms. Each student belongs to one homeroom, so the mapping is a function. Two students sharing a homeroom is fine. A student listed in two homerooms is not β€” same input, two outputs β€” and the office would correct the record rather than redefine the relationship. Business databases enforce the same rule under the name "unique key" or "functional dependency," which is the computer-science version of this lesson.

When you see a failing set in a word problem, the right response is usually to ask whether the data is flawed or the mapping direction is wrong. Swapping inputs and outputs often fixes the failure: a parent-many-children relation becomes a function when the input is the child and the output is the parent, though not when one child has two parents listed. Direction matters, and stating it is part of the answer.

Step-by-Step Method to Classify a Set Under Exam Time Pressure

Use this sequence on any item asking which set does not represent a function. It takes 15 to 30 seconds when practiced and survives nerves.

1: Read the answer choices and identify which column is the input (first coordinate or the x-labeled table column). 2: Scan or list the inputs and mark any repeat before doing anything else. 3: For each repeat, compare the paired outputs. Two different outputs means the set fails; identical outputs mean the set is still a function. 4: If no input repeats, the set passes β€” confirm the output column has no bearing. 5: If the question provides a graph or table, run the vertical line or column check as a backup.

Failure handling: if two sets fail, reread the question for the word "not" β€” most items ask for the one that fails, but some ask for the one that passes. If a table lacks column labels, treat the first column as input, which is the convention in textbooks. If a set contains a repeated pair with identical values and you're asked to justify the answer, write "duplicate pair represents one assignment" rather than marking it a failure.

The method's value is the ordering. Checking the input column first prevents the most common error, which is crossing off an answer because the outputs repeat. Steps 2 and 3 together do the whole job; incremental practice will shrink the total time to seconds.

The Historical Reason Textbooks Compare Inputs, Not Outputs

The modern definition of a function as a one-way assignment is usually credited to Leonhard Euler's 1755 notation f(x), which gave calculus a compact way to write "the value that depends on x." Before Euler, mathematicians such as Johann Bernoulli used "function of x" loosely for expressions built from x, not for the set of pairs you see in today's textbooks.

The set-theoretic definition you're tested on β€” a function as a set of ordered pairs with no repeated first coordinates β€” arrived in the twentieth century through the work of Kazimierz Kuratowski and others who grounded mathematics in sets. That's why your exam distinguishes the input column from the output column so strictly: the definition is built on order, not on the values themselves. Eulers notation is documented in standard histories of mathematics, and the Bourbaki-published set-theoretic definition is the ancestor of the textbook version.

The practical takeaway is that the direction of the pair matters more than the numbers in it. A set of pairs is function or not function independent of whether the values are whole numbers, fractions, letters, or names. Only the structure of the assignment counts, which is why a roster, a table of temperatures, and an abstract set of ordered pairs can all be tested with the same rule.

The historical sloppiness also explains a common exam trap: some old-style problems call a relation a function if its graph is one curve, which isn't the same as the modern single-input-single-output rule. On today's tests, follow the pair definition, and let the graph test confirm it.

FAQ

Is a repeated y-value enough to say the set is not a function? No β€” the repeated-output set {(1, 3), (2, 3), (3, 3)} is a function, and students lose points by choosing such options on exams, according to the definition used in the Khan Academy functions unit. The second coordinate may repeat freely because the rule constrains the first coordinate only. The only failing pattern is a repeated input carrying different outputs. If your exam option repeats y-values with distinct x-values, it's a legitimate function and not the answer to "does not represent a function."

What if a set contains the same pair twice? A duplicated pair such as {(2, 4), (2, 4)} passes the function test because input 2 still has exactly one output, 4. The repeat is redundant notation, not a violation, and most textbooks count it as a function while some ask students to remove duplicates for cleanliness. The verdict changes only if the duplicate's partner value differs, as in {(2, 4), (2, 5)}. Check the second value before deciding.

Could a set with no repeated x-values ever fail to be a function? Not under the ordered-pair definition β€” a set of pairs with all distinct first coordinates is automatically a function, regardless of how many times the outputs repeat. Failures in no-repeat-input sets come from other representations, such as an equation like yΒ² = x that produces two outputs for one input. When a set of pairs has no repeated input, the answer is "function" and you should stop scanning.

Which is a function: a table or a set of ordered pairs? They're tested identically once you convert the table into pairs, and a table with x-values 3, 4, 5, 3 and y-values 9, 16, 25, 9 is a function because the repeated input 3 keeps the output 9. Convert table rows to pairs first, then apply the repeated-input rule. The format doesn't change the definition, only the reading speed.

Does a vertical line test ever disagree with the input-check rule? No β€” the vertical line test is the graph version of the same rule, and the algebra resource on Lumen Learning states that an equation is a function when no vertical line crosses its graph more than once. A vertical crossing at two points means one x has two y's, which is the exact violation you catch by scanning pairs. Any disagreement means you plotted or read a coordinate wrong.

How does this change for domain and range questions? It doesn't change the function test, but domain questions often come bundled with it, and the domain is the set of first coordinates while the range is the set of second coordinates. A failing set still has a domain and a range; the labels describe the data, not whether the relation is a function. Some exams ask you to list the domain of a disqualified relation, so don't skip those parts.

Is one input with two outputs ever still called a function in advanced math? No β€” the definition is uniform across levels, though advanced courses may study relations that fail it and call them relations or multifunctions, a term used in complex analysis. A multifunction like the complex square root deliberately returns two branches, and that's marked as a different object from a function. For the exam question you're facing, treat every repeated input with a different output as a failure.

What's the fastest way to handle a multiple-choice set with ten pairs? Count distinct inputs and compare to the pair count; if distinct inputs number fewer than the pairs, at least one input repeats, and you check only that input rather than the whole list. This shortcut takes about five seconds on a ten-pair set and directs your attention precisely. It works because a function with n distinct inputs can carry any number of consistent pairs, but any extra repeat must be checked.