Beta. Content is under active construction and has not been peer-reviewed. Report errors on
GitHub
.
Disclaimer
Theorem
Path
Curriculum
Paths
Demos
Diagnostic
Search
Quiz Hub
/
Sets, Functions, and Relations
Sets, Functions, and Relations
3 questions
Difficulty 2-3
View topic
Foundation
0 / 3
3 foundation
Adapts to your performance
1 / 3
foundation (2/10)
state theorem
A function
f
:
A
→
B
is injective (one-to-one) if distinct inputs map to distinct outputs, and surjective (onto) if every element of
B
has a preimage. What is a bijection?
Hide and think first
A.
A function whose graph is symmetric around the line
y
=
x
, making it self-inverse
B.
A function that maps every element of
A
to a different element of
B
, regardless of whether all elements of
B
are reached
C.
A function that is both injective and surjective, so it is invertible with a unique inverse
f
−
1
:
B
→
A
D.
A function with the same number of elements in its domain and codomain, regardless of how they map
Submit Answer