Example 17: Inverse of
Let be a function defined as , where Show that is invertible. Find the inverse.
Let . Then for some , so .
Define by . It is a function into , since .
For ,
and for ,
So and . Thus is invertible.
, .
Want the reason behind every step, the basics and the checks?
To undo "multiply by 4, then add 3", do the opposite steps in the opposite order: subtract 3, then divide by 4. That gives a candidate inverse . Definition 9 then asks us to check two things: undoing after doing gets back to the start (), and doing after undoing gets back to the start (). The careful choice of codomain (only the numbers of the form ) is what makes always a natural number.
- Given
- on , with codomain , the set of all natural numbers that can be written as with .
- To show and find
- That there is a function with and ; and a formula for that .
- Plan
- (1) List to see what it is. (2) Solve for to find the candidate . (3) Check that really maps into . (4) Verify for all . (5) Verify for all . (6) Conclude.
Basics you need
is the function : it leaves every element where it is. is the identity on and the identity on . Basics: what a function is
is invertible if there is a function with and . Then is called the inverse . Equivalently (as the book notes), is invertible exactly when it is one-one and onto.
: apply first, then .
The set for some means "all natural numbers for which there is at least one natural with ". Basics: sets
One-one: . Onto: every element of the codomain is of something. Basics: one-one and onto
Solution
See what is
Put into :
So : the natural numbers that are 3 more than a positive multiple of 4. Numbers such as are not in .
By its very definition, is the set of values of . So maps into , and every element of is reached: is onto .
The codomain is deliberately not . If it were , the number 8 (for instance) would need a natural with , that is , which is not natural. So would not be onto, and not invertible. Shrinking the codomain to exactly the set of outputs removes that problem.The range of a function is the set of its actual outputs. When the codomain is chosen equal to the range, the function is automatically onto. Basics: one-one and ontoFind the candidate inverse by solving for
Take an arbitrary . By the definition of , for some in . Solve this for :
So define by
An inverse must take each output back to the input that produced it. Solving for does exactly that. We subtract 3 first and divide by 4 second because did the reverse: it multiplied by 4 first and added 3 second. Undoing goes in the opposite order, like taking off shoes before socks.To undo a sequence of operations, apply the opposite operations in the reverse order. Subtracting the same number from both sides, or dividing both sides by the same non-zero number, keeps an equation true.Check that really sends into
For there is an with . Then
Also this is the only one: if , then , so . Hence is a single, well-defined natural number for each , and is a genuine function from to .
The formula could produce fractions or zero or negatives for some numbers (, ). Before calling a function into , we must show that for the allowed inputs, the elements of , it always gives a natural number. It does, because every element of has the form with natural. The uniqueness line shows that is one-one, so there is never a choice to make.A function must give exactly one output, lying in , for every input in . Basics: what a function isVerify
Take any . Then
So for every , that is .
This says: start with a natural number, apply , then apply , and you are back where you started. Because was arbitrary, the calculation holds for every natural number at once.Two functions are equal when they agree at every point of the domain. Here and agree at every .Verify
Take any . Then
So for every , that is .
Blue arrows: sends to . Gold arrows: sends each of these straight back. Going down and then up returns every (this is ); going up and then down returns every (this is ). Definition 9 asks for both identities, and they say different things. says undoes ; says undoes . The second one needs to be a legal input for , which is why Step 3 (showing ) had to come first.Conclude
We have found with and . By Definition 9, is invertible and for .
The book also mentions a shortcut: a function is invertible exactly when it is one-one and onto. We have in fact seen both properties on the way: onto in Step 1 and one-one in Step 3. But finding and checking the two identities does more: it proves invertibility and gives the inverse in one go.
, , is invertible. Its inverse is because for all and for all . This agrees with the textbook's solution.
Take : , and . Then . ✓ Going the other way, take . Is it in ? , yes. Then and . ✓ The verification script repeats this round trip for every from 1 to 2000 and every element of below 8000.
- Taking the codomain to be . Then is not onto (8 has no preimage) and not invertible. The question deliberately uses .
- Undoing in the wrong order, for example writing . Check: .
- Checking only one identity. Definition 9 needs both and .
- Forgetting that must land in . Without Step 3, might not be a function from to at all.
- Writing . is the inverse function, not the reciprocal .
- To find an inverse, solve for . Then check and .
- Invertibility depends on the codomain. The same rule is invertible onto but not onto .
- Invertible one-one and onto. Constructing proves it and finds the inverse at the same time.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Definition of composition | Steps 4, 5 | Definition 8, Section 1.4 (Lesson: composition) |
| Definition of invertible; identity functions | Steps 4–6 | Definition 9, Section 1.4 (Lesson: invertible functions) |
| Invertible one-one and onto | Step 6 | Paragraph after Definition 9, Section 1.4 |
| One-one, onto | Steps 1, 3 | Definitions 5 and 6, Section 1.3 (Lesson: types of functions) |
| Solving a linear equation | Step 2 | Algebra |
| All numerical values, | Steps 1, 3; Check | Recomputed in the site's verification script |
Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →