Configure the Function
Choose a family, set coefficients, and define the mapping intervals.
Formula Used
One-to-one: If f(x₁) = f(x₂), then x₁ = x₂.
Onto: For every y in the codomain, some x in the domain satisfies f(x) = y.
Bijective: The function must be both one-to-one and onto.
Numerical range: Range ≈ union of output intervals from valid sampled graph segments.
Coverage test: The merged output intervals must cover the complete selected codomain.
How to Use This Calculator
- Select the function family that matches your formula.
- Enter coefficients A through D. Unused coefficients are ignored.
- Set the domain interval you want to inspect.
- Define the codomain interval used for the onto test.
- Choose more samples for curves with rapid changes.
- Set tolerance and graph limits for your required precision.
- Press the button, then review the result and plotted segments.
Understanding Function Mappings
A function connects each allowed input with exactly one output. The range contains outputs the function actually reaches. Graphs make these relationships easier to inspect. They reveal turning points, gaps, repeated values, and boundary behavior.
What One-to-One Means
A function is one-to-one when different inputs never share one output. On a graph, the horizontal line test offers a quick check. Every horizontal line should meet the graph at most once. Strictly increasing functions usually pass. Strictly decreasing functions also pass. Curves with repeated heights usually fail.
What Onto Means
A function is onto when every value in the chosen codomain is reached. Onto status always depends on the declared codomain. A function may be onto one interval but not another. Compare the calculated range with the codomain limits. Missing output gaps show that surjectivity fails.
Why Domain Restrictions Matter
The same formula can behave differently on different domains. A quadratic fails the one-to-one test across its full symmetric domain. Restricting the domain to one side of its vertex can change that result. Trigonometric functions may become one-to-one on carefully selected intervals. Logarithmic and reciprocal functions also require valid input restrictions.
How Numerical Testing Works
This calculator samples many points across the selected domain. It evaluates valid outputs and separates broken graph segments. It checks whether each segment moves in one strict direction. It also compares segment ranges for overlap. Repeated sampled outputs suggest that injectivity fails. Dense sampling improves the strength of the conclusion.
The calculator then estimates the actual output range. Continuous segment ranges are merged. The merged intervals are compared with the requested codomain. Complete coverage suggests an onto mapping. Any uncovered codomain interval produces a warning. Numerical analysis is practical, but it is not a symbolic proof.
Reading the Graph
The plotted curve provides visual evidence for every result. Turning points often indicate repeated outputs. Flat sections can also break injectivity. Vertical gaps may separate valid branches. Horizontal coverage helps explain the range. Zoom mentally around boundaries and asymptotes. These areas often control the final classification.
Choosing Reliable Settings
Use a larger sample count for narrow turns or rapid oscillation. Choose a smaller tolerance when outputs are close together. Keep the domain realistic for the selected formula. Set codomain limits deliberately. They should represent the mapping you want to test. Review excluded inputs before accepting the result.
Practical Uses
One-to-one functions have inverses that are functions on their ranges. This matters in algebra, calculus, coding, modeling, and data transformation. Onto functions guarantee that every target value is attainable. Bijections satisfy both properties. They create complete reversible pairings between domain and codomain.
Final Interpretation
Treat the classification as a strong numerical estimate. Confirm important conclusions with algebraic reasoning. Derivatives can prove strict monotonicity. Equations can reveal repeated outputs. Range analysis can prove codomain coverage. Combining symbolic work with the graph gives the most dependable answer.
Frequently Asked Questions
1. What makes a function one-to-one?
A function is one-to-one when no two different domain values produce the same output. Its graph passes the horizontal line test. Strict increase or strict decrease across the entire domain is a common sufficient condition.
2. What does onto mean?
Onto means every value in the declared codomain is produced by at least one domain input. The actual range must therefore equal the codomain being tested.
3. Why does changing the codomain change the result?
Surjectivity compares the range with a specific codomain. A function may cover a smaller target interval completely while missing values in a larger target interval.
4. What is the horizontal line test?
Imagine drawing horizontal lines across the graph. The function is one-to-one when every such line intersects the graph no more than once within the selected domain.
5. Is numerical testing a formal proof?
No. Numerical testing gives strong evidence from sampled points. A formal proof may require algebra, derivatives, inverse reasoning, or exact range analysis.
6. How many samples should I use?
Start with several hundred samples. Increase the count for trigonometric curves, narrow turning points, steep growth, or domains containing behavior that changes quickly.
7. What does equality tolerance control?
Tolerance decides when nearby output values are treated as effectively equal. Smaller values demand stricter comparison. Extremely small values may expose floating-point noise.
8. Can domain restrictions make a function one-to-one?
Yes. Restricting a quadratic to one side of its vertex is a common example. Suitable restrictions can remove repeated outputs and create an inverse function.
9. Why are some graph points excluded?
Some formulas are undefined for certain inputs. Logarithms need positive arguments. Reciprocal functions exclude zero denominators. Overflowing or non-finite outputs are also excluded.
10. What is a bijective function?
A bijection is both one-to-one and onto. Every codomain value has exactly one matching domain value, creating a complete reversible pairing.
11. Does every one-to-one function have an inverse?
A one-to-one function has an inverse defined on its range. For the inverse to map the full declared codomain, the original function must also be onto that codomain.