• 沒有找到結果。

The Real and Complex Number Systems

N/A
N/A
Protected

Academic year: 2022

Share "The Real and Complex Number Systems"

Copied!
4
0
0

加載中.... (立即查看全文)

全文

(1)

The Real and Complex Number Systems

Written by Men-Gen Tsai email: b89902089@ntu.edu.tw 1.

2.

3.

4.

5.

6. Fix b > 1.

(a) If m, n, p, q are integers, n > 0, q > 0, and r = m/n = p/q, prove that

(bm)1/n = (bp)1/q. Hence it makes sense to define br = (bm)1/n. (b) Prove that br+s = brbs if r and s are rational.

(c) If x is real, define B(x) to be the set of all numbers bt, where t is rational and t ≤ x. Prove that

br = sup B(r)

where r is rational. Hence it makes sense to define bx = sup B(x)

for every real x.

(d) Prove that bx+y = bxby for all real x and y.

1

(2)

Proof: For (a): mq = np since m/n = p/q. Thus bmq = bnp. By Theorem 1.21 we know that (bmq)1/(mn) = (bnp)1/(mn), that is, (bm)1/n = (bp)1/q, that is, br is well-defined.

For (b): Let r = m/n and s = p/q where m, n, p, q are integers, and n > 0, q > 0. Hence (br+s)nq = (bm/n+p/q)nq = (b(mq+np)/(nq))nq = bmq+np = bmqbnp = (bm/n)nq(bp/q)nq = (bm/nbp/q)nq. By Theorem 1.21 we know that ((br+s)nq)1/(nq) = ((bm/nbp/q)nq)1/(nq), that is br+s = bm/nbp/q = brbs.

For (c): Note that br ∈ B(r). For all bt ∈ B(r) where t is rational and t ≤ r. Hence, br = btbr−t ≥ bt1r−t since b > 1 and r − t ≥ 0. Hence br is an upper bound of B(r). Hence br = sup B(r).

For (d): bxby = sup B(x) sup B(y) ≥ btxbty = btx+ty for all rational tx ≤ x and ty ≤ y. Note that tx+ ty ≤ x + y and tx + ty is rational.

Therefore, sup B(x) sup B(y) is a upper bound of B(x + y), that is, bxby ≥ sup B(x + y) = b(x + y).

Conversely, we claim that bxbr = bx+r if x ∈ R1 and r ∈ Q. The following is my proof.

bx+r = sup B(x + r) = sup{bs : s ≤ x + r, s ∈ Q}

= sup{bs−rbr : s − r ≤ x, s − r ∈ Q}

= brsup{bs−r : s − r ≤ x, s − r ∈ Q}

= brsup B(x)

= brbx.

And we also claim that bx+y ≥ bx if y ≥ 0. The following is my proof:

2

(3)

(r ∈ Q)

B(x) = {br : r ≤ x} ⊂ {br : r ≤ x + y} = B(x + y), Therefore, sup B(x + y) ≥ sup B(x), that is, bx+y ≥ bx. Hence,

bx+y = sup B(x + y)

= sup{br : r ≤ x + y, r ∈ Q}

= sup{bsbr−s: r ≤ x + y, s ≤ x, r ∈ Q, s ∈ Q}

≥ sup{sup B(x)br−s : r ≤ x + y, s ≤ x, r ∈ Q, s ∈ Q}

= sup B(x) sup{br−s : r ≤ x + y, s ≤ x, r ∈ Q, s ∈ Q}

= sup B(x) sup{br−s : r − s ≤ x + y − s, s ≤ x, r − s ∈ Q}

= sup B(x) sup B(x + y − s)

≥ sup B(x) sup B(y)

= bxby

Therefore, bx+y = bxby. 7.

8.

9.

10.

11.

12.

13.

14.

3

(4)

15.

16.

17.

18.

19.

20.

21.

22.

23.

24.

25.

26.

27.

28.

29.

30.

4

參考文獻

相關文件

– Factorization is “harder than” calculating Euler’s phi function (see Lemma 51 on p. 406).. – So factorization is hardest, followed by calculating Euler’s phi function,

• A language has uniformly polynomial circuits if there is a uniform family of polynomial circuits that decide

• If we repeatedly run both Monte Carlo algorithms, eventually one definite answer will come (unlike RP). – A positive answer from the one without

• Adding restrictions on the allowable solutions (the solution space) may make a problem harder, equally hard, or easier.. • It is

• Adding restrictions on the allowable solutions (the solution space) may make a problem harder, equally hard, or easier.. • It is

• Hence it may surprise you that most of the complexity classes that we have seen so far have maximal elements. a Cook (1971) and

• If a graph contains a triangle, any independent set can contain at most one node of the triangle.. • We consider graphs whose nodes can be partitioned into m

D) radioactive cleavage E) radioactive merge Answer: B.. 5) The chart below shows the mass of a decaying nuclide versus time.. 47) The following is part of a