31.3 Finite Domain Identification

Finite Domain Identification is the process of listing every distinct input value that belongs to a relation or function when that relation is defined by a limited, countable set of pairs rather than by a rule covering an unbroken range of numbers. Because a finite relation only ever involves a specific, fixed collection of inputs, its domain can be found simply by gathering every input value that actually appears across the relation's given pairs, without needing any of the interval-based reasoning required for relations defined by an algebraic rule over a continuous range.

This identification process applies across every representation discussed under relation representation recognition, since ordered pair lists, tables, mapping diagrams, and graphs made of separate points all encode the same underlying set of input values, just displayed in different visual or symbolic forms.

Domain Entries from Ordered Pairs

Reading Inputs Directly from Each Pair

When a relation is given as a list of ordered pairs, each pair's first coordinate is a member of the domain, so scanning through the list and recording every first coordinate produces the complete collection of domain entries before any further processing.

An Example of Extracting Domain Entries

From the ordered pair list $$\{\left(1,4\right),\left(2,5\right),\left(3,6\right)\}$$, the domain entries extracted are $$1$$, $$2$$, and $$3$$, taken directly from the first position of each listed pair.

Ignoring the Second Coordinate During This Step

While extracting domain entries, the second coordinate of each pair is set aside entirely, since it belongs to the range rather than the domain, and mixing the two would produce an incorrect list of input values.

Domain Entries from Table Inputs

Reading Inputs from the Input Column or Row

When a relation is given as an input-output table, the domain entries are the values listed in the column or row designated for inputs, read directly without needing to reference the paired output values at all.

An Example of Extracting Domain Entries From a Table

A table listing input values $$0$$, $$2$$, and $$4$$ alongside their corresponding outputs has a domain consisting of exactly those three listed input values, regardless of what the associated outputs happen to be.

Handling Tables With Non-Sequential Input Values

Table inputs are not required to follow any particular order or pattern, so domain identification from a table involves reading every listed input value exactly as given, even if the values do not increase steadily or follow an obvious numerical sequence.

Domain Entries from Mapping Sources

Reading Inputs from the Input Oval

When a relation is given as a mapping diagram, the domain entries are the values listed inside the input oval, corresponding to every value that has at least one arrow leaving it toward the output oval.

Distinguishing True Domain Entries From Unused Values

If the input oval of a mapping diagram happens to display a value with no arrow leaving it at all, that value is not actually part of the relation and is excluded from the domain, since domain membership requires participation in at least one ordered pair.

An Example of Extracting Domain Entries From a Mapping Diagram

Domain Entries from Finite Graph Points

Reading Inputs from Plotted Points

When a relation is given as a graph consisting of a finite collection of separate, isolated points rather than a continuous curve, the domain entries are the horizontal coordinates of each plotted point, read directly from the graph's axis.

Locating Horizontal Positions Precisely

Because domain entries from a graph depend on accurately reading each point's horizontal position, care must be taken to align each point with the correct axis value, particularly when points are plotted close together or the axis scale involves values other than whole numbers.

An Example of Extracting Domain Entries From Plotted Points

Points plotted at horizontal positions $$1$$, $$3$$, and $$5$$ on a coordinate grid contribute exactly those three values to the domain, regardless of their individual vertical positions.

Repeated Domain Value Removal

Why Repeats Can Occur During Extraction

Because a single input value can appear in more than one ordered pair, particularly for relations that are not functions, the raw extraction process described in the previous sections can produce a list containing the same domain value more than once.

Removing Duplicate Entries

Once every input value has been extracted from the given representation, any value that appears more than once in the raw list is reduced to a single entry, since the domain is defined as a set of distinct values rather than a list that tracks repetition.

An Example of Removing Repeats

Extracting inputs from the ordered pair list $$\{\left(2,4\right),\left(2,7\right),\left(5,9\right)\}$$ initially produces the raw list $$2$$, $$2$$, $$5$$, which is reduced to the final domain entries $$2$$ and $$5$$ after removing the repeated value.

Finite Domain Set Statement

Writing the Domain as a Set

Once all domain entries have been extracted and any repeats removed, the domain is written as a set enclosed in braces, listing each distinct input value exactly once, commonly arranged in increasing numerical order for clarity even though set membership does not require any particular order.

An Example of a Completed Domain Statement

The domain extracted from the earlier ordered pair example is written as $$\text{domain}=\{2,5\}$$, presenting the final result as a clean, unambiguous set of values.

Using the Domain Statement in Further Analysis

A correctly identified finite domain provides the necessary foundation for further work such as determining whether the relation is a function, since the domain establishes exactly which input values must be checked for the single-output condition described under function classification verification.