To prove: [a, b] > [c, d] text{if and only if} abd^2 - cdb^{2} in D^+. Given information: text{Acoording to the definition of "greater than,"} > text{is defined in Q by} [a, b] > [c, d] text{if and only if} [a, b] - [c, d] in Q^{+}

Transformation properties
asked 2021-02-18
To prove: \(\displaystyle{\left[{a},\ {b}\right]}\ {>}\ {\left[{c},\ {d}\right]}\ \text{if and only if}\ {a}{b}{d}^{{2}}\ -\ {c}{d}{b}^{{{2}}}\ \in{D}^{+}\).
Given information:
\(\displaystyle\text{Acoording to the definition of "greater than,"}\ {>}\ \text{is defined in Q by}\ {\left[{a},\ {b}\right]}\ {>}\ {\left[{c},\ {d}\right]}\ \text{if and only if}\ {\left[{a},\ {b}\right]}\ -\ {\left[{c},\ {d}\right]}\in{Q}^{{+}}\)

Expert Answers (1)


Formula used:
1) Greatest than definition:
Let D be an ordered integral domain with \(D^{+}\) as the set of positive elements. The relation greater than, denoted by >, is defined on elements x and y of D by
\(\displaystyle{x}\ {>}\ {y}\ \text{if and only if}\ {x}\ -\ {y}\ \in{D}^{+}\).
2) Property of greater that (>):
\(\displaystyle\text{If}\ {x}\ {>}\ {y}\ \text{and}\ {z}\ {>}\ {0},\text{then}\ {x}{z}\ {>}\ {y}{z}\)
\(\displaystyle\text{Let}\ {\left[{a},{b}\right]}\ {>}\ {\left[{c},{d}\right]}\)
\(\displaystyle\text{Then}\ {\left[{a},{b}\right]}-{\left[{c},{d}\right]}\in\ {Q}^{+}\)
\(\displaystyle\text{So},{\left[{a},{b}\right]}\ +\ {\left[-{c},{d}\right]}\in{Q}^{+}\)
\(\displaystyle\text{Therefore},{\left[{a}{d}\ -\ {b}{c},{b}{d}\right]}\in{Q}^{+}\)
\(\displaystyle\text{This implies that}{\left({a}{d}\ -\ {b}{c}\right)}{b}{d}\in{D}^{+}\)
\(\displaystyle\text{So},{a}{d}{b}^{{2}}\ -\ {c}{d}{b}^{{2}}\in{D}^{+}\)
\(\displaystyle\text{Let}\ {a}{b}{d}^{{2}}\ -\ {c}{d}{b}^{{2}}\in{D}^{+}\)
\(\displaystyle\text{Therefore},{\left({a}{d}\ -\ {b}{c}\right)}{b}{d}\in{D}^{+}\)
\(\displaystyle\text{So},{\left[{a}{d}\ -\ {b}{c},{b}{d}\right]}\in{Q}^{+}\text{as}\ {b}{d}\ne{q}{0}\)
\(\displaystyle\text{Then}{\left[{a},{b}\right]}\ +\ {\left[-{c},{d}\right]}\in{Q}^{+}\)
\(\displaystyle\text{Implies that}{\left[{a},{b}\right]}\ -\ {\left[{c},{d}\right]}\in{Q}^{+}\)
\(\displaystyle\text{Hence},{\left[{a},{b}\right]}\ {>}\ {\left[{c},{d}\right]}\)
\(\displaystyle\text{Therefore},{\left[{a},{b}\right]}\ {>}\ {\left[{c},{d}\right]}\text{if and only if}\ {a}{b}{d}^{{2}}\ -\ {c}{d}{b}^{{2}}\in{D}^{+}\)

Best answer

expert advice

Have a similar question?
We can deal with it in 3 hours

Relevant Questions

asked 2021-08-18
If \(\displaystyle{a},{b},{c},{d}\) are in continued properties, prove that
asked 2021-02-14
Dayton Power and Light, Inc., has a power plant on the Miami Riverwhere the river is 800 ft wide. To lay a new cable from the plantto a location in the city 2 mi downstream on the opposite sidecosts $180 per foot across the river and $100 per foot along theland.
(a) Suppose that the cable goes from the plant to a point Q on theopposite side that is x ft from the point P directly opposite theplant. Write a function C(x) that gives the cost of laying thecable in terms of the distance x.
(b) Generate a table of values to determin if the least expensivelocation for point Q is less than 2000 ft or greater than 2000 ftfrom point P.
asked 2020-11-27
To prove: \(\displaystyle{D}^{+}\subseteq{Q}^{+}\)
Given information:
\(\displaystyle\text{Each}\ {x}\ \in{D}\ \text{is identified with}\ {\left[{x},{e}\right]}\text{in Q}\)
asked 2021-02-25
We will now add support for register-memory ALU operations to the classic five-stage RISC pipeline. To offset this increase in complexity, all memory addressing will be restricted to register indirect (i.e., all addresses are simply a value held in a register; no offset or displacement may be added to the register value). For example, the register-memory instruction add x4, x5, (x1) means add the contents of register x5 to the contents of the memory location with address equal to the value in register x1 and put the sum in register x4. Register-register ALU operations are unchanged. The following items apply to the integer RISC pipeline:
a. List a rearranged order of the five traditional stages of the RISC pipeline that will support register-memory operations implemented exclusively by register indirect addressing.
b. Describe what new forwarding paths are needed for the rearranged pipeline by stating the source, destination, and information transferred on each needed new path.
c. For the reordered stages of the RISC pipeline, what new data hazards are created by this addressing mode? Give an instruction sequence illustrating each new hazard.
d. List all of the ways that the RISC pipeline with register-memory ALU operations can have a different instruction count for a given program than the original RISC pipeline. Give a pair of specific instruction sequences, one for the original pipeline and one for the rearranged pipeline, to illustrate each way.
Hint for (d): Give a pair of instruction sequences where the RISC pipeline has “more” instructions than the reg-mem architecture. Also give a pair of instruction sequences where the RISC pipeline has “fewer” instructions than the reg-mem architecture.