(a) Not one-one. Take a=2 and b=5. Both are positive, so sgn(2)=1=sgn(5) while 2=5. Two different amounts, one summary — so sgn is not one-one. (Indeed the summary loses the size of a transaction entirely.)
Not onto R. The definition produces only the three outputs 1,0,−1. So the value 7, say, has no preimage: there is no real x with sgn(x)=7. Hence sgn is not onto R.
Range. Every value of sgn is 1, 0 or −1, and all three occur: sgn(5)=1, sgn(0)=0, sgn(−3)=−1. So
range(sgn)={−1,0,1}.

(b) Reading the three branches of the definition backwards:
{x∈R:sgn(x)=1}={x∈R:x>0}=(0,∞),
{x∈R:sgn(x)=0}={x∈R:x=0}={0},
{x∈R:sgn(x)=−1}={x∈R:x<0}=(−∞,0).
They partition R. Two things must be checked.
Non-empty and pairwise disjoint: each set is non-empty (1, 0 and −1 belong to them respectively). No real number is both positive and zero, both positive and negative, or both negative and zero, so no two of the three sets share an element. (In general, preimages of different values can never overlap: if x lay in two of them, sgn(x) would equal two different numbers.)
Their union is R: every real number is positive, zero or negative, so every real number lies in one of the three sets.
Hence (−∞,0), {0}, (0,∞) is a partition of R into three blocks.
(c) Reflexive: sgn(a)=sgn(a), so (a,a)∈T for every a∈R.
Symmetric: if (a,b)∈T then sgn(a)=sgn(b), hence sgn(b)=sgn(a), so (b,a)∈T.
Transitive: if (a,b)∈T and (b,c)∈T then sgn(a)=sgn(b) and sgn(b)=sgn(c), so sgn(a)=sgn(c) and (a,c)∈T.
So T is an equivalence relation on R.
The classes. For any a∈R,
[a]={b∈R:sgn(b)=sgn(a)},
which is one of the three sets of part (b), according to the sign of a. Concretely
[5]=(0,∞),[0]={0},[−3]=(−∞,0),
and these are all the classes, because sgn takes no other values. Therefore
R/T={(−∞,0), {0}, (0,∞)},∣R/T∣=3.
The partition of part (b) and the classes here are literally the same three blocks: the classes of "same summary field" are exactly the preimages of the summary values.
(d) Onto {−1,0,1}. By part (a) the range of sgn is exactly {−1,0,1}, so with this codomain every element of the codomain is attained and sgn is onto.
Still not one-one. Shrinking the codomain changes nothing about the inputs: sgn(2)=sgn(5)=1 with 2=5, as in (a).
If sgn∣E:E→{−1,0,1} is a bijection then ∣E∣=3. Write s for this restriction.
Because s is onto, each of −1,0,1 has at least one preimage in E; pick e−1,e0,e1∈E with s(e−1)=−1, s(e0)=0, s(e1)=1. These three are distinct (they have different images), so ∣E∣≥3.
Because s is one-one, no value can have two preimages, so E contains at most one element mapping to each of −1,0,1, i.e. ∣E∣≤3.
Hence ∣E∣=3 exactly. Moreover E must contain exactly one negative amount, the amount 0 itself, and exactly one positive amount — so 0∈E necessarily.
A construction. Take
E={−2,0,7}.
Then sgn(−2)=−1, sgn(0)=0, sgn(7)=1: three inputs, three different outputs covering {−1,0,1}. So sgn∣E is one-one and onto, i.e. a bijection. (Any set consisting of one negative number, zero, and one positive number would do equally well.)
(e) The classes of TD. Compute the summary of each of the five amounts.
| amount a | −3 | −1 | 0 | 2 | 5 |
|---|
| sgn(a) | −1 | −1 | 0 | 1 | 1 |
Amounts with equal summaries are related, so the classes of TD are
{−3,−1},{0},{2,5}.
The size of TD. An ordered pair (a,b) lies in TD exactly when a and b sit in the same class, so TD is the union of the three full blocks {−3,−1}2, {0}2 and {2,5}2, which are disjoint. Adding their sizes,
∣TD∣=22+12+22=4+1+4=9.
(For comparison, ∣D×D∣=25, so 16 ordered pairs are not in TD — every pair that crosses between two directions.)
Counting the equivalence relations whose classes are single-direction. Such a relation is exactly a partition of D in which no block mixes two directions. A block cannot straddle {−3,−1}, {0} and {2,5}, so the partition must split each of those three groups separately, and any combination of such splits gives a valid partition of D. So the choices are independent and multiply:
| group | its possible partitions | how many |
|---|
| {−3,−1} | {{−3,−1}} or {{−3},{−1}} | 2 |
| {0} | {{0}} only | 1 |
| {2,5} | {{2,5}} or {{2},{5}} | 2 |
Hence the number of such equivalence relations is
2×1×2=4.
Listed out, they are:
- {−3,−1}, {0}, {2,5} — this is TD itself, with 9 pairs.
- {−3}, {−1}, {0}, {2,5} — 1+1+1+4=7 pairs.
- {−3,−1}, {0}, {2}, {5} — 4+1+1+1=7 pairs.
- {−3}, {−1}, {0}, {2}, {5} — the identity relation, 5 pairs.
Note that TD is the largest of the four: any single-direction equivalence relation on D is contained in TD, and refining a class can only remove pairs, never add them.