Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 76 of 80

A bank's ledger software records, for each transaction, its net effect x on the balance, a real number of rupees.

Question 764 marksHard

A bank's ledger software records, for each transaction, its net effect xx on the balance, a real number of rupees. Instead of storing xx itself, a summary field stores only the direction of the transaction, computed by the signum function

sgn⁡:R→R,sgn⁡(x)={1,x>00,x=0−1,x<0.\operatorname{sgn}:\mathbb{R}\to\mathbb{R},\qquad \operatorname{sgn}(x)=\begin{cases}1,& x>0\\ 0,& x=0\\ -1,& x<0.\end{cases}

Two transactions are said to be indistinguishable in the summary when they get the same summary field. This defines a relation on R\mathbb{R}:

T={(a,b)∈R×R: sgn⁡(a)=sgn⁡(b)}.T=\{(a,b)\in\mathbb{R}\times\mathbb{R}:\ \operatorname{sgn}(a)=\operatorname{sgn}(b)\}.

One day's ledger contains the five amounts D={−3, −1, 0, 2, 5}D=\{-3,\,-1,\,0,\,2,\,5\}.

Attempt any four of the following five sub-questions.

(a) Show that the summary field throws information away: sgn⁡\operatorname{sgn} is not one-one and not onto R\mathbb{R}. Give two specific transaction amounts for the first and one specific unreachable value for the second, and state the range of sgn⁡\operatorname{sgn}.

(b) Find the sets {x∈R:sgn⁡(x)=1}\{x\in\mathbb{R}:\operatorname{sgn}(x)=1\}, {x∈R:sgn⁡(x)=0}\{x\in\mathbb{R}:\operatorname{sgn}(x)=0\} and {x∈R:sgn⁡(x)=−1}\{x\in\mathbb{R}:\operatorname{sgn}(x)=-1\} — the three pools of transaction amounts that share each summary value — and prove that these three sets partition R\mathbb{R}.

(c) Prove that TT is an equivalence relation on the set of possible transaction amounts, and identify the set of all equivalence classes of TT (written R/T\mathbb{R}/T) with the three pools of part (b). How many elements does R/T\mathbb{R}/T have — that is, how many transaction directions can the ledger tell apart?

(d) The engineers replace the codomain by {−1,0,1}\{-1,0,1\}. Show that sgn⁡\operatorname{sgn} is then onto but still not one-one. Prove that if a subset E⊆RE\subseteq\mathbb{R} is such that sgn⁡\operatorname{sgn} restricted to EE is a bijection onto {−1,0,1}\{-1,0,1\}, then EE has exactly three elements, and construct one such EE.

(e) Let TD=T∩(D×D)T_D=T\cap(D\times D). Write the classes of TDT_D and compute ∣TD∣|T_D|. Then count the equivalence relations on DD every one of whose classes consists of amounts of a single direction, and justify the count.