NGUY

N H

U
,
U I
,
N
M

U CU TO

AN H
.
OC
ANH - VI
.
T
B
,
an 2.0
NH
`
A XU

T B
,
AN GI

AO D
.
UC
51
GD-05
89/176-05 M a s

: 8I092M5
L
`
o
,
i n oi

d
`
u
y l` a b
,
an nh ap c ac thu
.
t ngu
,
to an h
.
oc. M
.
uc dch kh
,
o
,
i d
`
u cho c ac b
.
an m o
,
i vi

t b` ai cho
c ac b ao. T
.
p s ach g
`
m c ac ph
`
n
1. Ph
`
n c ac thu
.
t ngu
,
2. Ph
`
n m
.
t s

ch u y ngu
,
ph ap
3. M
.
t s

c ac d
.
oc ky hi
.
u v` a cng th u
,
c
4. C ac ky hi
.
u to an chu
,
n so
.
an b
`
ang LaTeX
5. Nhu
,
ng y ki

n hay v
`
vi

t b ao ti

ng anh v` a c ach tr`nh b

`
y ch ung.
y ch
,
l` a b
,
an nh ap, c` on r

t nhi
`
u n
.
i dung chu
,
a du
,
a v` ao dy v` a c ung chu
,
a du
,
.
o
,
c ch
.
on
l
.
oc, mong c ac b
.
an cho y ki

n.
H` a N
.
i, ng` ay 13 th ang 9 n am 2014
Nguy

n Hu
,
u i
,
n
M
.
uc l
.
uc
L` o
,
i n oi d
`
u. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
M
.
uc l
.
uc. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
Ch
,
u d
`
1. Introduction - Gi o
,
i thi
.
u . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
Ch
,
u d
`
2. Acknowlegments - Bi

t o
,
n . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
Ch
,
u d
`
3. Notations - K y hi
.
u. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
Ch
,
u d
`
4. Assumptions - Gi
,
a thi

t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
Ch
,
u d
`
5. Denition -
.
inh ngha. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25
Ch
,
u d
`
6. Theorem -
.
inh l y. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
6.1. Theorem formulation - Ph at bi
,
u d
.
inh ly . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
6.2. Theorem introductory - Gi o
,
i thi
.
u c
,
ua d
.
inh ly . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
6.3. Theorem remarks - Nhu
,
ng ch u y c
,
ua d
.
inh ly . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
Ch
,
u d
`
7. Proofs - Ch u
,
ng minh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
7.1. Proof Arguments - C ac l
.
p lu
.
n ch u
,
ng minh. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
7.2. Proof Begin - B

at d
`
u ch u
,
ng minh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38
7.3. Proof Conclusion - K

t lu
.
n c
,
ua ch u
,
ng minh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
7.4. Proof Sufcient - Ch u
,
ng minh di
`
u ki
.
n d
,
u . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
7.5. Proof Easily - Ch u
,
ng minh di
`
u ki
.
n d
,
u . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
7.6. Proof Property - Ch u
,
ng minh tnh ch

t . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42
Ch
,
u d
`
8. Proof steps - C ac bu
,
o
,
c ch u
,
ng minh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 46
Ch
,
u d
`
9. References - T` ai li
.
u tra c u
,
u . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
Ch
,
u d
`
10. M
.
t s

quy t

ac d
.
oc k y hi
.
u . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
10.1. C ac ky hi
.
u cng th u
,
c chung . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
10.2. Ky hi
.
u chuyn ng` anh. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
10.2.1. Logic . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
10.2.2. Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
10.2.3. Order . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
10.2.4. Algebra. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
10.2.5. Topology . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
10.2.6. Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
10.2.7. Probability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
Ch
,
u d
`
11. M
.
t s

quy t

ac ngu
,
ph ap . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
11.1. Ch u y m
.
ao t`u
,
x ac d
.
inh . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
M
.
UC L
.
UC 5
11.2. Ch u y m
.
ao t`u
,
khng x ac d
.
inh. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63
11.3. Ch u y b
,
o qua m
.
ao t`u
,
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65
CH
,
U
`
1
Introduction - Gi

o
,
i thi
.
u
1. We prove that in some families of
compact there are no universal ele-
ments.
1. Ta ch u
,
ng minh r
`
ang trong m
.
t s

h
.
o
compact khng t
`
n t
.
ai c ac ph
`
n t
,
u
,
to` an th
,
.
2. It is also shown that... 2. N o c ung ch
,
ra r
`
ang
3. Some relevant counterexamples are
indicated.
3. M
.
t s

th d
.
u c o lin quan du
,
.
o
,
c ch
,
ra.
4. We wish to investigate ... 4. Ta mu

n kh
,
ao s at ....
5. Our purpose is to ... 5. M
.
uc dch c
,
ua ch ung ta l` a ...
6. It is of interest to know whether... 6. i
`
u quan tm du
,
.
o
,
c bi

t khi m` a...
7. We are interested in nding ... 7. Ta quan tm t o
,
i vi
.
c t`m ki

m ...
8. It is natural to try to relate to ... 8. i
`
u t
.
u
,
nhin l` a th
,
u
,
quan h
.
v o
,
i ...
9. This work was intended as an attempt
to motivate (at motivating) ...
9. Cng tr`nh n` ay du
,
.
o
,
c ch u y nhu
,
s
.
u
,
c

ang th uc d
,
y ...
10. The aim of this paper is to bring to-
gether two areas in which ...
10. M
.
uc dch c
,
ua b` ai b ao n` ay l` a k

t h
.
o
,
p
hai lnhx v
.
u
,
c trong d o m` a ....
11. we review some of the standard facts
on ...
11. Ta t
,
ng quan l
.
ai m
.
t s

du
,
ki
.
n co
,
b
,
an
trn ....
12. we have compiled some basic facts ... 12. Ta d a k

t h
.
o
,
p m
.
t s

u t

co
,
b
,
an
13. we summarize without proofs the rel-
evant material on ...
13. Ta t om t

at khng ch u
,
ng minh v
.
t ch

t
c o lin quan trn ...
14. we give a brief exposition of ... 14. Ta du
,
a ra gi
,
ai thch ng

an v
`
...
15. we briey sketch ..... 15. Ta t om t

at ...
16. we set up notation and terminology. 16. Ta du
,
a ra ky hi
.
u v` a d
.
inh ngha.
17. we discuss (study/treat/examine) the
case...
17. Ta th
,
ao lu
.
n tru
,
`o
,
ng h
.
o
,
p ....
18. we introduce the notion of 18. Ta gi o
,
i thi
.
u ky hi
.
u c
,
ua
19. we develop the theory of ... 19. Ta ph at tri
,
n d
.
inh ly c
,
ua ....
20. we will look more closely at ... 20. Ta xem xet v

n d
`
g
`
n v o
,
i ....
21. we will be concerned with ... 21. Ta se th
.
u
,
c hi
.
n lin quan v o
,
i ...
22. it is shown that some of the recent re-
sults are ...
22. i
`
u n` ay ch
,
ra r
`
ang m
.
t s

t qu
,
a
hi
.
n th`o
,
i l` a ...
23. it is shown that reviewed in a more
general setting,
23. i
`
u n` ay ch
,
ra s
.
u
,
t
,
ng quan trong
vi
.
c thi

t l
.
p t
,
ng quan ho
,
n,
24. it is shown that some applications are
indicated,
24. i
`
u n` ay cho th

y m
.
t s
u
,
ng d
.
ung
du
,
.
o
,
c ch
,
ra,
25. it is shown that our main results are
stated and proved.
25. i
`
u n` ay ch
,
ra k

t qu
,
a chnh c
,
ua
ch ung ta d a du
,
.
o
,
c ph at bi
,
u v` a ch u
,
ng
minh.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 7
26. Section 4 contains a brief summary (a
discussion) of ...
26. o
.
an 4 c o t
,
ng quan ng

an (m
.
t th
,
ao
lu
.
n) c
,
ua ...
27. Section 4 deals with (discusses) the
case
27. o
.
an 4 d
`
c
.
p t o
,
i tru
,
`o
,
ng h
.
o
,
p n` ay
(th
,
ao lu
.
n)
28. Section 4 is intended to motivate our
investigation of ...
28. o
.
an 4 ly do th uc d
,
y nghin c u
,
u c
,
ua
ch ung ti theo ...
29. Section 4 is devoted to the study of ... 29. o
.
an 4 d` anh cho vi
.
c nghin c u
,
u c
,
ua
...
30. Section 4 provides a detailed exposi-
tion of ...
30. o
.
an 4 Cung c

p s
.
u
,
m t
,
a chi ti

t c
,
ua
...
31. Section 4 establishes the relation be-
tween ...
31. o
.
an 4 thi

t l
.
p quan h
.
giu
,
a ...
32. Section 4 presents some preliminaries. 32. o
.
an 4 tr`nh b` ay m
.
t s

n d
`
kh
,
o
,
i
d
`
u.
33. We will touch only a few aspects of the
theory.
33. Ta se d
`
c
.
p d

n m
.
t v` ai kha c
.
anh c
,
ua
d
.
inh ly.
34. We will restrict our attention (the dis-
cussion/ourselves) to ...
34. Ta se gi o
,
i h
.
an ch u y c
,
ua ch ung ta (th
,
ao
lu
.
n c
,
ua ch ung ta) t o
,
i ...
35. It is not our purpose to study 35. y khng ph
,
ai l` a m
.
uc dch c
,
ua ch ung
ta nghin c u
,
u.
36. No attempt has been made here to de-
velop
36. Ta khng n

l
.
u
,
c d
,
ph at tri
,
n
,
o
,
dy.
37. It is possible that but we will not de-
velop this point here.
37. o l` a di
`
u c o kh
,
a n ang, nhu
,
ng ta
khng ph at tri
,
n di
,
m d o
,
o
,
dy.
38. A more complete theory may be ob-
tained by...
38.
.
inh ly d
`
y d
,
u ho
,
n c o th
,
nh
.
n du
,
.
o
,
c
t`u
,
...
39. However, this topic exceeds the scope
of this paper,
39. Tuy nhin, ch
,
u d
`
n` ay vu
,
.
o
,
t qu a lnh
v
.
u
,
c c
,
ua b` ai b ao n` ay,
40. However, we will not use this fact in
any essential way.
40. Tuy nhin, ta se khng d` ung du
,
ki
.
n
n` ay trong m
.
oi c ach c
`
n thi

t.
41. The basic (main) idea is to apply ... 41.

Y tu
,
,
o
,
ng co
,
s
,
o
,
(chnh) l` a ap d
.
ung ...
42. The basic (main) geometric ingredient
is...
42.

Y tu
,
,
o
,
ng co
,
s
,
o
,
(chnh) h`nh h
.
oc h
.
o
,
p
th` anh l` a ...
43. The crucial fact is that the norm satis-
es
43. Y

u t

ch
,
u y

u l` a chu
,
n th
,
oa m an ...
44. Our proof involves looking at 44. Ch u
,
ng minh c
,
ua ch ung ta bao h` am
xem xet ...
45. The proof is based on the concept of
similar in spirit to
45. Ch u
,
ng minh d
.
u
,
a trn co
,
s
,
o
,
kh ai ni
.
m
tu
,
o
,
ng t
.
u
,
trong tinh th
`
n
46. The proof is adapted from 46. Ch u
,
ng minh du
,
.
o
,
c b
,
sung thm t`u
,
47. This idea goes back at least as far as 47. Tu
,
tu
,
,
o
,
ng n` ay di ngu
,
.
o
,
c l
.
ai t nh

t l` a xa
ho
,
n
48. We emphasize that 48. Ta nh

n m
.
anh r
`
ang
49. It is worth pointing out that 49. Ta ch
,
thm r
`
ang
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 8
50. The important point to note here is
the form of
50. i
,
m quan tr
.
ong ch u y
,
o
,
dy l` a d
.
ang
c
,
ua
51. The advantage of using lies in the fact
that
51. Thu
.
n l
.
o
,
i d` ung du
,
.
o
,
c n
`
am trong s
.
u
,
ki
.
n l` a ....
52. The estimate We obtain in the course
of proof seems to be of independent
interest.
52. S
.
u
,
d anh gi a ta nh
.
n du
,
.
o
,
c qu a tr`nh
ch u
,
ng minh l` a d
.
c l
.
p r

t hay.
53. Our theorem provides a natural and
intrinsic characterization of
53.
.
inh ly c
,
ua ch ung ta cung c

p m
.
t d
.
ac
tnh t
.
u
,
nhin v` a kh ac bi
.
t c
,
ua ....
54. Our proof makes no appeal to 54. Ch u
,
ng minh c
,
ua ch ung ta khng tun
theo ...
55. Our viewpoint sheds some new light
on
55. Theo quan di
,
m c
,
ua ch ung ti th

y
s ang ln di
,
m m o
,
i trn
56. Our example demonstrates rather
strikingly that
56. V d
.
u c
,
ua ch ung ta minh ch u
,
ng ch
.
at
che ho
,
n l` a
57. The choice of seems to be the best
adapted to our theory.
57. Ch
.
on nhu
,
ng ph
`
n c
.
p nh
.
t t

t nh

t
c
,
ua d
.
inh ly.
58. The problem is that 58. B` ai to an ngha l` a
59. The main difculty in carrying out this
construction is that
59. Ph
`
n kh o nh

t chnh nu ra trong s
.
u
,
xy d
.
u
,
ng n` ay l` a
60. In this case the method of breaks
down.
60. Trong tru
,
`o
,
ng h
.
o
,
p n` ay phu
,
o
,
ng ph ap
m

t t ac d
.
ung.
61. This class is not well adapted to 61. L o
,
p n` ay khng du
,
.
o
,
c c
.
p nh
.
t t

t t`u
,
62. Pointwise convergence presents a
more delicate problem.
62. H
.
i t
.
u theo t`u
,
ng di
,
m th
,
hi
.
n b` ai
to an th u v
.
i ho
,
n.
63. The results of this paper were an-
nounced without proofs in [8].
63. C ac k

t qu
,
a c
,
ua b` ai b ao n` ay d a thng
b ao khng ch u
,
ng minh trong [8].
64. The detailed proofs will appear in [8]
(elsewhere/in a forthcoming publica-
tion).
64. C ac ch u
,
ng minh chi ti

t se ra trong
[8].
65. For the proofs we refer the reader to
[6].
65. V o
,
i ch u
,
ng minh ta tham chi

u b
.
an d
.
oc
d

n [6]
66. It is to be expected that 66. N o du
,
.
o
,
c ch`o
,
d
.
o
,
i hy v
.
ong
67. One may conjecture that 67. Ngu
,
`o
,
i ta c o th
,
gi
,
a thuy

t r
`
ang
68. One may ask whether this is still true
if
68. Ngu
,
`o
,
i ta c o th
,
h
,
oi di
`
u n` ay v

n c` on
d ung n

u
69. One question still unanswered is
whether
69. M
.
t cu h
,
oi v

n khng c o cu tr
,
a l`o
,
i
l` a
70. The afrmative solution would allow
one to
70. L`o
,
i gi
,
ai tch c
.
u
,
c se cho phep ngu
,
`o
,
i ta
d
,
71. It would be desirable to but we have
not been able to do this.
71. N o l` a kh at v
.
ong nhu
,
ng ta khng c o
kh
,
a n ang l` am di
`
u d o.
72. These results are far from being con-
clusive.
72. Nhu
,
ng k

t qu
,
a n` ay c` on xa v o
,
i k

t lu
.
n
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 9
73. This question is at present far from be-
ing solved.
73. Cu h
,
oi n` ay th
,
hi
.
n c` on xa m o
,
i gi
,
ai
quy

t du
,
.
o
,
c.
74. Our method has the disadvantage of
not being intrinsic.
74. Phu
,
o
,
ng ph ap c
,
ua ch ung ta khng tr
.
i
ho
,
n nhu
,
ng phu
,
o
,
ng ph ap kh ac.
75. The solution falls short of providing
an explicit formula.
75. L`o
,
i gi
,
a cho c ach ng

an g
.
on cng th u
,
c
hi
,
n.
76. What is still lacking is an explicit de-
scription of
76. Nhu
,
ng g` v

n c` on thi

u l` a m
.
t m t
,
a
r o r` ang c
,
ua
77. As for prerequisites, the reader is ex-
pected to be familiar with
77.

i v o
,
i di
`
u ki
.
n tin quy

t , ngu
,
`o
,
i
d
.
oc se ph
,
ai l` am quen v o
,
i
78. The rst two chapters of constitute
sufcient preparation.
78. Hai chu
,
o
,
ng d
`
u tin t
.
ao nn chu
,
n b
.
i
d
`
y d
,
u
79. No preliminary knowledge of is re-
quired.
79. Khng c o ki

n th u
,
c so
,
b
.
l` a c
`
n thi

t
80. To facilitate access to the individual
topics, the chapters are rendered as
self-contained as possible.
80.
,
t
.
ao di
`
u ki
.
n thu
.
n l
.
o
,
i cho truy
c
.
p d

n c ac ch
,
u d
`
ring nhn , c ac
chu
,
o
,
ng du
,
.
o
,
c t
.
u
,
xem c o th
,
.
81. For the convenience of the reader we
repeat the relevant material from [7]
81. Cho s
.
u
,
ti
.
n l
.
o
,
i c
,
ua ngu
,
`o
,
i d
.
oc , ch ung
ta l
.
ap l
.
ai c ac t` ai li
.
u c o lin quan t`u
,
[7]
82. without proofs, thus making our expo-
sition self-contained.
82. khng ch u
,
ng minh , do d o l` am cho th
,
hi
.
n t
.
u
,
l` am c
,
ua ch ung ti.
83. The aim of this paper is ... 83. M
.
uc tiu c
,
ua b` ai n` ay l` a ...
84. The purpose of this paper is ... 84. M
.
uc dch c
,
ua b` ai n` ay l` a ...
85. In this paper we shall be concerned
with ...
85. Trong b` ai n` ay ta se d
`
c
.
p t o
,
i ...
86. The paper addresses one of these
questions.
86. B` ai n` ay b` an v
`
m
.
t trong nhu
,
ng v

n
d
`

y.
87. we shall deal with ... 87. Ch ung ta se b` an v
`
...
88. We propose in this paper to desirable
...
88. Trong b` ai n` ay ta d
`
c
.
p d

n vi
.
c m
t
,
a ....
89. The paper deals with this and some
closely rolated problems.
89. B` ai n` ay xet t o
,
i v

n d
`
d o v` a m
.
t s

n d
`
kh ac c o lin quan ch
.
at che v o
,
i
n o.
90. The present section will be devoted to
developing a method ...
90. M
.
uc n` ay du
,
.
o
,
c d` anh d
,
xy d
.
u
,
ng
phu
,
o
,
ng ph ap ...
91. This paper presents some results con-
cerning ...
91. B` ai n` ay tr`nh b
`
y m
.
t s

t qu
,
a v
`
92. The problem to be considered in this
paper is that of designing ...
92. V

n d
`
se du
,
.
o
,
c d
`
c
.
p trong b` ai n` ay l` a
vi
.
c thi

t k

...
93. The paper is intended to emphasize ... 93. B` ai b ao nh
`
am nh

n m
.
anh ...
94. The problem of concern is ... 94. V

n d
`
ta quan tm l` a ...
95. Specically, the paper is concerned
with the description of ...
95. C
.
u th
,
, b` ai b ao d
`
c
.
p d

n vi
.
c m t
,
a
...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 10
96. Such questions are worth careful at-
tention.
96. Nhu
,
ng v

n d
`
nhu
,
th

d ang du
,
.
o
,
c ch u
y c
,
n th
.
n.
97. The problem has received much (lit-
tle) attention from ...
97. V

n d
`
d a nh
.
n du
,
.
o
,
c nhi
`
u (t) s
.
u
,
quan tm c
,
ua ...
98. This problem has attracted much (a
great deal of) attention.
98. V

n d
`
n` ay d a thu h ut du
,
.
o
,
c nhi
`
u s
.
u
,
ch u y.
99. Up to now ... 99. Cho d

n nay ...
100. Up to the present ... 100. Cho d

n nay ...
101. In recent years ... 101. Trong m

y n am g
`
n dy ...
102. Since the appearance of the paper, ... 102. T`u
,
khi xu

t hi
.
n b` ai b ao

y ...
103. Since the publication of these results,
...
103. T`u
,
khi cng b

nhu
,
ng k

t qu
,
a

y, ...
104. It is well known that ... 104. M
.
oi ngu
,
`o
,
i d
`
u bi

t r o r
`
ang ...
105. It has long been known that ... 105. Ngu
,
`o
,
i ta d a bi

t t`u
,
lu l` a ...
106. To our knowledge ... 106. Theo ch

hi
,
u bi

t c
,
ua ch ung ti ...
107. as far as we know ... 107. nhu
,
ch ung ti bi

t ...
108. The best known method ... 108. Phu
,
o
,
ng ph ap du
,
.
o
,
c bi

t nhi
`
u nh

t...
109. ... a long known theorem 109. ... m
.
t d
.
inh ly d a bi

t t`u
,
lu
110. ... a little known result of ... 110. ... m
.
t k

t qu
,
a t du
,
.
o
,
c bi

t c
,
ua ...
111. ... a long standing problem 111. ... m
.
t v

n d
`
t
`
n t
.
ai t`u
,
lu
112. In order to study ... 112.
,
nghin c u
,
u ...
113. The present paper is a contnuation of
an earlier one.
113. B` ai n` ay l` a ti

p t
.
uc c
,
ua m
.
t b` ai tru
,
o
,
c.
114. We shall restrict ourselves to the case
...
114. Ta se t
.
u
,
gi o
,
i h
.
an trong tru
,
`o
,
ng h
.
o
,
p ...
115. For convenience, we shall restrict our-
selves to problem with ... only, the in-
clusion of ... causes no difculties, and
all of the results go through with mi-
nor modications.
115.
,
thu
.
n ti
.
n, ta ch
,
h
.
an ch

trn v

n
d
`
v o
,
i ..., vi
.
c du
,
a thm ... v` ao khng
gy thm kh o kh an g`, v` a t

t c
,
a k

t
qu
,
a c` on d ung v o
,
i v` ai thay d
,
i nh
,
o.
116. For brevity of presentation we shall ... 116.
,
vi
.
c tr`nh b` ay du
,
.
o
,
c ng

an g
.
on, ta se
...
117. For simplicity of exposition ... 117.
,
do
,
n gi
,
an vi
.
c tr`nh b` ay ...
118. In what follows we shall be concerned
not no much with ... as with ...
118. Du
,
o
,
i dy ch ung ta se khng d
`
c
.
p t o
,
i
... nhi
`
u nhu
,
l` a t o
,
i ...
119. To improve upon these shortcomings
...
119.
,
s
,
u
,
a chu
,
a nhu
,
ng thi

u s ot n` ay ...
120. To overcome this difculty 120.
,
kh

ac ph
.
uc kh o kh an d o
121. To circumvent this difculty 121.
,
vu
,
.
o
,
t qu a kh o kh an d o
122. For emphasis and clarity, we note that
throughout this paper C is not as-
sumed to be ...
122.
,
nh

n m
.
anh v` a l` am s ang s
,
ua, ta lu
,
u
y r
`
ang trong su

t b` ai n` ay C khng c
`
n
ph
,
ai gi
,
a thi

t l` a ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 11
123. It should be noted that ... 123. Nn ch u y r
`
ang ...
124. It makes sense to consider ... 124. C o y ngha d
,
xet ...
125. The problem will be considered in
more detail (in greater detail) in ...
specically ... More specically, ...
125. V

n d
`
se du
,
.
o
,
c xem xet t
,
m
,
ho
,
n
trong ... c
.
u th
,
l` a ... C
.
u th
,
ho
,
n ...
126. The interested reader is refered to [.]
for more details.
126.
.
c gi
,
a n` ao mu

n c o th
,
tham kh
,
ao
chi ti

t ho
,
n trong [.]
127. We shall study this phenomenon in
some detail (in great detail, in greater
detail).
127. Ta se nghin c u
,
u hi
.
n tu
,
.
o
,
ng n` ay v o
,
i t
nhi
`
u chi ti

t (m
.
t c ach th
.
t chi ti

t,
m
.
t c ach chi ti

t ho
,
n).
128. We refer to Auman [.] for a complete
treatment of the problem.
128. Xin xem m
.
t cng tr`nh nghin c u
,
u
d
`
y d
,
u v
`
v

n d
`
n` ay trong t ac ph
,
m
[.] c
,
ua Auman.
129. Results of this nature may be found in
...
129. Nhu
,
ng k

t qu
,
a v
`
lo
.
ai d o c o th
,
t`m
th

y trong ...
130. Our approach includes as special cases
all previously published approaches to
generalized inverses of linear opera-
tors.
130. C ach ti

p c
.
n c
,
ua ch ung ti bao h` am,
nhu
,
l` a nhu
,
ng tru
,
`o
,
ng h
.
o
,
p ring, t

t c
,
a
c ac c ach ti

p c
.
n d a c o tru
,
o
,
c dy v
`
ngh
.
ich d
,
ao suy r
.
ng c
,
ua c ac to an t
,
u
,
tuy

n tnh.
131. In addition, it provides new results
for generalized inverses in the case of
normed spaces.
131. Thm v` ao d o, n o c` on cho nhu
,
ng k

t
qu
,
a m o
,
i v
`
ngh
.
ich d
,
ao suy r
.
ng trong
tru
,
`o
,
ng h
.
o
,
p khng gian d
.
inh chu
,
n.
132. These results are included here for the
sake of completeness.
132.
,
cho d
`
y d
,
u, c ac k

t qu
,
a d o c ung
du
,
.
o
,
c k
,
ra dy.
133. As one might expect, ... 133. Nhu
,
c o th
,
ch`o
,
d
.
o
,
i, ...
134. Next 3.7 we shall be proving still
more, viz. that (3.2) is necessary for
the truth of (3.1) for all sets of two
variables.
134.
,
O
,
3.7 du
,
o
,
i dy ch ung ta se ch u
,
ng
minh c` on nhi
`
u ho
,
n l` a (3.2) l` a c
`
n d
,
cho (3.1) d ung v o
,
i m
.
oi t
.
p hai bi

n.
135. Such theorems can be proved without
appeal to any concretely dened ho-
mology theory.
135. Nhu
,
ng d
.
inh ly nhu
,
th

c o th
,
ch u
,
ng
minh m` a khng c
`
n d` ung t o
,
i m
.
t ly
thuy

t d
`
ng d
`
u n` ao xy d
.
u
,
ng m
.
t
c ach c
.
u th
,
.
136. Our task is to investigate how this
theory may be extended to any nite
number of factors.
136. Nhi
.
m v
.
u ch ung ta l` a kh
,
ao s at xem ly
thuts n` ay c o th
,
m
,
o
,
r
.
ng cho m
.
t s

hu
,
u h
.
an b

t k`y nhn t
,
u
,
du
,
.
o
,
c khng.
137. We emphasize that ... 137. Ch ung ta nh

n m
.
anh r
`
ang ...
138. It is sometimes relevant to know
whether or not a function can be
found which vanishes on C.
138. i khi ta c
`
n bi

t li
.
u c o th
,
t`m du
,
.
o
,
c
m
.
t h` am tri
.
t tiu trn C ch ang.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 12
139. We propose now to examine a more
general framework in which the dis-
cussion of absolute continuity still
makes sense.
139. By gi`o
,
ta d
`
ngh
.
i xet m
.
t khun kh
,
t
,
ng qu at ho
,
n, trong d o c` on c o ngha
d
,
b` an t o
,
i s
.
u
,
lin t
.
uc tuy
.
t d

i.
140. The situation is different if we allow
negative coefcients.
140. T`nh h`nh kh ac di n

u cho phep c ac h
.

m.
141. It can happen that ... 141. C o th
,
x
,
ay ra l` a ...
142. What sense, in this case, can we make
of the expression for (E) ?
142. Trong tru
,
`o
,
ng h
.
o
,
p d o c o th
,
g an cho
bi
,
u th u
,
c (E) y ngha g` ?
143. Loosely speaking, a measurable kernel
of a set is ...
143. N oi d
.
ai kh ai, m
.
t h
.
at nhn do du
,
.
o
,
c
c
,
ua m
.
t t
.
p l` a ...
144. Our procedure can be outlined as fol-
lows.
144. Th
,
u t
.
uc c
,
ua ch ung ti c o th
,
m t
,
a d
.
ai
th
,
nhu
,
sau.
145. We shall occasionnally make use of ... 145. Th
,
nh tho
,
ang c o khi ta d` ung ...
146. So far we have concerned ourselves
only with ... We return now to its vari-
ation under changes of y.
146. CHo d

n dy ta ch
,
m o
,
i quan tm d

n
... By gi`o
,
ta chuy
,
n qua s
.
u
,
bi

n thin
c
,
ua n o khi y thay d
,
i.
147. When speaking of kernels we will al-
ways be implying tacitly that the cate-
gory in question has a zero, for other-
wise the terms make no sense.
147. Khi n oi v
`
h
.
at nhn ta se lun lun
hi
,
u ng
`
m r
`
ang ph
.
am tr` u du
,
.
o
,
c xet t o
,
i
c o m
.
t v
.
t khng, v` n

u tr ai l
.
ai th`
c ac thu
.
t ngu
,
khng c` on y ngha nu
,
a.
148. The author claims as new only theo-
rems ...
148. T ac gi
,
a ch
,
kh
,
ang d
.
inh l` a m o
,
i c ac d
.
inh
ly ...
149. For wider applicability of the results,
local convexity is not assumed.
149.
,
c ac k

t qu
,
a c o kh
,
a n ang u
,
ng d
.
ung
r
.
ng r ai ho
,
n, ta khng gi
,
a thiaats tnh
l
`
i d
.
ia phu
,
o
,
ng.
150. We give two examples to show the
motivation for the denition of ...
150. Ta du
,
a ra hai v d
.
u d
,
nu r o ly do d

n
d

n d
.
inh ngha ...
151. At this point we remark that ... 151. T o
,
i dy ta d
,
y r
`
ang ...
152. In a sense quadratic methods are the
most natural.
152. Theo m
.
t ngha n` ao d o c ac phu
,
o
,
ng
ph ap b
.
c hai l` a t
.
u
,
nhin nh

t.
153. The problems arising here are similar
mathematically to those encountered
(met) in the calculus of variations.
153. C ac b` ai to an n
,
ay ra
,
o
,
dy c ung tu
,
o
,
ng
t
.
u
,
v
`
m
.
at to an h
.
oc nhu
,
nhu
,
ng b` ai to an
g
.
ap trong phep bi

n phn.
154. Bary and Menchoff succeeded in char-
acterizing completely the class of
functions expressible as superposi-
tions of ...
154. Bary v` a Menchoff d a th` anh cng trong
vi
.
c d
.
ac tru
,
ng ho` an to` an l o
,
p c ac h` am
c o th
,
bi
,
u di

n th` anh h` am h
.
o
,
p c
,
ua ...
155. In the rest of this paper .... 155. Trong ph
`
n c` on l
.
ai c
,
ua b` ai ...
156. In the remaining part of this paper ... 156. Trong ph
`
n c` on l
.
ai c
,
ua b` ai ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 13
157. Both conditions suffer from the seri-
ous defect, with regard to numerical
application that they are not generally
possible to verify computationally.
157. C
,
a hai d
`
u ki
.
n d
`
u c o m
.
t nhu
,
.
o
,
c
di
,
m quan tr
.
ong, d u
,
ng v
`
phu
,
o
,
ng
di
.
n u
,
ng d
.
ung s

tr
.
i l` a n oi chung
khng th
,
ki
,
m tra ch ung b
`
ang tnh
to an.
158. Convexity has been dealt with in de-
tail in many places, and the reader is
refered to [.] for fuller development.
158. V
`
tnh l
`
i d a c o nhi
`
u t` ai li
.
u tr`nh
b` ay chi ti

t, v` a d
.
c gi
,
a n` ao mu

n hi
,
u
d
`
y d
,
u ho
,
n xin tham kh
,
ao [.].
159. ... In a sense which will be made pre-
cise.
159. ... theo m
.
t ngha m` a sau dy se du
,
.
o
,
c
chnh x ac h oa.
160. This theorem is more of theorical
value than practical use.
160.
.
inh ly n` ay c o gi a tr
.
i ly thuy

t nhi
`
u
ho
,
n l` a t ac d
.
ung th
.
u
,
c ti

n.
161. The rationale for modifying H is ... 161. Ly do d
,
s
,
u
,
a d
,
i H l` a ...
162. There is reason to believe ... 162. Ta c o ly do d
,
tin r
`
ang ...
163. There are weighty reasons, soon ap-
parent, why one does not want to
consdere merely the class of all con-
vex functions having ...
163. C o nhi
`
u ly do x ac d ang m` a l at nu
,
a
se r o, gi
,
ai thch t
.
ai sao ta khng mu

n
ch
,
xet do
,
n gi
,
an l o
,
p c ac h` am l
`
i c o ...
164. This is the reason for using the
quadratic function.
164. o l` a ly do v sao ta d` ung h` am ho` an
phu
,
o
,
ng.
165. In addition to giving many new and
more general results, we hope that ...
165. Ngo` ai vi
.
c du
,
a ra nhi
`
u k

t qu
,
a m o
,
i
v` a t
,
ng qu at ho
,
n, ch ung ti hy v
.
ong
r
`
ang ...
166. As an application, let A be linear .... 166.
,
u
,
ng d
.
ung, gi
,
a s
,
u
,
A tuy

n tnh ...
167. The notation of a ring-module has, in
recent years, come to be regarded as
one of the most important in modern
algebra
167. Kh ai ni
.
m modul v` anh nhu
,
ng n am
g
`
n dy d a d
`
n d
`
n du
,
.
o
,
c xem nhu
,
l` a m
.
t trong nhu
,
ng kh ai ni
.
m quan
tr
.
ong nh

t c
,
ua d
.
ai s

hi
.
n d
.
ai.
168. These our results will apply after any
necessary minor modications have
been made.
168. Nhu
,
ng k

t qu
,
a d o c
,
ua ch ung ti se ap
d
.
ung du
,
.
o
,
c sau khi d a l` am m
.
t s

s
,
u
,
a
d
,
i nh
,
o c
`
n thi

t.
169. To bridge the gap between ... 169.
,
b

ac c
`
u qua h

ng an c ach giu
,
a ...
170. This theory sheds a considerable light
on the sources of ...
170. Ly thuy

t d o d
.
o nhi
`
u anh s ang v` ao
ngu
`
n g

c c
,
ua ...
171. The analogy is deeper than it seems. 171. S
.
u
,
tu
,
o
,
ng t
.
u
,
c` on su s

ac ho
,
n v
,
e b
`
ngo` ai.
172. On rst glance it might appear that ... 172. M o
,
i nh`n qua c o th
,
tu
,
,
o
,
ng nhu
,
.
173. Such considerationss apart, the rea-
sons for prefering one method over
the other seem to be a matter of taste.
173. Tr`u
,
nhu
,
ng s
.
u
,
suy xet d o, c ac ly do
d
,
ch
.
on phu
,
o
,
ng ph ap n` ay hay phu
,
o
,
ng
ph ap kia c o v
,
e ch
,
l` a v

n d
`
s
,
o
,
thch
t`u
,
ng ngu
,
`o
,
i.
174. There is little difference between the
two ...
174. Khng c o m

y kh ac bi

t giu
,
a hai c ai ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 14
175. In general, the space B(X, Y ), al-
though of interest by its own right,
does not play nearly as dominant
a role in cur theory as that of the
normed dual of X.
175. N oi chung, Khng gian B(X, Y ) tuy
t
.
u
,
n o c o t
`
m quan tr
.
ong ring, khng
d ong m
.
t vai tr` o g
`
n nhu
,
ch
,
u d
.
ao
trong ly thuy

t c
,
ua ch ung ta nhu
,
l` a
d

i ng

u d
.
inh chu
,
n c
,
ua X.
176. It is still an open question whether A
is empty or not.
176. V

n d
`
c` on m
,
o
,
l` a li
.
u A c o r

ng hay
khng.
177. The question arises as to whether this
local solution ccan be extended to the
entire interval.
177. N
,
ay ra cu h
,
oi l` a li
.
u nghi
.
m d
.
ia
phu
,
o
,
ng n` ay c o th
,
khuy

ch ra to` an
kho
,
ang hay khng.
178. The question arises as to what happen
if ...
178. N
,
ay ra cu h
,
oi l` a c ai g` x
,
ay ra n

u ...
179. It is natural to ask whether ... 179. Cu h
,
oi t
.
u
,
nhin l` a li
.
u ...
180. One can raise two questions about po-
tential functions.
180. C o th
,
d
.
at ra hai cu h
,
oi v
`
c ac h` am
th

181. The answer is in the afrmative. 181. Cu tr

,
a l`o
,
i l` a kh
,
ang d
.
inh.
182. During the last several decades math-
ematical programming has risen to
become one of the most important
tools available for dealing with certain
types of large scale problems.
182. Trong m

y th
.
p nin g
`
n dy, quy
ho
.
ac to an h
.
oc d a n
,
i ln th` anh m
.
t
trong s

c ac cng c
.
u quan tr
.
ong nh

t
c o th
,
s
,
u
,
d
.
ung d
,
nghin c u
,
u m
.
t s

b` ai to an co
,
l o
,
n.
183. ... a notion which will be of atmost
importance when we later turn to the
specication of what are called "theo-
rems of the alternatives"
183. ... M
.
t kh ai ni
.
m sau n` ay se c o y
ngha quan tr
.
ong b
.
c nh

t khi ch ung
ta chuy
,
n sang ph at bi
,
u nhu
,
ng m
.
nh
d
`
g
.
oi l` a " d
.
inh ly v
`
c ac kh
,
a n ang".
184. A very simple, but in no way trivial
fact
184. M
.
t s
.
u
,
ki
.
n r

t do
,
n gi
,
an nhu
,
ng khng
t
`
m thu
,
`o
,
ng ch ut n` ao.
185. A second reason for interest in closed-
ness criteria is the bearing they have
on the existence of solutions to ex-
tremum problems.
185. M
.
t ly do th u
,
hai khi

n ngu
,
`o
,
i ta ch u
y d

n c ac tiu chu
,
n d ong l` a m

i lin
h
.
c
,
ua ch ung d

i v o
,
i s
.
u
,
t
`
n t
.
ai nghi
.
m
c
,
ua c ac b` ai to an c
.
u
,
c tr
.
i.
186. Before embaking on the general res-
olution of the problem, let us briey
consider the geometry of the problem.
186. Tru
,
o
,
c khi b

at tay v` ao gi
,
ai b` ai to an m
.
t
c ach t
,
ng qu at, ta h ay xet so
,
lu
,
.
o
,
c h`nh
h
.
oc c
,
ua b` ai to an.
187. A general attack on problem (1)
would be at least as difcult to carry
through as the corresponding attack
on problems having only equality con-
straints ...
187. M
.
t vi
.
c t

n cng t
,
ng qu at v` ao b` ai
to an (1) t ra c ung se kh o kh an ngang
nhu
,
l` a t

n cng v` ao c ac b` ai to an ch
,

c o r` ang bu
.
c d
,
ang th u
,
c.
188. Generally, things are arranged so that
....
188. N oi chung, s
.
u
,
vi
.
c du
,
.
o
,
c thu x

p sao
cho ...
189. We restate the problem in an alterna-
tive form that is essentially equivalent
yet hopefully more amenable to solu-
tion.
189. Ta ph at bi
,
u l
.
ai b` ai to an du
,
o
,
i m
.
t
d
.
ang kh ac, tuy c an b
,
an c ung tu
,
o
,
ng
du
,
o
,
ng, nhu
,
ng c o hy v
.
ong d

t`m ra l`o
,
i
gi
,
ai ho
,
n.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 15
190. Benders was one of the rst to appre-
ciate the importance of ...
190. Benters l` a m
.
t trong nhu
,
ng ngu
,
`o
,
i d
`
u
tin d a nh
.
n th u
,
c t
`
m quan tr
.
ong c
,
ua
...
191. A space may be locally metrisable and
still fail to be paracompact.
191. M
.
t khng gian c oa th
,
metric h oa d
.
ia
phu
,
o
,
ng du
,
.
o
,
c nhu
,
ng v

n khng para-
compac.
192. We may inquire into whether or not
these two categories are mutually ex-
clusive.
192. Ta c o th
,
kh
,
ao s at d
,
xem li
.
u hai
ph
.
am tr` u

y c o lo
.
ai tr`u
,
l

n nhau
khng.
193. ... and investigate to what extent the
linear theory is carried over to the
nonlinear case.
193. ... v` a kh
,
ao s at xem ly thuy

t tuy

n
tnh c o th
,
chuy
,
n sang tru
,
`o
,
ng h
.
o
,
p
phi tuy

n d

n m u
,
c d
.
n` ao.
194. It is therefore of interest to know un-
der what conditions ...
194. V` th

c ung l` a th u v
.
i khi bi

t v o
,
i di
`
u
ki
.
n n` ao ...
195. In answer to this question, consider
the following ...
195.
,
tr
,
a l`o
,
i cu h
,
oi d o ta xet ...
196. We shall take this up in the next chap-
ter.
196. Ta se b` an d

n di
`
u n` ay trong chu
,
o
,
ng
sau.
197. This will be taken up in the next chap-
ter.
197. C ai n` ay se du
,
.
o
,
c xet t o
,
i trong chu
,
o
,
ng
sau.
198. For making the purpose and useful-
ness of ... more apparent, illustrative
examples will be used.
198.
,
l` am r o ho
,
n m
.
uc dch v` a ch l
.
o
,
i c
,
ua
..., nhu
,
ng v d
.
u minh h
.
oa se du
,
.
o
,
c du
,
a
ra.
199. Section 1 is devoted to the discussion
of ...
199. o
.
an 1 d` anh cho vi
.
c th
,
ao lu
.
n ...
200. The rst section deals with ..., section
2 gives some results on ..., and section
3 studies ...
200. o
.
an d
`
u b` an v
`
..., do
.
an th u
,
hai cho
m
.
t s

t qu
,
a v
`
... v` a do
.
an th u
,
3
nghin c u
,
u ...
CH
,
U
`
2
Acknowlegments - Bi

t o
,
n
201. The author wishes to express his
thanks (gratitude) to ...
201. T ac gi
,
a mu

n t
,
o l` ong c
,
am o
,
n (l` ong
bi

t o
,
n) t o
,
i ...
202. The author is greatly indebted to .... 202. T ac gi
,
a t
,
o l` ong bi

t o
,
n su s

ac ...
203. for his active interest in the publica-
tion of this paper.
203. cho s
.
u
,
d ong g op tch c
.
u
,
c trong cng
b

c
,
ua b` ai b ao n` ay.
204. for suggesting the problem and for
many stimulating conversations.
204. cho nhu
,
ng l`o
,
i khuyn b` ai b ao v` a cho
r

t nhi
`
u th
,
ao lu
.
n c o ch.
205. for several helpful comments concern-
ing ...
205. cho m
.
t s

b`nh lu
.
n c o ch c o lin
quan t o
,
i ...
206. for drawing the authors attention to
....
206. cho vi
.
c ve ln nhu
,
ng ch u y c
,
ua t ac
gi
,
a t o
,
i ....
207. for pointing out a mistake in ... 207. cho nhu
,
ng l

i d a du
,
.
o
,
c ch
,
ra trong ...
208. for his collaboration in proving
Lemma 4.
208. cho s
.
u
,
c
.
ng t ac c
,
ua anh

y trong
ch u
,
ng minh B
,
d
`
4.
209. The author gratefully acknowledges
the many helpful suggestions of ...
during the preparation of the paper.
209. T ac gi
,
a bi

t o
,
n v
`
r

t nhi
`
u l`o
,
i khuyn
c
,
ua .... trong th`o
,
i gian chu
,
n b
.
i b` ai
b ao n` ay.
210. This is part of the authors Ph.D. the-
sis, written under the supervision of
.... at the University of ...
210. y l` a m
.
t ph
`
n c
,
ua lu
.
n an ti

n sy
c
,
ua t ac gi
,
a, n o du
,
.
o
,
c t` ai tr
.
o
,
c
,
ua .... t
.
ai
d
.
ai h
.
oc c
,
ua ...
211. The author wishes to thank the Uni-
versity of .... , where the paper was
written, for nancial support (for the
invitation and hospitality).
211. T ac gi
,
a mu

n c
,
am o
,
n d
.
ai h
.
oc ..., b` ai
b ao d a du
,
.
o
,
c vi

t nh`o
,
t` ai tr
.
o
,
t` ai chnh.
212. I would like to take this opportunity
to thank my adviser, Prof. ..., for his
excellent advice and support.
212. Ti mu

n nhn d
.
ip n` ay c am o
,
n ngu
,
`o
,
i
hu
,
o
,
ng d

n ti, Gi ao su
,
... v
`
s
.
u
,
khuyn
b
,
ao v` a khuy

n khch n c
`
n.
213. The author wishes to thank Prof. ....
for the benet of his advices.
213. T ac gi
,
a xin c
,
am o
,
n Gi ao su
,
... v
`
nhu
,
ng l`o
,
i khuyn c
,
ua ng.
214. We would like to express our sincere
thanks to Prof. ... for ...
214. Ch ung ti mu

n b` ay t
,
o l` ong c
,
am o
,
n
chn th` anh d

i v o
,
i Gi ao su
,
... v
`
...
215. Finally, I express my deepest gratitute
to Prof. ... for his help and encourage-
ment.
215. Cu

i c` ung, ti xin b` ay t
,
o l` ong bi

t o
,
n
su s

ac nh

t d

i v o
,
i Gi ao su
,
... v
`
s
.
u
,
gi up do
,
v` a khuy

n khch c
,
ua Gi ao su
,
d

i v o
,
i ti.
216. Thanks are due also to my colleagues,
Dr. ...., for ...
216. C ung xin c
,
am o
,
n d
`
ng nghi
.
p c
,
ua ti,
Ti

n s ... v
`
....
217. It is a particular pleasure to acknowl-
edge the many valuable comments fo
Prof. ...
217. Ti l

y l` am sung su
,
o
,
ng du
,
.
o
,
c b` ay t
,
o
l` ong bi

t o
,
n d

i v o
,
i nhu
,
ng l`o
,
i nh
.
n
xet r

t x ac d ang c
,
ua Gi ao su
,
...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 17
218. The author is indebted to ... for his
valuable comments and suggestions.
218. T ac gi
,
a ch
.
iu o
,
n ... v
`
nhu
,
ng y ki

n v` a
nh
.
n xet qu b

u.
219. Special thanks are due to Dr. .... whose
remarks substantially improved the
paper.
219. Xin c
,
am o
,
n d
.
ac bi
.
t Ti

n s ... m` a c ac
nh
.
n xet d a gi up c
,
ai ti

n d ang k
,
b` ai
n` ay.
220. The author would like be express his
gratitude to one of the referees for
several constructive suggestions.
220. T ac gi
,
a xin t
,
o l` ong c
,
am o
,
n m
.
t trong
nhu
,
ng ngu
,
`o
,
i nh
.
n xet d a cho nhi
`
u
g
.
o
,
i y xy d
.
u
,
ng.
221. The author would like to thank ... for
helpful suggestions.
221. T ac gi
,
a xin du
,
.
o
,
c c am o
,
n ... d a cho
nhu
,
ng g
.
o
,
i y hu
,
uch.
CH
,
U
`
3
Notations - K y hi
.
u
222. We will denote by Z the set ... 222. Ta ky hi
.
u t
.
p h
.
o
,
p b
`
ang Z ....
223. Let us denote by Z the set ... 223. Ky hi
.
u Z l` a t
.
p h
.
o
,
p .....
224. Let Z denote the set ... 224. Ky hi
.
u Z l` a t
.
p h
.
o
,
p .....
225. Write (Let/Set) f = ... 225.
.
at f = ....
226. The closure of A will be denoted by
clA.
226. Bao d ong c
,
ua A se ky hi
.
u b
`
ang clA
227. We will use the symbol (letter) k to
denote ...
227. Ta se d` ung ky hi
.
u k d
,
ky hi
.
u ....
228. We write H for the value of ... 228. Ta d
.
at H cho gi a tr
.
i c
,
ua .....
229. We will write the negation of p as p. 229. Ta se ky hi
.
u ph
,
u d
.
inh c
,
ua p nhu
,
p.
230. The notation aRb means that ... 230. Ky hi
.
u aRb ngha l` a .....
231. Such cycles are called homologous
(written c c).
231. V` ong tr` on nhu
,
v
.
y du
,
.
o
,
c g
.
oi l` a homol-
ogy.
232. Here K denotes (stands for) the map
...
232.
,
O
,
dy K ky hi
.
u anh x
.
a ....
233. Here and subsequently, K denotes
(stands for) the map ...
233.
,
O
,
dy v` a ti

p sau, K ky hi
.
u anh x
.
a
....
234. Throughout the proof, K denotes
(stands for) the map ...
234. Trong su

t ch u
,
ng minh, K ky hi
.
u
anh x
.
a .....
235. In the sequel, K denotes (stands for)
the map ...
235. Trong do
.
an ti

p t
.
uc, K ky hi
.
u anh x
.
a
....
236. From now on, K denotes (stands for)
the map ...
236. T`u
,
by gi`o
,
tr
,
o
,
di, K ky hi
.
u anh x
.
a ...,
237. We follow the notation of [8] (used in
[8]).
237. Ta theo ky hi
.
u [8].
238. Our notation differs (is slightly differ-
ent) from that of [8].
238. Ky hi
.
u c
,
ua ch ung ta kh ac v o
,
i t`u
,
[8].
239. Let us introduce the temporary nota-
tion Ff for gfg.
239. Ta gi o
,
i thi
.
u ky hi
.
u t
.
am th`o
,
i Ff cho
gfg.
240. With the notation f = ... , we have ... 240. V o
,
i ky hi
.
u f = ..., ta c o ....
241. With this notation, we have ... 241. V o
,
i ky hi
.
u n` ay, ta c o ....
242. In the notation of [8, Ch. 7] we have
...
242. Trong ky hi
.
u
,
o
,
[8, Ch. 7] ta c o ....
243. If f is real, it is customary to write ...
rather than ...
243. N

u f l` a s

th
.
u
,
c, thng thu
,
`o
,
ng vi

t ....
ho
,
n l` a .....
244. For simplicity of notation, 244. Cho do
,
n gi
,
an ky hi
.
u,
245. To (simplify/shorten) notation, 245.
,
do
,
n gi
,
an ky hi
.
u
246. By abuse of notation, 246. B
`
ang l
.
am d
.
ung ky hi
.
u,
247. For abbreviation, 247.
,
vi

t t

at,
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 19
248. we write f instead of ... 248. Ta vi

t f thay cho ....

249. we use the same letter f for ... 249. Ta d` ung c` ung chu
,
c ai cho f .....
250. we continue to writef for ... 250. Ta ti

p t
.
uc vi

t f cho .....
251. we letf stand for ... 251. Ky hi
.
u f cho .....
252. We abbreviate Faub to b

. 252. Ta vi

t t

at Faub l` a b

.
253. We denote it briey by F. [Not:
"shortly"]
253. Ta ky hi
.
u ng

an g
.
on b
`
ang F
254. We write it F for short (for brevity). 254. Ta vi

t ng

an g
.
on F
255. The Radon-Nikodym property (RNP
for short) implies that
255. Tnh ch

t Radon-Nikodym keo theo

256. We will write it simply x when no con-
fusion can arise....
256. Ch ung ti se vi

t n o ch
,
do
,
n gi
,
an l` a x
khi khng c o s
.
u
,
nh
`
m l

n c o th
,
ph at
sinh
257. It will cause no confusion if we use the
same letter to designate
257. N o se khng gy nh
`
m l

n n

u ch ung
ta s
,
u
,
d
.
ung c` ung m
.
t chu
,
c ai d
,
ch
,

258. a member of A and its restriction to

K.
258. m
.
t ph
`
n t
,
u
,
c
,
ua A v` a h
.
an ch

c
,
ua n o
cho K.
259. We shall write the above expression as
t = ...
259. Ch ung ta se vi

t bi
,
u th u
,
c trn nhu
,
t = ...
260. The above expression may be written
as t = ...
260. Bi
,
u th u
,
c trn c o th
,
du
,
.
o
,
c vi

t l` a t =
...
261. We can write D) in the form t = ... 261. Ta c o th
,
vi

t D) trong d
.
ang t = ....
262. The Greek indices label components
of sections of E.
262. Hy L
.
ap ch
,
s

th` anh ph
`
n nh an c
,
ua
c ac ph
`
n c
,
ua E .
263. The expression in italics (in italic
type), in large type, in bold print;
263. S
.
u
,
bi
,
u hi
.
n b
`
ang chu
,
in nghing (
lo
.
ai nghing ), lo
.
ai l o
,
n , in d
.
m ;
264. in parentheses ( ) (= round brackets), 264. ngo
.
ac tr` on ( )
265. in brackets [ ] (= square brackets), 265. ngo
.
ac vung [ ]
266. in braces (= curly brackets), in an-
gular brackets ( );
266. ngo
.
ac nh
.
on
267. within the norm signs 267. trong nhu
,
ng d

u hi
.
u tiu chu
,
n
268. Capital letters = upper case letters;
small letters = lower case letters;
268. chu
,
c ai hoa
269. Gothic (German) letters; script (calli-
graphic) letters (e.g. T , Q);
269. chu
,
gothic
270. special Roman letters (e.g. R, N ) 270. d
.
ac bi
.
t chu
,
c ai Roman
271. vertical stroke (vertical bar) [, slash
(diagonal stroke/slant)/,
271. g
.
ach ngang, g
.
ach d u
,
ng
272. dash , sharp # 272. g
.
ach d u
,
t do
.
an, d

u th ang
273. Dotted line , dashed line , wavy line 273. u
,
`o
,
ng ch

m ch

m, ...
274. Let X denote ... 274. Cho X ky hi
.
u ...
275. Let X be .... 275. Cho X l` a ...
276. Denote by X a locally convex space 276. Ky hi
.
u X l` a m
.
t khng gian l
`
i d
.
ia
phu
,
o
,
ng.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 20
277. X will denote ... 277. X se ky hi
.
u ...
278. By X we alway mean a separated lo-
cally convex space.
278. Ta lun hi
,
u X l` a m
.
t khng gian l
`
i
d
.
ia phu
,
o
,
ng t ach.
279. Dene X to be ... 279.
.
inh ngha X l` a ...
280. Throughout this paper ... 280. Trong su

t b` ai n` ay ...
281. Throughout the forthcoming, unless
otherwise specied, we shall denote
by X a locally convex space.
281. T`u
,
dy tr
,
o
,
di n

u khng n oi l
.
ai m
.
t
c ach kh ac, ta se hi
,
u X l` a m
.
t khng
gian l
`
i d
.
ia phu
,
o
,
ng.
282. Unless otherwise stated, throughout
this section, A will denote ...
282. Tr`u
,
khi d
.
inh ngha l
.
ai m
.
t c ach kh ac,
c` on trong su

t m
.
uc n` ay A se ky hi
.
u
...
283. From now on ... 283. T`u
,
dy tr
,
o
,
di ...
284. The notation ... will mean ... 284. Ky hi
.
u ... se c o ngha l` a ...
285. We write f g to mean that the func-
tions f and g are equivalent.
285. Ta vi

t f g d
,
ch
,
r
`
ang c ac h` am f v` a
g l` a tu
,
o
,
ng du
,
o
,
ng.
286.

e
[...], where the sum extends over
all combinations (e) of n zeros and
ones.
286.

e
[...], trong t
,
ng l

y theo t

t c
,
a c ac
t
,
h
.
o
,
p (e) g
`
m n s

0 v` a s

1.
287. f(x) = x
T
Qx, where the super-script
T denotes transposition.
287. ..., trong d o chu
,
T pha trn d` ong ch
,

s
.
u
,
chuy
,
n v
.
i.
288. Two vertices are said to be adjacent if
...
288. Hai d
,
nh du
,
.
o
,
c g
.
oi l` a k
`
n

u ...
289. We shall adopt the following notation
...
289. Ch ung ta se d` ung c ach ky hi
.
u sau ...
290. Our terminology and notation are as
in [.]
290. Thu
.
t ngu
,
v` a ky hi
.
u c
,
ua ch ung ta se
gi

ng nhu
,
trong [.]
291. In the tranditional terminology, .... 291. Trong thu
.
t ngu
,
truy
`
n th

ng, ...
292. We shall continue using the notation
of section 4.
292. Ta se t

p t
.
uc s
,
u
,
d
.
ung c ach ky hi
.
u c
,
ua
m
.
uc 4.
293. Before coming to the denition we
should clarify some of our notation.
293. Tru
,
o
,
c khi di v` ao d
.
inh ngha ta se l` am
r o m
.
t s

ky hi
.
u c
,
ua ch ung ta.
294. For simplicity of notation ... 294.
,
vi
.
c ky hi
.
u du
,
.
o
,
c do
,
n gi
,
an ...
295. For the sake of simplicity ... 295.
,
do
,
n gi
,
an ...
296. For the sake of convenience ... 296.
,
thu
.
n ti
.
n ...
297. We shall nd it convenient to employ
...
297. Ta se th

y thu
.
n ti
.
n khi s
,
u
,
d
.
ung ...
298. We shall write f
n
for f
N
if convenient. 298. Ta se vi

t f
n
thay cho f
N
n

u ti
.
n.
299. We abbreviate dx
1
dx
2
....dx
n
by dx,
and similarly for dy
299. Ta vi

t t

at dx
1
dx
2
....dx
n
l` a dx v` a tu
,
o
,
ng
t
.
u
,
nhu
,
th

i v o
,
i dy.
300. We also write (E, d) for the complex
(E
i
, d
i
), or even more briefy, we write
simply E.
300. Ta c ung vi

t (E, d) thay cho b

.

(E
i
, d
i
), ho
.
ac thmk ch ng

an g
.
on ho
,
n
ta vi

t do
,
n gi
,
an l` a E.
301. In the sequel we shall identify with
the triple [x
0
, r, M].
301. Du
,
o
,
i dy ta se d
`
ng nh

t v o
,
i b
.
ba
[x
0
, r, M].
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 21
302. We shall understand by a Lambda-
module.
302. Ta se hi
,
u -modun l` a m
.
t -modun
tr ai.
303. A vector u U will be written as u =
(u
1
, ..., u
n
).
303. Vec to
,
u U se du
,
.
o
,
c vi

t l` a u =
(u
1
, ..., u
n
).
304. We shall denote by [[.[[
X
the norm of
space X (the subscript will be deleted
if no confusion is possible).
304. Ta se ky hi
.
u [[.[[
X
l` a chu
,
n c
,
ua khng
gian X (chu
,
X
,
o
,
ch
,
s

du
,
.
o
,
c b
,
o di n

u
khng th
,
nh
`
m l

n).
305. When no confusion can arise, we
write ...
305. Khi khng th
,
nh
`
m l

n, ta vi

t ...
306. Without fear of confusion we can omit
the index i on d
i
and write just d.
306. Khng s
.
o
,
nh
`
m l

n ta c o th
,
b
,
o ch
,
s

i
,
o
,
trong d
i
v` a vi

t g
.
on l` a d.
307.

M = ..., where the bar indicates the
topological closure.
307.

M = ...,
,
o
,
dy d

u g
.
ach trn d` ung d
,
ch
,
bao d ong t p.
308. = ..., where the title indicates .... 308.
,
o
,
dy d

u ng a d` ung d
,
ch
,
...
309. ... where B stands for the unit ball 309. ...
,
o
,
d o B l` a h`nh c
`
u do
,
n v
.
i.
310. A map F from X into Y , in symbols,
F : X Y , is ...
310. M
.
t anh x
.
a F t`u
,
X v` ao Y , v o
,
i ky hi
.
u
F : X Y , l` a ...
311. The last written symbol 311. Ky hi
.
u vi

t sau c` ung
312. Notation being as before, we have ... 312. Ky hi
.
u v

n nhu
,
trn ta c o ...
313. We assume that the reader is famil-
iar with the terminology of elemen-
tary topology.
313. Ta gi
,
a thi

t d
.
c gi
,
a d a quen thu
.
c v o
,
i
thu
.
t ngu
,
c
,
ua t p so
,
c

p.
CH
,
U
`
4
Assumptions - Gi
,
a thi

t
314. We will make (need) the following as-
sumptions: ...
314. Ta se d
.
at (c
`
n) nhu
,
ng gi
,
a thi

t sau
dy:....
315. From now on we make the assump-
tion: ...
315. T`u
,
by gi`o
,
ta l` am gi
,
a thi

t sau dy:.....
316. The following assumption will be
needed throughout the paper.
316. Nhu
,
ng gi
,
ai thi

t sau c
`
n cho su

t b` ai
b ao n` ay.
317. Our basic assumption is the following. 317. Gi
,
a thi

t co
,
s
,
o
,
c
,
ua ch ung ta l` a sau dy.
318. Unless otherwise stated (Until further
notice) we assume that ...
318. Khng di
`
u g` tr ai l
.
ai (Cho t o
,
i khi n oi
g`) ta gi
,
a ti

t r
`
ang ...
319. In the remainder of this section we as-
sume (require) g to be ...
319. Ph
`
n c` on l
.
ai c
,
ua do
.
an n` ay ta gi
,
a thi

t
( d` oi h
,
oi) g l` a .....
320. In order to get asymptotic results, it is
necessary to put some restrictions on
f
320.
,
nh
.
n c ac k

t qu
,
a ti
.
m c
.
n, c
`
n
thi

t d
.
at m
.
t s

h
.
an ch

trn f.
321. We shall make two standing assump-
tions on the maps under considera-
tion.
321. Ta se l` am hai gi
,
a thi

t co
,
b
,
an trn v

n
d
`
ta xem xet.
322. It is required (assumed) that ... 322. ` oi h
,
oi r
`
ang ....
323. The requirement on g is that ... 323. ` oi h
,
oi trn g l` a ...
324. ..., where g is subject to the condition
Lg = 0.
324. ...,
,
o
,
dy g l` a d

i tu
,
.
o
,
ng di
`
u ki
.
n Lg =
0.
325. ..., where g satises the condition
Lg = 0.
325. ...,
,
o
,
dy g th
,
oa m an di
`
u ki
.
n Lg = 0.
326. ..., where g is merely required to be
positive.
326. ...,
,
o
,
dy g du
,
.
o
,
c d` oi h
,
oi l` a du
,
o
,
ng.
327. Let us orient M by the requirement
that g be positive. [Note the inni-
tive.]
327. Ta d
.
inh hu
,
o
,
ng M d` oi h
,
oi r
`
ang g l` a
du
,
o
,
ng.
328. Let us orient M by requiring g to be ... 328. Ta d
.
inh hu
,
o
,
ng M d` oi h
,
oi g l` a ...
329. Let us orient M by imposing the con-
dition: ...
329. Ta hu
,
o
,
ng M b
,
o
,
i di
`
u ki
.
n ...
330. (4) holds for (pro-
vided/whenever/only in case) p ,= 1.
330. (4) d ung cho (mi

n l` a/khi m` a/ch
,

trong tru
,
`o
,
ng h
.
o
,
p) p ,= 1.
331. (4) holds unless p = 1. 331. (4) d` ung tr`u
,
khi p = 1.
332. (4) holds under the condition (hy-
pothesis) that ...
332. (4) d ung v o
,
i di
`
u ki
.
n (gi
,
a thi

t) l` a ....
333. (4) holds under the more general as-
sumption that ...
333. (4) d ung v o
,
i gi
,
a thi

t t
,
ng qu at ho
,
n l` a
....
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 23
334. (4) holds under some further restric-
tions on ...
334. (4) d ung v o
,
i m
.
t s

di
`
u ki
.
n h
.
an ch

trn ....
335. (4) holds under additional (weaker)
assumptions.
335. (4) d ung v o
,
i gi
,
a thi

t thm (y

u ho
,
n).
336. F satises (fails to satisfy) the as-
sumptions of ...
336. F th
,
oa m an (khng th
,
oa m an) c ac gi
,
a
thi

t c
,
ua ...
337. F has the desired (asserted) proper-
ties,
337. F d
`
ngh
.
i ( du
,
a v` ao) tnh ch

t,
338. F provides the desired dirfeomor-
phism.
338. F du
,
.
o
,
c cho l` a d a h

t.
339. F still satises (need not satisfy) the
requirement that ...
339. F v

n th
,
oa m an (khng c
`
n kh
,
oa
m an) d` oi h
,
oi l` a ...
340. F meets this condition, 340. F c o di
`
u ki
.
n n` ay,
341. F does not necessarily have this prop-
erty,
341. F khng c
`
n c o tnh ch

t n` ay,
342. F satises all the other conditions for
membership of X.
342. F th
,
oa m an t

t c
,
a nhu
,
ng di
`
u ki
.
n
kh ac cho th` anh vin c
,
ua X.
343. There is no loss of generality in assum-
ing ...
343. Khng m

t tnh t
,
ng qu at ta gi
,
a
thi

t....
344. Without loss (restriction) of generality
we can assume ...
344. Khng m

t tnh t
,
ng qu at ta c o th
,
gi
,
a
thi

t ...
345. This involves no loss of generality. 345. i
`
u n` ay khng l` am m

t tnh t
,
ng
qu at.
346. We can certainly assume that, since
otherwise ...
346. Ta c o th
,
gi
,
a thi

t ch

ac ch

an di
`
u d o,
v` ngu
,
.
o
,
c l
.
ai ...
347. We can certainly assume that, for ....
[= because]
347. Ta c o th
,
gi
,
a thi

t ch

ac ch

an di
`
u d o,
v o
,
i ....
348. We can certainly assume that, for if
not, we replace ...
348. Ta c o th
,
gi
,
a thi

t ch

ac ch

an di
`
u d o,
n

u khng ta d
,
i ....
349. We can certainly assume that. Indeed,
....
349. Ta c o th
,
gi
,
a thi

t ch

ac ch

an di
`
u d o,
th
.
t v
.
y, ...
350. Neither the hypothesis nor the conclu-
sion is affected if we replace ...
350. Ho
.
ac gi
,
a thi

t ho
.
ac k

t lu
.
n khng
c` on t
.
u
,
nhin nu
,
a n

u ta thay ....
351. By choosing b = a we may actually
assume that ...
351. B
`
ang c ach ch
.
on b = a ta c o th
,
t
.
u
,
nhin gi
,
a thi

t l` a ...
352. If f = 1, which we may assume, then
...
352. N

u f = 1 m` a ta c o th
,
gi
,
a thi

t th`...
353. For simplicity (convenience) we ig-
nore the dependence of F on g. [E.g.
in notation]
353.
,
do
,
n gi
,
an (thu
.
n ti
.
n) ta b
,
o qua
ph
.
u thu
.
c c
,
ua F v` ao g.
354. It is convenient to choose ... 354. Thu
.
n ti
.
n ta ch
.
on ...
355. We can assume, by decreasing k if nec-
essary, that ...
355. Ta c o th
,
gi
,
a thi

t b
`
ang gi
,
am k n

u
c
`
n, l` a ...
356. F meets S transversally, say at F(0). 356. F di qua S, c
.
u th
,
t
.
ai F(0).
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 24
357. There exists a minimal element, say n,
of F.
357. T
`
n t
.
ai ph
`
n t
,
u
,
nh
,
o nh

t, cho d o l` a n,
c
,
ua F.
358. G acts on H as a multiple (say n) of
V .
358. G t ac d
.
ng ln H nhu
,
b
.
i (g
.
oi l` a n)
c
,
ua V .
359. For deniteness (To be specic), con-
sider ...
359. V o
,
i x ac d
.
inh (
,
ch
,
ra), ta xet ...
360. This condition is not particularly re-
strictive,
360. i
`
u ki
.
n n` ay khng c o kha c
.
anh th
.
u
,
c
t

361. This condition is surprisingly mild. 361. i

`
u ki
.
n n` ay l` a d ang ng
.
ac nhin.
362. This condition admits (rules
out/excludes) elements of ...
362. i
`
u ki
.
n n` ay thu v` ao c ac ph
`
n t
,
u
,
c
,
ua
....
363. This condition is essential to the proof. 363. i
`
u ki
.
n n` ay l` a c
`
n thi

t cho ch u
,
ng
minh.
364. This condition can-
not be weakened (re-
laxed/improved/omitted/dropped).
364. i
`
u ki
.
n n` ay khng th
,
y

u ho
,
n.
365. The theorem is true if "open" is
deleted from the hypotheses.
365.
.
inh ly c` on d ung n

u "m
,
o
,
" du
,
.
o
,
c b
,
o di
t`u
,
gi
,
a thi

t.
366. The assumption is superuous (redun-
dant/unnecessarily restrictive).
366. Gi
,
a thi

t l` a qu a c
`
n thi

t (ru
,
`o
,
m r` a).
367. We will now show how to dispense
with the assumption on ...
367. Ch ung ti by gi`o
,
se hi
,
n th
.
i nhu
,
th

n` ao d
,
phn chia v o
,
i c ac gi
,
a d
.
inh v
`
368. Our lemma does not involve any as-
sumptions about curvature.
368. B
,
d
`
c
,
ua ch ung ti khng lin quan
d

n b

t k`y gi
,
a d
.
inh v
`
d
.
cong
369. We have been working under the as-
sumption that ...
369. Ch ung ti d a l` am vi
.
c theo gi
,
a d
.
inh
r
`
ang ...
370. Now suppose that this is no longer so. 370. By gi`o
,
gi
,
a s
,
u
,
r
`
ang di
`
u n` ay khng
c` on nhu
,
v
.
y
371. To study the general case, take ... 371. Nghin c u
,
u tru
,
`o
,
ng h
.
o
,
p chung, ...
372. For the general case, set ... 372. Cho tru
,
`o
,
ng h
.
o
,
p chung ta d
.
at ...
373. The map f will be viewed (re-
garded/thought of) as a functor ... (as
realizing ...)
373.

Anh x
.
a f se du
,
.
o
,
c nh`n nh
.
n (xem xet/
suy ra) nhu
,
h` am s

...
374. From now on we think of L as being
constant.
374. T`u
,
by gi`o
,
ta cho l` a L l` a h
`
ang s

.
375. From now on we regard f as a map
from ...
375. T`u
,
by gi`o
,
ta ta xem f nhu
,
anh x
.
a t`u
,
....
376. From now on we tacitly assume that
...
376. T`u
,
by gi`o
,
ta ng
`
m hi
,
u r
`
ang ...
377. It is understood that r ,= 1. 377. a du
,
.
o
,
c hi
,
u l` a r ,= 1.
378. We adopt (adhere to) the convention
that 0/0 = 0.
378. Ta b
,
o qua (thm v` ao) quy d
.
inh l` a
0/0 = 0
CH
,
U
`
5
Denition -
.
inh ngha
379. A set S is dense if ... 379. T
.
p S l` a tr` u m
.
t n

u ...
380. A set S is called (said to be) dense if
...
380. T
.
p S du
,
.
o
,
c g
.
oi l` a tr` u m
.
t n

u ...
381. We call a set dense if ... 381. Ta g
.
oi m
.
t t
.
p tr` u m
.
t n

u ...
382. We call m the product measure.
[Note: The term dened appears last]
382. Ta g
.
oi m l` a d
.
do tch.
383. The function f is given (dened) by
f =
383. H` am s

f du
,
.
o
,
c cho b
,
o
,
i f =
384. Let f be given (dened) by f = 384. Cho f b
,
o
,
i f =
385. We dene T to be AB +CD. 385. Ta d
.
inh ngha T l` a AB +CD.
386. This map is dened by requiring f to
be constant on ...
386.

Anh x
.
a n` ay du
,
.
o
,
c d
.
inh ngha d` oi h
,
oi f
l` a h
`
ang s

trn ...
387. This map is dened by the require-
ment that f be constant on .... [Note
the innitive.]
387.

Anh x
.
a n` ay du
,
.
o
,
c d
.
inh ngha b
,
o
,
i d` oi
h
,
oi f h
`
ang s

trn ...
388. This map is dened by I imposing the
following condition:
388.

Anh x
.
a n` ay du
,
.
o
,
c x ac d
.
inh b
,
o
,
i ti g

an
thm di
`
u ki
.
n sau dy.
389. The length of a sequence is, by deni-
tion, the number of ...
389.
.
d` ai c
,
ua m
.
t d ay theo d
.
inh ngha l` a
s

c
,
ua ...
390. The length of T, denoted by l(T), is
dened to be ...
390.
.
d` ai c
,
ua T, ky hi
.
u b
,
o
,
i l(T), du
,
.
o
,
c
x ac d
.
inh b
`
ang ....
391. By the length of T we mean ... 391. B
`
ang d
.
d` ai c
,
ua T, ta theo ngha ...
392. Before stating the main theorem we
rst dene ...
392. Tru
,
o
,
c khi ph at bi
,
u d
.
inh ly chnh ta se
d
.
inh ngha ...
393. A function F is said to be ... if ... 393. H` am s

F du
,
.
o
,
c g
.
oi l` a ... n

u ...
394. Recall that a directional derivative is
dened as follows ...
394. Nh

ac l
.
ai r
`
ang d
.
ao h` am theo hu
,
o
,
ng
du
,
.
o
,
c d
.
inh ngha nhu
,
sau ...
395. With this in mind, dene the ... as fol-
lows ...
395. Nh o
,
di
`
u d o, d
.
inh ngha ... nhu
,
sau ...
396. Modifying the well-known denition
of ...
396. S
,
u
,
a d
,
i d
.
inh ngha quen bi

t c
,
ua ...
397. Basing on the the fact that ... one can
dene ...
397. D
.
u
,
a trn s
.
u
,
ki
.
n l` a ... ta c o th
,
d
.
inh
ngha ...
398. ..., where F
n
is the operator dened
inductively by ...
398. ...,
,
o
,
d o F
n
l` a to an t
,
u
,
du
,
.
o
,
c d
.
inh ngha
theo qui n
.
ap b
`
ang ...
399. For the purpose of the present paper,
a more limited denition of ... is used.
399. Do m
.
uc dch c
,
ua b` ai n` ay, m
.
t d
.
inh
ngha h
.
an ch

ho
,
n c
,
ua ... du
,
.
o
,
c s
,
u
,
d
.
ung.
400. Motivated by this fact, we introduce
the following notion.
400. Do c o s
.
u
,
ki
.
n d o, ch ung ta du
,
a v` ao
kh ai ni
.
m sau.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 26
401. These notions wll be needed in subse-
quent chapters.
401. Ta se c
`
n nhu
,
ng kh ai ni
.
m d o trong
c ac chu
,
o
,
ng sau.
402. ... are called the lower and the upper
base of respectively.
402. ... du
,
.
o
,
c g
.
oi, theo th u
,
t
.
u
,
l` a co
,
s
,
o
,
du
,
o
,
i
v` a co
,
s
,
o
,
trn c
,
ua P.
403. Consequently, writing g(x) = g(x)
whenever x = (x) unabigously de-
nes a function g.
403. V` v
.
y, vi

t g(x) = g(x) m

i khi x =
(x), ta se x ac d
.
inh khng nh
.
p nh
`
ang
h` am g.
404. Corresponding to each point x there is
a Baire open set V (x)...
404. Tu
,
o
,
ng u
,
ng v o
,
i m

i di
,
m x c o m
.
t t
.
p
m
,
o
,
Baire V (x) ...
405. To say that H
A
in coproduct preserv-
ing is equivalent to saying that ...
405. B
,
ao r
`
ang H
A
b
,
ao to` an d

i tch l` a
tu
,
o
,
ng du
,
o
,
ng v o
,
i b
,
ao r
`
ang ...
406. By a complex is meant a sequence ... 406. M
.
t ph u
,
c du
,
.
o
,
c hi
,
u l` a l` a m
.
t d ay ....
407. By a simplex we mean ... 407. M
.
t do
,
n h`nh du
,
.
o
,
c hi
,
u l` a ....
408. The translation is uniquely deter-
mined to within a homotopy
408. Phep t
.
inh ti

n du
,
.
o
,
c x ac d
.
inh duy nh

t,
ch
,
sai kh ac m
.
t phep d
`
ng lun.
409. We shall refer to this as the canonical
transformation.
409. Ta se g
.
oi phep bi

n d
,
i d o l` a phep bi

n
d
,
i chnh t

ac.
410. The function s that assigns to x the im-
age s(x) of ...
410. H` am s d
.
at tu
,
o
,
ng u
,
ng v o
,
i x
,
anh s(x)
c
,
ua ...
411. Instead of saying that a translation is
inessential we can equally wel say that
it is null homotopic.
411. Thay v` n oi r
`
ang m
.
t phep t
.
inh ti

n l` a
khng c

t y

u ta c o th
,
n oi n o l` a d
`
ng
lun khng.
412. This important denition require a bit
of explanation and justication.
412.
.
inh ngha quan tr
.
ong n` ay c
`
n c o di
ch ut gi
,
ai thch v` a bi
.
n minh.
413. This notion requires some extra back-
ground material for its denition.
413. Kh ai ni
.
m n` ay d` oi h
,
oi m
.
t s

di
`
u
chu
,
n b
.
i thm tru
,
o
,
c khi d
.
inh ngha.
414. ... will often be used 414. ... se thu
,
`o
,
ng du
,
.
o
,
c d` ung.
415. We are now going to dened 415. Ta s

ap s
,
u
,
a d
.
inh ngha
416. We now turn to the denition of ... 416. By gi`o
,
ta chuy
,
n sang d
.
inh ngha ...
417. We shall need in the sequel ... 417. Trong ph
`
n sau ta se c
`
n d

n ...
418. Each one of its vertices ... 418. M

i d
,
nh c
,
ua n o ...
419. Every one of its faces ... 419. M

i di
.
n c
,
ua n o ...
420. Let there now be given a complex .... 420. By gi`o
,
cho m
.
t ph u
,
c h`nh ...
421. ... a complex without a boundary 421. ... m
.
t ph u
,
c h`nh khng c o bin.
422. ... a space without a topology 422. ... m
.
t khng gian khng c o t p.
423. The following lemma states one of the
most important properties of ...
423. B
,
d
`
sau ph at bi
,
u m
.
t trong nhu
,
ng
tnh ch

t quan tr
.
ong nh

t c
,
ua ...
424. The main tool for our proofs will be
the following Lemma.
424. Cng c
.
u chnh trong ch u
,
ng minh c
,
ua
ta se l` a b
,
d
`
sau.
425. The next theorem will be fundamental
in this paper.
425.
.
inh ly sau se l` a co
,
b
,
an trong b` ai n` ay.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 27
426. This lemma will play a crucial role in
the following development.
426. B
,
d
`
n` ay se d ong vai tr` o then ch

t
trong ph
`
n sau dy.
427. The results can be summarized as fol-
lows.
427. K

t qu
,
a c o th
,
du
,
.
o
,
c t om t

at nhu
,
sau.
428. The following theorem is a sharpening
of the results in ...
428.
.
inh ly sau dy l` a s
.
u
,
m` ai s

ac c ac k

t
qu
,
a trong ...
429. The following theorem generalizes
(extends) a result of ...
429.
.
inh ly sau dy t
,
ng qu at (m
,
o
,
r
.
ng)
k

t qu
,
a c
,
ua ...
430. The theorem reads as follows. 430.
.
inh ly n` ay ph at bi
,
u nhu
,
sau.
431. The theorem can be stated (formu-
lated) as follows.
431.
.
inh ly n` ay c o th
,
ph at bi
,
u nhu
,
sau.
432. Under suitable hypotheses ... 432. V o
,
i nhu
,
ng gi
,
a thi

t thch h
.
o
,
p ...
433. Under these conditions, ... 433. Trong di
`
u ki
.
n d o, ...
434. In order that ..., a sufcient and nec-
essary condition is that ...
434.
,
..., di
`
u ki
.
n c
`
n v` a d
,
u l` a ...
435. In order that ..., it is necessary and suf-
cient that ...
435.
,
..., c
`
n v` a d
,
u l` a ...
436. If F is chosen so that ..., then all the
following assertions hold.
436. N

u F du
,
.
o
,
c ch
.
on sao cho ..., th`
nhu
,
ng di
`
u kh
,
ang d
.
inh sau dy l` a
d ung.
437. There exists a function f satisfying ... 437. T
`
n t
.
ai h` am f th
,
oa m an ...
438. There exists a function f such that ... 438. T
`
n t
.
ai h` am f sao cho ...
439. There exists a function f with the
property that ...
439. T
`
n t
.
ai h` am f v o
,
i tnh ch

t l` a ...
440. There exists a set G, neither empty nor
the whole space, which is both open
and closed.
440. T
`
n t
.
ai t
.
p G, khng r

ng v` a c ung
khng tr` ung to` an b
.
khng gian m` a
v`u
,
a d ong v`u
,
a m
,
o
,
.
441. The following conditions are equiva-
lent
441. C ac di
`
u ki
.
n sau dy l` a tu
,
o
,
ng du
,
o
,
ng.
442. Let there be given a set A ... 442. Cho tru
,
o
,
c t
.
p A ...
443. Assume the hypotheses of theorem
2.1; in addition assume that ...
443. V o
,
i nhu
,
ng gi
,
a thi

t c
,
ua d
.
inh ly 2.1 v` a
ngo` ai ra gi
,
a thi

t thm r
`
ang ...
444. Under the stated assumption 444. V o
,
i gi
,
a thi

t d a nu
445. Under the hypotheses of ... 445. V o
,
i gi
,
a thi

t v
`
...
446. The assumption ... may be dropped. 446. Gi
,
a thi

t ... c o th
,
b
,
o.
447. In this section we make the blanket as-
sumption that ...
447. Trong ph
`
n n` ay ta gi
,
a thi

t bao tr` um
l` a ...
448. A sufcient condition that (1) hold is
that ...
448. i
`
u ki
.
n d
,
u d
,
c o (1) l` a ...
449. No assumptions are made about y
k

accept that the sequence is contained

in D.
449. Khng c o gi
,
a thi

t n` ao v
`
d ay y
k
,
tr`u
,
vi
.
c n o ph
,
ai n
`
am trong D.
450. This assumption is not too considera-
tion ...
450. Gi
,
a thi

t d o khng qu a ng
.
at, v` r
`
ang
...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 28
451. The problem under consideration ... 451. V

n d
`
dang xet ...
452. Assume, furthermore, that ... 452. Gi
,
a thi

t thm nu
,
a r
`
ang ...
453. Assume, in addition, that ... 453. Gi
,
a thi

t thm v` ao, r
`
ang ...
454. Conversely, the converse inclusion. 454. Ngu
,
.
o
,
c l
.
ai, bao h` am th u
,
c ngu
,
.
o
,
c l
.
ai.
455. In the converse direction ... 455. Theo chi
`
u ngu
,
.
o
,
c l
.
ai ...
456. Note, however, that the converse of
this statement need not necessarily
hold.
456. Tuy nhin d
,
y r
`
ang d
,
ao d
`
c
,
ua m
.
nh
d
`
n` ay khng d ung.
457. A set is closed if ..., or, equivalently, if
...
457. M
.
t t
.
p l` a d ong n

u ... hay, m
.
t c ach
tu
,
o
,
ng du
,
o
,
ng, n

u
458. A set is open if ..., or, which amounts
to the same, if ...
458. M
.
t t
.
p l` a m
,
o
,
n

u ..., hay, n oi m
.
t
c ach kh ac, c ung tu
,
o
,
ng du
,
o
,
ng, n

u ...
459. f can be factored as A

uB, with
f

an epimorphism and u a monomor-

phism.
459. f c o th
,
phn t ach th` anhA

uB, v o
,
i
f

l` a m
.
t to` an c
`
u v` a u l` a m
.
t do
,
n
c

u.
460. ... has precisely (exactly, just) one ele-
ment.
460. ... c o v`u
,
a d ung m
.
t ph
`
n t
,
u
,
.
461. Then ker = ker in the sense that
if either side is dened the so is the
other and they are equal.
461. Khi

y ker = ker , theo ngha l` a

n

u m
.
t v

du
,
.
o
,
c x ac d
.
inh th` v

kia
c ung th

v` a hai v

b
`
ang nhau.
462. However, A
1
and A
2
may be isomor-
phic objects without being isomorphic
subobjects of A.
462. Tuy nhin, A
1
v` a A
2
c o th
,
l` a d

i
tu
,
.
o
,
ng d
,
ang c

u, m` a v

n khng ph
,
ai
l` a d

i tu
,
.
o
,
ng con d
,
ang c

u c
,
ua A.
463. There may be an isomorphism :
A
1
A
2
without it being true that

2
is the same
1
.
463. C o th
,
c o m
.
t d
,
ang c

u : A
1
A
2
m` a
2
v

n khng ph
,
ai l` a d
`
ng nh

t
v o
,
i
1
.
464. This property provides a useful al-
ternative to the original denition of
closed sets.
464. Tnh ch

t n` ay cho ta m
.
t d
.
inh ngha
m o
,
i c och, kh ac v o
,
i d
.
inh ngha g

c v
`
t
.
p d ong.
465. It may happen that ... Should this be
so then we say that ...
465. C o th
,
x
,
ay ra l` a ... N

u nhu
,
v
.
y th` ta
n oi r
`
ang ...
466. The rules for taking the product ... 466. C ac quy t

ac d
,
l

y tch ...
467. A group consisting of 0 alone. 467. M
.
t nh om ch
,
g
`
m 0 m` a thi.
468. The only case in which rule 1 fails is
when F is ...
468. Tru
,
`o
,
ng h
.
o
,
p duy nh

t m` a quy t

ac 1
khng d ung l` a khi F l` a ...
469. In so doing, we are led to a general-
ization ...
469. L` am nhu
,
th

, ta di d

n m
.
t kh ai qu at
...
470. The theorem can be restated as fol-
lows.
470.
.
inh ly c o th
,
ph at bi
,
u l
.
ai nhu
,
sau.
471. The haline emanating from a in the
direction of the vector b.
471. N
,
u
,
a du
,
`o
,
ng th
,
ang ph at xu

t t`u
,
a theo
phu
,
o
,
ng vec t
,
o
,
b.
472. The are emanating frmo x
0
and con-
tained in D.
472. Cung di t`u
,
x
0
v` a ch u
,
a trong D.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 29
473. A local optimum may fail to be a
global one.
473. M
.
t t

i u
,
u d
.
ia phu
,
o
,
ng c o th
,
khng
ph
,
ai l` a t

i u
,
u to` an c
.
uc.
474. In dealing with modules we are, above
all, concerned with certain objects and
certain natural mappings of these ob-
jects ...
474. Khi nghin c u
,
u v
`
mo dun ta quan tm
tru
,
o
,
c h

t d

n nhu
,
ng d

i tu
,
.
o
,
ng v` a anh
x
.
a t
.
u
,
nhin c
,
ua c ac v
.
t d o ...
475. As will be seen shortly 475. Nhu
,
se th

y r o ngay sau dy
476. As will be proved later 476. Nhu
,
se du
,
.
o
,
c ch u
,
ng minh du
,
o
,
i dy.
477. To illustrate this, consider ... 477.
,
minh h
.
oa di
`
u n` ay, ta xet ...
478. It should be borne in mind that ... 478. C
`
n ph
,
ai lun lun nh o
,
r
`
ang ...
479. In actual practice 479. Trong th
.
u
,
c h` anh
480. The previous section 480. o
.
an tru
,
o
,
c
481. The foregoing section 481. o
.
an tru
,
o
,
c
482. The rst two requirements ... 482. Hai d` oi h
,
oi th u
,
nh

t ...
483. As previously indicated, ... 483. Nhu
,
d a ch
,
ra
,
o
,
trn, ...
484. This theorem was rst established by
...
484.
.
inh ly n` ay thi

t l
.
p d
`
u tin b
,
o
,
i
485. ... when y is temporarily held xed. 485. ... khi y du
,
.
o
,
c t
.
am th`o
,
i giu
,
c

d
.
inh.
486. ... according to whether U is complete
or not.
486. ... t` uy theo U l` a d
,
u hay khng.
487. Depending on the choice of the inter-
polation points, there are numerous
possible different specic methods.
487. T` uy theo c ach ch
.
on c ac di
,
m n
.
i suy,
ta c o th
,
c o nhi
`
u phu
,
o
,
ng ph ap d
.
ac
th` u kh ac nhau.
488. ... with arbitrary accuracy. 488. ... v o
,
i d
.
chnh x ac t` uy y.
489. We extend F to R
n
by setting F
1
(x) to
be F(x) if x C, otherwise.
489. Ta khuy

ch F ra to` an R
n
b
`
ang c ach
d
.
at F
1
(x) b
`
ang F(x) n

u x C v` a
b
`
ang n

u tr ai l
.
ai.
490. ... for the mapping f concerned 490. ... d

i v o
,
i anh x
.
a f m` a ta xet.
491. ... where the continuity is with respect
to the strong topology of H.
491. ... trong d o s
.
u
,
lin t
.
uc du
,
.
o
,
c hi
,
u theo
t p m
.
anh c
,
ua H.
492. There must exist distinct points x
1
and
x
2
in D whose connecting line seg-
ment contains a point of C.
492. Ph
,
ai t
`
n t
.
ai hai di
,
m phn bi
.
t x
1
v` a
x
2
trong D m` a do
.
an th
,
ang n

i li
`
n
ch ung c o ch u
,
a m
.
t di
,
m c
,
ua C.
493. The ball of radius r centered at x. 493. H`nh c
`
u b an knh r, tm
,
o
,
x.
494. The ball of radius r around x. 494. H`nh c
`
u b an knh r, tm
,
o
,
x.
495. If two closed convex sets C and D
each have O as an interior point and
are bounded, then the radial projec-
tion of C on D is a contracting map-
ping in C and is also an homeomor-
phism.
495. N

u C, D l` a hai t
.
p l
`
i d ong m` a m

i
c ai d
`
u nh
.
n 0 l` am di
,
m trong v` a d
`
u
b
.
i ch
.
an, th` phep chi

u tia t`u
,
C ln D
l` a m
.
t anh x
.
a co trong C v` a c ung l` a
m
.
t phep d
`
ng phi.
496. As small as we please 496. Nh
,
o bao nhiu t` uy y
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 30
497. In using the procedure one deter-
mines from this bound whether x
n
is
acceptable and, if not, reduces n and
solves again ...
497. Khi d` ung th
,
u t
.
uc n` ay ta d
.
u
,
a v` ao c
.
n
d o d
,
x ac d
.
inh xem x
n
c o th
,
ch

p
nh
.
n du
,
.
o
,
c khng, v` a n

u khng, th`
gi
,
am n v` a l
.
ai gi
,
ai ...
498. ... for any interval of sufciently small
diameter.
498. ... v o
,
i m

i kho
,
ang c o du
,
`o
,
ng knh d
,
u
nh
,
o.
499. There exists
1
, ...,
n
, not all zero,
such that ...
499. C o t
`
n t
.
ai c ac s

1
, ...,
n
khng d
`
ng
th`o
,
i b
`
ang 0, sao cho ...
500. Taking conditional probabilities
amounts to choosing H as a new
sample space.
500. L

y c ac x ac su

t c o di
`
u ki
.
n c ung
tu
,
o
,
ng du
,
o
,
ng v o
,
i ch
.
on H l` am khng
gian ch
.
on m

u m o
,
i.
CH
,
U
`
6
Theorem -
.
inh l y
6.1. Theorem formulation - Ph at bi
,
u d
.
inh l y
501. If ... and if ... , then ... 501. khi ... v` a khi, khi d o ....
502. Let M be .... 502. Cho M l` a ...
503. Suppose that .... 503. Gi
,
a s
,
u
,
r
`
ang
504. Assume that .... 504. Gi
,
a thi

t r
`
ang ...
505. Write ... 505. Vi

t ...
506. Then ..., provided m ,= 1. 506. Khi d o ..., du
,
.
o
,
c cung c

p m ,= 1
507. Then ... unless m = 1. 507. Khi d o .... tr`u
,
khi m = 1.
508. Then ... with g a constant satisfying ... 508. Khi d o ... v o
,
i g m
.
t h
`
ang s

th
,
oa m an
...
509. Furthermore (Moreover), ... 509. Ho
,
n nu
,
a
510. In fact,... [= To be more precise] 510. Th
.
u
,
c t

, ...[= se l` a chnh x ac ho
,
n]
511. Accordingly, ... [= Thus] 511. Cho nn [= Thus]
512. Given any f ,= 1 suppose that ... Then
...
512. Cho f ,= 1 b

t k`y gi
,
a s
,
u
,
r
`
ang ... Khi d o
513. Let P satisfy the hypotheses of ... Then
...
513. Cho P th
,
oa m an gi
,
a thi

t ... Khi d o ....

514. Let P satisfy the above assumptions.
Then ...
514. Cho P th
,
oa m an gi
,
a thi

t trn. Khi d o
...
515. Let P satisfy N(P) = l. Then ... 515. Cho P th
,
oa m an N(P) = l. Khi d o ...
516. Let assumptions 1-5 hold. Then ... 516. Cho gi
,
a thi

t 1-5 d ung. Khi d o ...

517. Under the above assumptions, ... 517. Du
,
o
,
i gi
,
a thi

t trn, ...
518. Under the same hypotheses ... 518. Du
,
o
,
i nhu
,
ng gi
,
a thuy

t n` ay ....
519. Under the conditions stated above, ... 519. Du
,
o
,
i nhu
,
ng di
`
u ki
.
n d a ph at bi
,
u
,
o
,
trn, ...
520. Under the assumptions of Theorem 2
with "convergent" replaced by "weakly
convergent", ...
520. Du
,
o
,
i gi
,
a thi

t c
,
ua
.
inh ly 2 v o
,
i "h
.
i
t
.
u" du
,
.
o
,
c thay b
,
o
,
i "h
.
i t
.
u y

u",...
521. Under the hypotheses of Theorem 5, if
moreover ...
521. Du
,
o
,
i gi
,
a thuy

t c
,
ua
.
inh ly 5, n

u ho
,
n
th

...
522. Equality holds in (8) if and only if ... 522.
,
ang th u
,
c d ung tring (8) khi v` a ch
,

khi ...
523. The following conditions are equiva-
lent: ...
523. Nhu
,
ng di
`
u ki
.
n sau dy l` a tu
,
o
,
ng
du
,
o
,
ng,...
6.2 Theorem introductory - Gi o
,
i thi
.
u c
,
ua d
.
inh ly 32
6.2. Theorem introductory - Gi

o
,
i thi
.
u c
,
ua d
.
inh l y
524. We have thus proved ... 524. Ta d a ch u
,
ng minh di
`
u n` ay ...
525. Summarizing, we have ... 525. T

m l
.
ai, ta c o ...
526. We can now rephrase Theorem 8 as
follows.
526. Ta c o th
,
nh

ac l
.
ai
.
inh ly 8 nhu
,
sau.
527. We can now state the analogue of ... 527. By gi`o
,
ta c o th
,
ph at bi
,
u tu
,
o
,
ng t
.
u
,
....
528. We can now formulate our main re-
sults.
528. Ta c o th
,
ph at bi
,
u nhu
,
ng k

t qu
,
a
chnh c
,
ua ta.
529. We are thus led to the following
strengthening of Theorem 6:
529. Ch ung ta nhu
,
v
.
y d

n d

n d
.
d` ai c
,
ua

.
inh ly 6.
530. The remainder of this section will be
devoted to the proof of ...
530. Ph
`
n c` on l
.
ai c
,
ua do
.
an n` ay se d` anh cho
ch u
,
ng minh c
,
ua ....
531. The continuity of A is established by
our next theorem.
531. Tnh lin t
.
uc c
,
ua A du
,
.
o
,
c li
.
t k b
,
o
,
i
d
.
inh ly sau dy c
,
ua ch ung ti.
532. The following result may be proved in
much the same way as Theorem 6.
532. Nhu
,
ng k

t qu
,
a sau dy c o th
,
du
,
.
o
,
c
ch u
,
ng minh c` ung m
.
t c ach nhu
,

.
inh
ly 6.
533. Here are some elementary properties
of these concepts.
533.
,
O
,
dy l` a nhu
,
ng tnh ch

t co
,
b
,
an c
,
ua
nhu
,
ng kh ai ni
.
m n` ay.
534. Let us mention two important conse-
quences of the theorem.
534. Ta k
,
ra dy hai h
.
qu
,
a quan tr
.
ong c
,
ua

.
inh ly.
535. We begin with a general result on such
operators.
535. Ta b

at d
`
u v o
,
i m
.
t k

t qu
,
a t
,
ng qu at
trn nhu
,
ng to an t
,
u
,
n` ay.
6.3. Theorem remarks - Nh

u
,
ng ch u y c
,
ua d
.
inh l y
536. This theorem is an extension (a fairly
straightforward generalization/a
sharpened version/a renement) of ...
536.
.
inh ly n` ay l` a m
.
t m
,
o
,
r
.
ng (m
.
t t
,
ng
qu at h oa tr
.
u
,
c ti

p/phin b
,
an h`nh
th u
,
c kh ac/m
.
t tinh t

ho
,
n)
537. This theorem is an analogue of ... 537.
.
inh ly n` ay tu
,
o
,
ng t
.
u
,
nhu
,
....
538. This theorem is a reformulation (re-
statement) of ... in terms of ...
538.
.
inh ly n` ay l` a m
.
t ph at bi
,
u l
.
ai c
,
ua
.... trong thu
.
t ngu
,
c
,
ua ....
539. This theorem is analogous to ..... 539.
.
inh ly n` ay tu
,
o
,
ng t
.
u
,
v o
,
i .....
540. This theorem is a partial converse of
...
540.
.
inh ly n` ay l` a ph
`
n ngu
,
.
o
,
c l
.
ai c
,
ua ....
541. This theorem is an answer to a ques-
tion raised by ...
541.
.
inh ly n` ay l` a m
.
t cu tr
,
a l`o
,
i cu h
,
oi
du
,
a ra b
,
o
,
i .....
542. This theorem deals with ... 542.
.
inh ly n` ay lin quan v o
,
i ...
543. This theorem ensures the existence of
...
543.
.
inh ly n` ay kh
,
ang d
.
inh s
.
u
,
t
`
n t
.
ai c
,
ua
....
6.3 Theorem remarks - Nh u
,
ng ch u y c
,
ua d
.
inh ly 33
544. This theorem expresses the equiva-
lence of ...
544.
.
inh ly n` ay tr`nh b` ay s
.
u
,
tu
,
o
,
ng du
,
o
,
ng
c
,
ua ...
545. This theorem provides a criterion for
...
545.
.
inh ly n` ay du
,
a ra m
.
t tiu chu
,
n cho
....
546. This theorem yields information about
...
546.
.
inh ly n` ay l` am t

t thng tin v
`
....
547. This theorem makes it legitimate to
apply ...
547.
.
inh ly n` ay l` am h
.
o
,
p ph ap h oa cho ap
d
.
ung ....
548. The theorem states (asserts/shows)
that ...
548.
.
inh ly ph at bi
,
u r
`
ang ....
549. Roughly (Loosely) speaking, the for-
mula says that ...
549. M
.
t c ach m
.
anh me, cng th u
,
c ph at
bi
,
u r
`
ang ....
550. When f is open, (3.7) just amounts to
saying that ...
550. Khi f l` a m
,
o
,
, (3.7) d ung c o ngha d
,
n oi r
`
ang ....
551. When f is open, (3.7) just amounts to
the fact that ...
551. Khi f l` a m
,
o
,
, (3.7) d ung c o ngha d
,
kh
,
ang d
.
inh r
`
ang ....
552. Here is another way of stating (c): ... 552.
553. Another way of stating (c) is to say: ... 553. M
.
t c ach kh ac ph at bi
,
u (c) n oi l` a ....
554. An equivalent formulation of (c) is: ... 554. M
.
t ph at bi
,
u tu
,
o
,
ng du
,
o
,
ng c
,
ua (c) l` a
....
555. Theorems 2 and 3 may be summa-
rized by saying that ...
555.
.
inh ly 2 v` a 3 c o th
,
t om l
.
ai b
`
ang c ach
n oi r
`
ang ....
556. Assertion (ii) is nothing but the state-
ment that ...
556. Kh
,
ang d
.
inh (ii) khng l` a g` nhu
,
ng
m
.
nh d
`
ph at bi
,
u r
`
ang ....
557. Geometrically speaking, the hypothe-
sis is that .... : part of the conclusion is
that ....
557. N oi m
.
t c ach h`nh h
.
oc, gi
,
a thuy

t n` ay
l` a ....: m
.
t ph
`
n c
,
ua k

t lu
.
n l` a ....
558. The interest of the lemma is in the as-
sertion ... (that it allows one to ...)
558. Quan tm c
,
ua b
,
d
`
l` a trong kh
,
ang
d
.
inh ....
559. The principal signicance of the
lemma is in the assertion ... (that it al-
lows one to ...)
559. D

u hi
.
u nguyn ly c
,
ua b
,
d
`
l` a trong
kh
,
ang d
.
inh ...
560. The point of the lemma is in the asser-
tion ... (that it allows one to ...)
560. Ch
,
ra b
,
d
`
n` ay l` a trong kh
,
ang d
.
inh
.....
561. If we take f = we recover the stan-
dard lemma ([7, Theorem 5]).
561. N

u ta l

y f = ta l

y l
.
ai b
,
d
`
co
,
b
,
an
([7,
.
inh ly 5]).
562. Replacing f by f, we recover the
standard lemma ([7, Theorem 5]).
562. Thay f b
`
ang f, ta ph
.
uc h
`
i l
.
ai b
,
d
`
co
,
b
,
an ([7,
.
inh ly 5]).
563. This specializes to the result of [7] if
f = g.
563. Nhu
,
ng d
.
ac bi
.
t h oa cho k

t qu
,
a c
,
ua
[7] n

u f = g.
564. This result will be needed in Section
8.
564. K

t qu
,
a n` ay se du
,
.
o
,
c c
`
n trong do
.
an 8.
565. This result will prove extremely useful
in Section 8.
565. K

t qu
,
a n` ay se ch u
,
ng minh cu

i c` ung
c o ch trong do
.
an 8.
6.3 Theorem remarks - Nh u
,
ng ch u y c
,
ua d
.
inh ly 34
566. This result will not be needed until
Section 8.
566. K

t qu
,
a n` ay d a khng c
`
n t o
,
i do
.
an 8.
567. It is worth pointing out that ... 567. ang ch
,
ra r
`
ang ...
568. Theorem 2.1 still holds if .... 568.
.
inh ly 2.1 v

n d ung n

u ...
569. Theorem 2.1 remains valid if ... 569.
.
inh ly 2.1 v

n c` on hi
.
u l
.
u
,
n

u ...
570. Theorem 2.1 remains in force if ... 570.
.
inh ly 2.1 v

n c` on hi
.
u l
.
u
,
n

u ...
571. It is to be noticed that ... 571. C
`
n ch u y l` a ...
572. It is worth noticing that ... 572. C
`
n ch u y l` a ...
573. The statement of Theorem 2.1 here is
a litle more general than in [10]
573. C ach ph at tri
,
n c
,
ua
.
inh ly 2.1
,
o
,
dy
t
,
ng qu at ho
,
n m
.
t ch ut so v o
,
i
,
o
,
trong
[10]
574. Under hypothesises weaker than those
above, one obtains a correspondingly
weaker conclusion.
574. V o
,
i nhu
,
ng gi
,
a thi

t nh
.
e ho
,
n gi
,
a thi

t
trn, ngu
,
`o
,
i ta nh
.
n du
,
.
o
,
c k

t qu
,
a y

u
ho
,
n tu
,
o
,
ng u
,
ng.
575. The results of Theorem2.1 extend and
generalize some of the correspond-
ing results in nite dimensional situ-
ations, see Ref [6].
575. K

t qu
,
a c
,
ua
.
inh ly 2.1 m
,
o
,
r
.
ng v` a
t
,
ng qu at m
.
t s

t qu
,
a tu
,
o
,
ng u
,
ng
trong tru
,
`o
,
ng h
.
o
,
p hu
,
u h an chi
`
u, xem
t` ai li
.
u d

n [6].
576. Note that Proposition 2.1 does not
hold without the assumption ...
576. Lu
,
u y r
`
ang M
.
nh d
`
2.1 khng c` on
d ung khi thi

u gi
,
a thi

t ...
577. The cause of the failure is that .... 577. Nguyn nhn th

t b
.
ai l` a ...
578. Assumption (ii) of Theorem 3.2 is not
as restrictive as it might appear. We
can give a sufcient condition which
ensures the satisfaction of this as-
sumption.
578. Gi
,
a thi

t (ii) c
,
ua
.
inh ly 3.2 khng
d

n n

i ng
.
at ngh`eo nhu
,
ta c
,
am th

y.
Ta c o th
,
cho m
.
t di
`
u ki
.
n d
,
u d
,
b
,
ao
d
,
am cho gi
,
a thi

t n` ay du
,
.
o
,
c th
,
oa m an.
579. The condition (2) has the advantage
not only in being weaker, but in giving
an explicit characterization ...
579. i
`
u ki
.
n (2) c o u
,
u di
,
m khng ch
,

,
o
,
ch

n o y

u ho
,
n, m` a c` on
,
o
,
ch

cho ta
s
.
u
,
d
.
ac tru
,
ng tu
,
`o
,
ng minh ...
580. Theorem 1 states one of the most im-
portant properties of ...
580.
.
inh ly 1 nu ln m
.
t trong nhu
,
ng
tnh ch

t quan tr
.
ong nh

t c
,
ua ...
581. There are certain unanswered ques-
tions regarding ...
581. C o m
.
t s

n d
`
c` on m
,
o
,
lin quan t o
,
i
...
582. Two interesting questions can be
raised for further study ...
582. Hai cu h
,
oi th u v
.
i c o th
,
d
.
at ra d
,
nghin c u
,
u xa ho
,
n ...
583. It is an open question whether a
weaker condition can be found to im-
ply ...
583. V

n d
`
c` on m
,
o
,
l` a li
.
u c o th
,
t`m du
,
.
o
,
c
di
`
u ki
.
n y

u ho
,
n d
,
keo theo ...
584. For the method to be of interest, it is
essential that ...
584.
,
phu
,
o
,
ng ph ap du
,
.
o
,
c hay, di
`
u c

t
y

u l` a ...
585. In the interest of simplicity we have
avoided the most general presentation
and restricted our attention to ...
585. V` mu

n cho do
,
n gi
,
an, ta tr anh c ach
tr`nh b` ay t
,
ng qu at nh

t v` a h
.
an ch

s
.
u
,
ch u y c
,
ua ta v
`
...
6.3 Theorem remarks - Nh u
,
ng ch u y c
,
ua d
.
inh ly 35
586. We nowexamine howthe general case
can be treated.
586. By gi`o
,
ta xet tru
,
`o
,
ng h
.
o
,
p t
,
ng qu at
du
,
.
o
,
c lu
.
n gi
,
ai nhu
,
th

n` ao.
587. We refer to Demyanov [5] for a more
general and detailed discussion of this
problem.
587. Xin tham kh
,
ao Demyanov [5] mong
mu

n b` an lu
.
n t
,
ng qu at v` a chi ti

t
ho
,
n v
`
v

n d
`
n` ay.
588. We would like to point out another
consequence of Theorem 2 in passing,
even though it has nothing to do with
the main topic of this section.
588. Ch ung ti mu

n nu r o nhn dy m
.
t
h
.
qu
,
a kh ac c
,
ua
.
inh ly 2, m
.
ac d` u n o
khng dnh d ang g` d

n ch
,
u d
`
chnh
c
,
ua do
.
an n` ay.
589. The most successful algorithm to date
is due to Newton.
589. Thu
.
t to an hu
,
u hi
.
u nh

t cho d

n nay
l` a do Newton du
,
a ra.
590. The advantage of this algorithmis that
it allows the method to be used in the
case ...
590. U
,
u di
,
m c
,
ua thu
.
t to an n` ay l` a
,
o
,
ch

n o cho phep s
,
u
,
d
.
ung phu
,
o
,
ng ph ap d o
trong tru
,
`o
,
ng h
.
o
,
p ...
591. At about the same time that the paper
of E. Brown appeared, A. Black con-
sidered ...
591. G
`
n nhu
,
c` ung m
.
t l uc xu

t hi
.
n b` ai
b ao c
,
ua E. Brown, th` A. Black d a xet
...
592. For other essential results, peruse Ref.
5 or Ref. 8.
592. V
`
nhu
,
ng k

t qu
,
a c

t y

u kh ac, h ay
d
.
oc ky t` ai li
.
u 5 ho
.
ac t` ai li
.
u 8.
593. We conclude this paper with the fol-
lowing comments.
593. Ta k

t th uc b` ai b ao n` ay v o
,
i nhu
,
ng
nh
.
n xet sau.
594. Several comments are called for in
connection with ...
594. M
.
t v` ai l`o
,
i b`nh lu
.
n c
`
n du
,
.
o
,
c du
,
a ra
lin quan t o
,
i ...
595. Introductory remarks 595. Nh
.
n xet m
,
o
,
d
`
u
596. Concluding remarks 596. Nh
.
n xet k

t lu
.
n
597. We close the paper with 597. Ta k

t th uc b` ai b ao b
`
ang
598. We conclude the paper with 598. Ta k

t th uc b` ai b ao b
`
ang
CH
,
U
`
7
Proofs - Ch

u
,
ng minh
7.1. Proof Arguments - C ac l
.
p lu
.
n ch

u
,
ng minh
599. By denition, ... 599. Theo d
.
inh ngha, ....
600. By the denition of ... 600. Theo d
.
inh ngha c
,
ua ....
601. By assumption, ... 601. Theo g
,
ai thi

t, ....
602. By the compactness of ... 602. Theo tnh ch
.
at che c
,
ua ....
603. By Taylors formula, .... 603. Theo cng th u
,
c Taylor, ....
604. By a similar argument, ... 604. B
`
ang l
.
p lu
.
n tu
,
o
,
ng t
.
u
,
, ....
605. By the above, ... 605. Theo di
`
u
,
o
,
trn, ....
606. By the lemma below, ... 606. Theo b
,
d
`
du
,
o
,
i dy,....
607. By continuity, ... 607. Theo tnh lin t
.
uc, ....
608. But f = g, which follows from ... 608. Nhu
,
ng f = g, n o du
,
.
o
,
c suy ra t`u
,
.....
609. But f = g as was described
(shown/mentioned/ noted) in ...
609. Nhu
,
ng f = g nhu
,
d a du
,
.
o
,
c m t
,
a trong
.....
610. Theorem 4 now shows that ... 610. By gi`o
,
d
.
inh ly 4 ch
,
ra r
`
ang ....
611. Theorem 4 now yields (gives/ im-
plies) f = ....
611.
.
inh ly 4 cho ( du
,
a ra/keo theo) f =
....
612. Theorem 4 now leads to f = ... 612.
.
inh ly 4 d

n d

n f = ....
613. Since f is compact, Lf = 0. [Not:
"Since ...., then.... "]
613. V` f l` a compact, Lf = 0.
614. Since f is compact, we have Lf = 0. 614. V` f l` a compact, ta c o Lf = 0.
615. Since f is compact, it follows that
Lf = 0.
615. V` f l` a compact, ta suy ra r
`
ang Lf = 0.
616. Since f is compact, we see (conclude)
that Lf = 0.
616. V` f l` a compact, ta th

y r
`
ang Lf = 0.
617. But Lf = 0 since f is compact. 617. Nhu
,
ng Lf = 0 v` f l` a compact.
618. We have Lf = 0, because .... [+a
longer explanation]
618. Ta c o Lf = 0, b
,
o
,
i v` ....
619. We must have Lf = 0, for otherwise
we can replace ...
619. Ta ph
,
ai c o Lf = 0, tru
,
`o
,
ng h
.
o
,
p ngu
,
.
o
,
c
l
.
ai ta c o th
,
thay ...
620. As f is compact we have Lf = 0. 620. V` f l` a compact ta c o Lf = 0.
621. Therefore Lf = 0 by Theorem 6. 621. V` v
.
y Lf = 0 theo
.
inh ly 6.
622. That Lf = 0 follows from Theorem 6. 622. i
`
u Lf = 0 suy ra t`u
,

.
inh ly 6.
623. From this 623. T`u
,
di
`
u d o
624. From (5) 624. T`u
,
(5)
625. From what has already 625. T`u
,
nhu
,
ng g` d a c o
626. From been proved, 626. T`u
,
nhu
,
ng di
`
u d a ch u
,
ng minh
7.1 Proof Arguments - C ac l
.
p lu
.
n ch u
,
ng minh 37
627. we conclude (deduce/see) that ... 627. Ta k

t lu
.
n r
`
ang
628. we have (obtain) M = N. 628. Ta c o (nh
.
n du
,
.
o
,
c) M = N.
629. it follows that ... 629. Suy ra r
`
ang
630. it may be concluded that ... 630. C o th
,
k

t lu
.
n r
`
ang
631. According to (On account of) the
above remark, we have M = N.
631. Theo ch u y
,
o
,
trn, ta c o M = N.
632. It follows that M = N 632. Suy ra M = N.
633. Hence (Thus/Consequently,/Therefore)
M = N
633. Do d o M = N
634. [hence = from this; thus = in this
way; therefore = for this reason; it fol-
lows that = from the above it follows
that]
634. Do d o
635. This gives M = N. 635. i
`
u n` ay cho M = N.
636. We thus get M = N. 636. Nhu
,
v
.
y ta nh
.
n du
,
.
o
,
c M = N.
637. The result is M = N. 637. K

t qu
,
a l` a M = N.
638. (3) now becomes M = N. 638. (3) tr
,
o
,
th` anh M = N.
639. This clearly forces M = N. 639. i
`
u n` ay r o r` ang cho M = N.
640. F is compact, and so M = N 640. F l` a compact, v` a nhu
,
v
.
y M = N.
641. F is compact, and consequently M =
N.
641. F l` a compact, v` a d

n d

n M = N.
642. F is compact, and, in consequence,
M = N.
642. F l` a compact, v` a v o
,
i h
.
qu
,
a c
,
ua n o,
M = N.
643. F is compact, and hence bounded, 643. F l` a compact, v` a do d o b
.
i ch
.
an.
644. F is compact, which gives (implies/
yields) M = N. [Not: "what gives"]
644. F l` a compact, m` a n o keo theo M = N.
645. F = G = H the last equality being a
consequence of Theorem 7.
645. F = G = H d
,
ang th u
,
c cu

i c` ung l` a h
.

qu
,
a c
,
ua
.
inh ly 7.
646. F = G = H which is due to the fact
that ...
646. F = G = H m` a n o du
,
.
o
,
c suy ra t`u
,
y

u
t

l` a ....
647. Since ..., (2) shows that..., by (4). 647. T`u
,
..., (2) ch
,
ra r
`
ang ...., theo (4).
648. We conclude from (5) that ...., hence
that ...., and nally that...
648. Ta k

t lu
.
n t`u
,
(5) r
`
ang ..., do d o l` a ....,
v` a cu

i c` ung l` a ....
649. The equality f = g, which is part of
the conclusion of Theorem 7, implies
that ....
649.
,
ang th u
,
c f = g, m` a n o l` a m
.
t ph
`
n
c
,
ua k

t lu
.
n c
,
ua
.
inh ly 7, keo theo
....
650. As in the proof of Theorem8, equation
(4) gives ...
650. T`u
,
trong ch u
,
ng minh c
,
ua
.
inh ly 8,
phu
,
o
,
ng tr`nh (4) cho .....
651. Analysis similar to that in the proof of
Theorem 5 shows that .... [Not: "simi-
lar as in"]
651. Phn tch tu
,
o
,
ng t
.
u
,
di
`
u n` ay trong
ch u
,
ng minh d
.
inh ly 5 ch
,
ra r
`
ang ...
652. A passage to the limit similar to the
above implies that ....
652. u
,
`o
,
ng l

i di qua gi o
,
i h
.
an tu
,
o
,
ng t
.
u
,
nhu
,
trn keo theo r
`
ang ....
7.2 Proof Begin - B

at d
`
u ch u
,
ng minh 38
653. Similarly (Likewise), .... 653. Tu
,
o
,
ng t
.
u
,
(Gi

ng nhu
,
),....
654. Similar arguments apply to the case ... 654. Lya lu
.
n tu
,
o
,
ng t
.
u
,
ap d
.
ung cho tru
,
`o
,
ng
h
.
o
,
p n` ay ....
655. The same reasoning applies to the
case ...
655. C` ung m
.
t suy lu
.
n keo theo tru
,
`o
,
ng
h
.
o
,
p n` ay ....
656. The same conclusion can be drawn for
...
656. C` ung k

t lu
.
n c o th
,
ph at bi
,
u cho ....
657. This follows by the same method as in
...
657. i
`
u n` ay suy ra b
`
ang c` ung m
.
t
phu
,
o
,
ng ph ap nhu
,
trong ....
658. The term Tf can be handled in much
the same way, the only difference be-
ing in the analysis of ...
658. Th` anh ph
`
n Tf c o th
,
n

am du
,
.
o
,
c b
`
ang
c` ung c ach, ch
,
du
,
.
o
,
c kh ac nhau trong
phn tch c
,
ua ....
659. In the same manner we can see that ... 659. C` ung m
.
t ki
,
u ch ung ta c o th
,
th

y
r
`
ang ....
660. The rest of the proof runs as before. 660. Ph
`
n c` on l
.
ai c
,
ua ch u
,
ng minh th
.
u
,
c
hi
.
n nhu
,
tru
,
o
,
c dy.
661. We now apply this argument again,
with I replaced by J, to obtain ...
661. Ta ap d
.
ung ly lu
.
n n` ay m
.
t l
`
n nu
,
a,
v o
,
i I thay cho cho J, nh
.
n du
,
.
o
,
c ....
7.2. Proof Begin - B

at d
`
u ch

u
,
ng minh
662. We (Let us) rst prove
(show/recall/observe) that ....
662. Tru
,
o
,
c tin ch u
,
ng minh r
`
ang ...
663. We (Let us) rst prove a reduced form
of the theorem.
663. Tru
,
o
,
c tin ch u
,
ng minh m
.
t d
.
ang r ut
g
.
on c
,
ua d
.
inh ly.
664. We (Let us) rst outline (give the main
ideas of) the proof.
664.
`
u tin ta ph ac th
,
ao ch u
,
ng minh ....
665. We (Let us) rst examine Bf. 665. Tru
,
o
,
c tin ta xem xet Bf.
666. But A = B. To see (prove) this, let
f = ...
666. Nhu
,
ng A = B.
,
ch u
,
ng minh di
`
u
d o, cho f = ....
667. But A = B. We prove this as follows. 667. Nhu
,
ng A = B. Ta ch u
,
ng minh di
`
u d o
nhu
,
sau.
668. But A = B. This is proved by writing
g = ...
668. Nhu
,
ng A = B. i
`
u n` ay du
,
.
o
,
c ch u
,
ng
minh b
`
ang vi

t g = ....
669. We rst compute If. To this end, con-
sider ...
669. Tru
,
o
,
c tin ta tnh If.
,
k

t th uc di
`
u
d o, ta xet ....
670. We rst compute If. [=For this pur-
pose; not: "To this aim"]
670. Tru
,
o
,
c tin ta tnh If. [= cho m
.
uc dch
n` ay; khng d` ung "To this aim"]
671. We rst compute If. To do this, take
...
671. Tru
,
o
,
c tin ta tnh If.
,
l` am di
`
u d o,
ta l

y ...
672. We rst compute If. For this purpose,
we set ...
672. Tru
,
o
,
c tin ta tnh If. Cho m
.
uc dch
d o, ta d
.
at ....
673. To deduce (2) from (3), take ... 673.
,
gi
,
am (2) t`u
,
(3), h ay l

y ....
674. We claim that Indeed, .... 674. Ta x ac nh
.
n th
.
t s
.
u
,
d ung, ....
7.2 Proof Begin - B

at d
`
u ch u
,
ng minh 39
675. We begin by proving ... (by recalling
the notion of ...)
675. Ta b

at d
`
u b
`
ang ch u
,
ng minh ....
676. Our proof starts with the observation
that ...
676. Ch u
,
ng minh c
,
ua ch ung ta xu

t ph at
v o
,
i nh
.
t xet r
`
ang ....
677. The procedure is to nd ... 677. Th
,
u t
.
uc l` a t`m ....
678. The proof consists in the construction
of ...
678. Ch u
,
ng minh b
`
ang xy d
.
u
,
ng c
,
ua ....
679. The proof is straightforward (quite in-
volved).
679. Ch u
,
ng minh tr
.
u
,
c ti

p.
680. The proof is by induction on n. 680. Ch u
,
ng minh b
`
ang quy n
.
ap theo n
681. The proof is left to the reader. 681. Ch u
,
ng minh d
,
l
.
ai cho b
.
an d
.
oc.
682. The proof is based on the following
observation.
682. Ch u
,
ng minh d
.
u
,
a trn co
,
s
,
o
,
nh
.
n xet
sau dy.
683. The main (basic) idea of the proof is
to take ...
683. Tu
,
tu
,
,
o
,
ng co
,
b
,
an c
,
ua ch u
,
ng minh l` a l

y
....
684. The proof falls naturally into three
parts.
684. Ch u
,
ng minh du
,
.
o
,
c chia th` anh ba ph
`
n.
685. The proof will be divided into 3 steps. 685. Ch u
,
ng minh se chia l` am ba bu
,
o
,
c.
686. We have divided the proof into a se-
quence of lemmas,
686. Ta chia ch u
,
ng minh th` anh d ay c ac b
,
d
`
.
687. Suppose the assertion of the lemma is
false.
687. Gi
,
a s
,
u
,
kh
,
ang d
.
inh c
,
ua Lemma l` a sai.
688. Suppose , contrary to our claim, that
...
688. Gi
,
a s
,
u
,
ngu
,
.
o
,
c l
.
ai v o
,
i ph at bi
,
u c
,
ua
ch ung ta l` a ....
689. Conversely (To obtain a contradic-
tion), suppose that ...
689. Ngu
,
.
o
,
c l
.
ai, gi
,
a s
,
u
,
r
`
ang ....
690. On the contrary, suppose that ... 690. Ngu
,
.
o
,
c l
.
ai gi
,
a s
,
u
,
r
`
ang, ....
691. Suppose the lemma were false. Then
we could nd ...
691. Gi
,
a s
,
u
,
B
,
d
`
d a sai. Khi d o ta c o th
,
t`m ....
692. If there existed an x ..., we would have
... (there would be ...)
692. N

u t
`
n t
.
ai x ..., ta se c o ....
693. If x were not in B, we would have ...
(there would be ...)
693. N

u x khng thu
.
c B, ta se c o ....
694. If it were true that ... , we would have
... (there would be ...)
694. N

u di
`
u khng d ung l` a ...., ta se c o
....
695. Assume the formula holds for the de-
gree k; we will prove it for k + 1.
695. Gi
,
a s
,
u
,
cng th u
,
c d ung cho b
.
c k, ta se
ch u
,
ng minh d ung cho k + 1.
696. Assuming (3) to hold for k, we wrill
prove it for k + 1.
696. Gi
,
a thi

t (3) d ung cho k, ta se ch u

,
ng
minh d ung v o
,
i k + 1.
697. We give the proof only for the case
n = 3; the other cases are left to the
reader.
697. Ta ch
,
ch u
,
ng minh cho tru
,
`o
,
ng h
.
o
,
p n =
3; tru
,
`o
,
ng h
.
o
,
p kh ac d
,
l
.
ai cho b
.
an d
.
oc.
698. We only give the main ideas of the
proof.
698. Ta ch
,
du
,
a ra tu
,
tu
,
,
o
,
ng chnh c
,
ua
ch u
,
ng minh.
7.3 Proof Conclusion - K

t lu
.
n c
,
ua ch u
,
ng minh 40
7.3. Proof Conclusion - K

t lu
.
n c
,
ua ch

u
,
ng minh
699. ...., which (This) proves the theorem. 699. ...., di
`
u d o ch u
,
ng minh d
.
inh ly.
700. ...., which (This) completes the proof. 700. ...., di
`
u d o ch u
,
ng minh d
`
y d
,
u.
701. ...., which (This) establishes the for-
mula.
701. ...., di
`
u d o thi

t l
.
p ln cng th u
,
c.
702. ...., which (This) is the desired conclu-
sion.
702. ...., di
`
u d o r ut ra k

t lu
.
n.
703. ...., which (This) is our claim (asser-
tion). [Not: "thesis"]
703. ...., di
`
u d o l` a kh
,
ang d
.
inh c
,
ua ch ung
ta.
704. ...., which (This) gives (4) when sub-
stituted in (5) (combined with (5)).
704. ...., (i
`
u n` ay ) cho (4) khi thay th

v` ao (5) ( k

t h
.
o
,
p v o
,
i (5 ) ) .
705. ...., and the proof is complete. 705. ..., v` a ch u
,
ng minh d
`
y d
,
u.
706. ...., and this is precisely the assertion
of the lemma,
706. ..., v` a d o l` a chnh x ac kh
,
ang d
.
inh c
,
ua
b
,
d
`
.
707. ...., and the lemma follows. 707. ..., v` a b
,
d
`
suy ra.
708. ...., and (3) is proved. 708. ..., v` a (3) du
,
.
o
,
c ch u
,
ng minh.
709. ...., and f = g as claimed (required). 709. ..., v` a f = g nhu
,
d a nu (nhu
,
d
`
i h
,
oi).
710. This contradicts our assumption (the
fact that .... ).
710. i
`
u n` ay tr ai v o
,
i gi
,
a thi

t c
,
ua ch ung
ta.
711. ..., contrary to (3). 711. ..., tr ai v o
,
i (3).
712. ..., which is impossible. [Not: "what
is"]
712. ..., n o khng th
,
du
,
.
o
,
c.
713. ..., which contradicts the maximality
of ....
713. ..., n o tr ai v o
,
i tnh c
.
u
,
c d
.
ai c
,
ua ....
714. ..., a contradiction. 714. ..., v ly.
715. The proof for G is similar. 715. Ch u
,
ng minh c
,
ua G tu
,
o
,
ng t
.
u
,
.
716. G may be handled in much the same
way.
716. G c o th
,
th
.
u
,
c hi
.
n theo c` ung m
.
t
c ach.
717. Similar considerations apply to G. 717. Xem xet tu
,
o
,
ng t
.
u
,
ap d
.
ung cho G.
718. The same proof works (remains valid)
for ...
718. Ch u
,
ng minh nhu
,
v
.
y th
.
u
,
c hi
.
n cho ...
719. The same proof still goes (fails) when
we drop the assumption ...
719. Ch u
,
ng minh c` ung c ach v

n c` on d ung
khi m` a ta b
,
o gi
,
a thi

t ....
720. The method of proof carries over to
domains ....
720. Phu
,
o
,
ng ph ap ch u
,
ng minh d
.
u
,
a trn
mi
`
n x ac d
.
inh....
721. The proof above gives more, namely
/is ...
721. Ch u
,
ng minh trn cho ho
,
n th

, ta d
.
at
tn....
722. A slight change in the proof actually
shows that ...
722. Nh

n m
.
anh s
.
u
,
thay d
,
i ch u
,
ng minh
ch
,
ra r
`
ang ....
7.4 Proof Sufcient - Ch u
,
ng minh di
`
u ki
.
n d
,
u 41
7.4. Proof Sufcient - Ch

u
,
ng minh di
`
u ki
.
n d
,
u
723. It is clear (evi-
dent/immediate/obvious) that ....
723. R o r` ang ( hi
,
n nhin / ngay l
.
p t u
,
c /
r o r` ang ) ....
724. It is easily seen that .... 724. N o c o th
,
d

d` ang nh`n th

y r
`
ang ....
725. It is easy to check that .... 725. N o r

t d

d` ang d
,
ki
,
m tra xem ....
726. It is a simple matter to .... 726. N o l` a m
.
t v

n d
`
do
,
n gi
,
an d
,
....
727. We see (check) at once that .... 727. Ch ung ti nh`n th

y (ki
,
m tra) m
.
t
l
`
n m` a ....
728. F is easily seen (checked) to be
smooth.
728. F c o th
,
d

d` ang nh`n th

y ( ki
,
m tra)
du
,
.
o
,
c tro
,
n .
729. ...., which is clear from (3). 729. ...., o l` a r o r` ang t`u
,
(3) .
730. ...., as is easy to check. 730. ...., Nhu
,
l` a d

d` ang ki
,
m tra .
731. It follows easily (immediately) that .... 731. Sau m
.
t c ach d

d` ang ( ngay l
.
p t u
,
c)
m` a ....
732. Of course (Clearly/Obviously), .... 732. T

t nhin (Ghi r o / R o r` ang ), ....

733. The proof is straightforward (stan-
dard/immediate).
733. B
`
ang ch u
,
ng l` a do
,
n gi
,
an (tiu chu
,
n /
ngay l
.
p t u
,
c ) .
734. An easy computation (A trivial veri-
cation) shows that ...
734. M
.
t tnh to an d

d` ang (A x ac minh
t
`
m thu
,
`o
,
ng) ch
,
ra r
`
ang ...
735. (2) makes it obvious that [= By (2) it
is obvious that]
735. (2) l` am cho n o r o r` ang r
`
ang [= (2) r o
r` ang l` a ]
736. The factor Gf poses no problem be-
cause G is
736. C ac y

u t

Gf khng gy ra v

n d
`
v`
G
7.5. Proof Easily - Ch

u
,
ng minh di
`
u ki
.
n d
,
u
737. It sufces to show (prove) that ..... 737. N o d
,
u d
,
ch
,
ra ( ch u
,
ng minh ) m` a .....
738. It sufces to make the following ob-
servation.
738. N o c ung d
,
u d
,
l` am cho c ac nh
.
n xet
sau dy .
739. It sufces to use (4) together with the
observation that ....
739. N o d
,
u d
,
s
,
u
,
d
.
ung (4) c` ung v o
,
i vi
.
c
nh
.
n xet ....
740. It is sufcient to show (prove) that ..... 740. N o l` a d
,
u d
,
hi
,
n th
.
i ( ch u
,
ng minh )
m` a .....
741. It is sufcient to make the following
observation.
741. N o l` a d
,
u d
,
l` am cho c ac nh
.
n xet sau
.
742. It is sufcient to use (4) together with
the observation that ....
742. N o l` a d
,
u d
,
s
,
u
,
d
.
ung (4) c` ung v o
,
i vi
.
c
quan s at ....
743. We need only consider 3 cases: ... 743. Ch ung ta ch
,
c
`
n xem xet 3 tru
,
`o
,
ng h
.
o
,
p
: ...
744. We only need to show that .... 744. Ch ung ti ch
,
c
`
n d
,
ch u
,
ng minh r
`
ang
....
7.6 Proof Property - Ch u
,
ng minh tnh ch

t 42
745. It remains to prove that ... (to exclude
the case when )
745. N o v

n c` on d
,
ch u
,
ng minh r
`
ang ... (
d
,
lo
.
ai tr`u
,
c ac tru
,
`o
,
ng h
.
o
,
p khi )
746. What is left is to show that .... 746. Nhu
,
ng g` c` on l
.
ai l` a d
,
ch u
,
ng minh
r
`
ang ....
747. We are reduced to proving (4) for .... 747. Ch ung ti dang gi
,
am d
,
ch u
,
ng minh
(4) ....
748. We are left with the task of determin-
ing ....
748. Ch ung ti d a b
,
o qua v o
,
i nhi
.
m v
.
u x ac
d
.
inh ....
749. The only point remaining concerns
the behaviour of ....
749. i
,
m duy nh

t c` on l
.
ai lin quan d

n
h` anh vi c
,
ua ....
750. The proof is completed by showing
that ....
750. Ch u
,
ng minh du
,
.
o
,
c ho` an th` anh b
`
ang
c ach cho th

y r
`
ang ....
751. We shall have established the lemma
if we prove the following: ...
751. Ch ung ta se thi

t l
.
p b
,
d
`
n

u ch ung
ti ch u
,
ng minh nhu
,
ng di
`
u sau dy :
...
752. If we prove that..... , the assertion fol-
lows.
752. N

u ch ung ti ch u
,
ng minh r
`
ang ..... ,
Kh
,
ang d
.
inh sau.
753. The statement O(g) = l will be proved
once we prove the lemma below.
753. M
.
nh d
`
O(g) = l se du
,
.
o
,
c ch u
,
ng minh
khi ch ung ti ch u
,
ng minh B
,
d
`
du
,
o
,
i
dy .
7.6. Proof Property - Ch

u
,
ng minh tnh ch

t
754. the (an) element such that (with the
property that) ...
754. c ac ph
`
n t
,
u
,
(m
.
t ) nhu
,
v
.
y m` a (v o
,
i
c ac tnh ch

t m` a ) ...
755. the (an) element with the following
properties: ....
755. c ac ph
`
n t
,
u
,
(m
.
t ) v o
,
i c ac thu
.
c tnh
sau : ....
756. the (an) element satisfying Lf = ... 756. c ac ph
`
n t
,
u
,
( m
.
t ) d ap u
,
ng N

u = ...
757. the (an) element with Nf = 1 (with
coordinates x, y, z)
757. c ac ph
`
n t
,
u
,
(m
.
t ) v o
,
i Nf = 1 ( c o
t
.
oa d
.
x, y, z )
758. the (an) element of norm 1 (of the
form ...)
758. c ac ph
`
n t
,
u
,
d
.
inh m u
,
c 1 (m
.
t ) ( h`nh
th u
,
c ... )
759. the (an) element whose norm is ... 759. C ac ph
`
n t
,
u
,
m` a chu
,
n c
,
ua n o l` a...
760. the (an) element all of whose subsets
are ...
760. c ac ph
`
n t
,
u
,
(m
.
t ) t

t c
,
a c ac t
.
p con
c o ...
761. the (an) element by means of which g
can be computed
761. c ac ph
`
n t
,
u
,
(m
.
t ) phu
,
o
,
ng ti
.
n trong
d o g c o th
,
du
,
.
o
,
c tnh
762. the (an) element for which this is true 762. c ac ph
`
n t
,
u
,
(m
.
t ) m` a di
`
u n` ay l` a
d ung
763. the (an) element at which g has a local
maximum
763. c ac ph
`
n t
,
u
,
(m
.
t ) m` a t
.
ai d o g c o c
.
u
,
c
d
.
ai d
.
ia phu
,
o
,
ng
764. the (an) element described by the
equations ...
764. c ac ph
`
n t
,
u
,
(m
.
t ) du
,
.
o
,
c m t
,
a b
,
o
,
i c ac
phu
,
o
,
ng tr`nh ...
7.6 Proof Property - Ch u
,
ng minh tnh ch

t 43
765. the (an) element given by Lf = ... 765. c ac ph
`
n t
,
u
,
(m
.
t ) du
,
.
o
,
c du
,
a ra b
,
o
,
i
N

u = ...
766. the (an) element depending only on
... (independent of ...)
766. c ac ph
`
n t
,
u
,
(m
.
t ) ch
,
ph
.
u thu
.
c v` ao
... (khng ph
.
u thu
.
c ...)
767. the (an) element not in A 767. c ac ph
`
n t
,
u
,
(m
.
t ) khng c o trong A
768. the (an) element so small that (small
enough that) ...
768. c ac ph
`
n t
,
u
,
(m
.
t ) qu a nh
,
o m` a ( d
,
u
nh
,
o ) ...
769. the (an) element as above (as in the
previous theorem)
769. c ac ph
`
n t
,
u
,
(m
.
t ) nhu
,
trn (nhu
,
trong d
.
inh ly tru
,
o
,
c )
770. the (an) element so obtained 770. c ac ph
`
n t
,
u
,
(m
.
t ) d
,
thu du
,
.
o
,
c
771. the (an) element occurring in the cone
condition
771. c ac ph
`
n t
,
u
,
( m
.
t ) x
,
ay ra trong di
`
u
ki
.
n h`nh n on
772. the (an) element guaranteed by the
assumption ...
772. c ac ph
`
n t
,
u
,
(m
.
t ) du
,
.
o
,
c gi
,
a d
.
inh ...
773. the (an) element we have just dened 773. c ac ph
`
n t
,
u
,
(m
.
t ) ch ung ti d a d
.
inh
ngha
774. the (an) element we wish to study (we
used in Chapter 7)
774. c ac ph
`
n t
,
u
,
( m
.
t ), ch ung ti mu

n
nghin c u
,
u ( ch ung ti s
,
u
,
d
.
ung trong
Chu
,
o
,
ng 7 )
775. the (an) element to be dened later
[= which will be dened]
775. c ac ph
`
n t
,
u
,
( an) du
,
.
o
,
c x ac d
.
inh sau
n` ay [= se du
,
.
o
,
c d
.
inh ngha ]
776. the (an) element in question 776. c ac ph
`
n t
,
u
,
(m
.
t ) trong cu h
,
oi
777. the (an) element under study (consid-
eration)
777. c ac ph
`
n t
,
u
,
(m
.
t ) du
,
.
o
,
c nghin c u
,
u (
xem xet )
778. ..., the constant C being independent
of ... [= where C is ... ]
778. ..., H
`
ang s

C d
.
c l
.
p c
,
ua ... [= No
,
i C
... ]
779. ..., the supremum being taken over all
cubes ...
779. ..., Supremum dang du
,
.
o
,
c th
.
u
,
c hi
.
n
trn t

t c
,
a c ac h`nh kh

i ...
780. ..., the limit being taken in L. 780. ... , Gi o
,
i h
.
an du
,
.
o
,
c th
.
u
,
c hi
.
n trong L .
781. ..., where C is so chosen that ... 781. ... , C l` a l
.
u
,
a ch
.
on m` a ...
782. ..., where C is to be chosen later. 782. ... , C l` a du
,
.
o
,
c l
.
u
,
a ch
.
on sau n` ay .
783. ..., where C is a suitable constant. 783. ... , C l` a m
.
t h
`
ang s

ph` u h
.
o
,
p .
784. ..., where C is a conveniently chosen
element of ...
784. ... , C l` a m
.
t y

u t

thu
.
n ti
.
n du
,
.
o
,
c
l
.
u
,
a ch
.
on c
,
ua ...
785. ..., where C involves the derivatives of
...
785. ... , C lin quan d

n c ac d

n xu

t c
,
ua
...
786. ..., where C ranges over all subsets of
...
786. ... , C dao d
.
ng trn t

t c
,
a c ac t
.
p h
.
o
,
p
con c
,
ua ...
787. ..., where C may be made arbitrarily
small by ...
787. ... , C c o th
,
du
,
.
o
,
c th
.
u
,
c hi
.
n nh
,
o t` uy y
...
788. The operators A
i
have (share) many
of the properties of ...
788. To an t
,
u
,
A c o r

t nhi
`
u tnh ch

t c
,
ua
....
789. The operators A
i
have still better
smoothness properties.
789. To an t
,
u
,
A v

n c` on tnh ch

t tro
,
n.
7.6 Proof Property - Ch u
,
ng minh tnh ch

t 44
790. The operators A
i
lack (fail to have)
the smoothness properties of ...
790. To an t
,
u
,
A c o tnh ch

t tro
,
n ho
,
n.
791. The operators A
i
still have norm 1. 791. To an t
,
u
,
A v

n c o chu
,
n 1.
792. The operators A
i
are not merely sym-
metric but actually self-adjoint.
792. C ac to an t
,
u
,
A
i
khng ch
,
do
,
n thu
`
n l` a
d

i x u
,
ng nhu
,
ng th
.
u
,
c s
.
u
,
t
.
u
,
lin h
.
o
,
p .
793. The operators A
i
are not necessarily
monotone,
793. C ac to an t
,
u
,
A
i
khng nh

t thi

t ph
,
ai
do
,
n di
.
u ,
794. The operators A
i
are both symmetric
and positive-denite.
794. C ac to an t
,
u
,
A
i d

i x u
,
ng v` a tch c
.
u
,
c
x ac d
.
inh .
795. The operators A
i
are not continuou.
nor do they satisfy (2).
795. C ac to an t
,
u
,
A
i
khng continuou . c ung
khng l` am h
.
o th
,
oa m an (2).
796. The operators A
i
are neither symmet-
ric nor positive-denite,
796. C ac to an t
,
u
,
A
i
khng ph
,
ai l` a d

i x u
,
ng
v` a c ung khng tch c
.
u
,
c x ac d
.
inh ,
797. The operators A
i
are only nonnega-
tive rather than strictly positive, as
one may have expected.
797. C ac to an t
,
u
,
A
i
ch
,
khng m ho
,
n l` a
nghim ch
,
nh tch c
.
u
,
c , l` a m
.
t trong
nhu
,
ng c o th
,
mong d
.
o
,
i .
798. The operators A
i
are any self-adjoint
operators, possibly even unbounded.
798. C ac to an t
,
u
,
A
i
b

t k`y nh` a khai th ac t

.
u
,
lin h
.
o
,
p , th
.
m ch c o th
,
b
.
i ch
.
an .
799. The operators A
i
are still (no longer)
self-adjoint,
799. C ac to an t
,
u
,
A
i
v

n c` on (khng c` on )
t
.
u
,
lin h
.
o
,
p ,
800. The operators A
i
are not too far from
being self-adjoint.
800. To an t
,
u
,
A
i
khng ph
,
ai l` a qu a xa l` a t
.
u
,
lin h
.
o
,
p
801. The preceding theorem 801.
.
inh ly tru
,
o
,
c
802. The indicated set 802. C ac thi

t l
.
p ch
,
d
.
inh
803. The above-mentioned group 803. C ac nh om n oi trn
804. The resulting region 804. Khu v
.
u
,
c k

t qu
,
a
805. The required (desired) element 805. (Mong mu

n) yu c
`
u y

u t

806. Both X and Y are nite. 806. C

,
a hai Y X v` a l` a hu
,
u h
.
an.
807. Neither X nor Y is nite. 807. Khng X c ung khng Y l` a hu
,
u h
.
an.
808. X and Y are countable, but neither is
nite.
808. Y X v` a d

m du
,
.
o
,
c, nhu
,
ng khng ph
,
ai
l` a hu
,
u h
.
an .
809. Neither of them is nite. [Note: "Nei-
ther" refers to two alternatives.]
809. Khng m
.
t c ai n` ao t`u
,
ch ung l` a hu
,
u
h
.
an . [Ch u y: "Khng " d
`
c
.
p d

n hai
l
.
u
,
a ch
.
on thay th

. ]
810. None of the functions F, is nite. 810. Khng m
.
t h` am c
,
ua F l` a hu
,
u h
.
an.
811. X is not nite; nor (neither) is Y . 811. X khng ph
,
ai l` a hu
,
u h
.
an , c ung khng
( khng) l` a Y
812. X is not nite, nor is Y countable.
[Note the inversion.]
812. X khng ph
,
ai l` a hu
,
u h
.
an, c ung khng
ph
,
ai l` a Y d

m du
,
.
o
,
c
813. X is empty; so is Y . 813. X l` a r

ng, nhu
,
ng Y khng nhu
,
v
.
y
814. X is empty, but Y is not. 814. X l` a r

ng, nhu
,
ng Y khng
815. X belongs to Y ; so does Z. 815. X n
`
am trong Y , nhu
,
ng Z khng nhu
,
v
.
y
7.6 Proof Property - Ch u
,
ng minh tnh ch

t 45
816. X belongs to Y , but Z does not. 816. X n
`
am trong Y , nhu
,
ng Z khng
CH
,
U
`
8
Proof steps - C ac bu
,

o
,
c ch

u
,
ng minh
817. Consider ... 817. Xet ....
818. Choose ... 818. Ch
.
on ....
819. Fix ... 819. C

d
.
inh ....
820. Dene f = ... 820.
.
inh ngha f = ....
821. Let f = ... 821. Cho f = ....
822. Set f = ... 822.
.
at f = ....
823. Let us evaluate ... 823. H ay d
,
ch ung ti d anh gi a ....
824. Let us compute ... 824. H ay cho chugns ta tnh ....
825. Let us apply the formula to ... 825. H ay ap d
.
ung cng th u
,
c cho .....
826. Let us suppose for the moment ... 826. Ta gi
,
a s
,
u
,
th`o
,
i di
,
m n` ay ....
827. Let us regard s as xed and ... 827. Ta xem s nhu
,
c

d
.
inh v` a ....
828. Adding g to the left-hand side 828. Thm g v ao bn tr ai
829. Subtracting (3) from (5) 829. Tr`u
,
(3) t`u
,
(5)
830. Writing (Taking) h = Hf 830. Ta d
.
at h = Hf
831. Substituting (4) into (6) 831. Thay (4) v` ao (6)
832. Combining (3) with (6) 832. K

t h
.
o
,
p (3) v o
,
i (6)
833. Combining these [E.g. these inequali-
ties]
833. K

t h
.
o
,
p ch ung
834. Replacing (2) by (3) 834. Thay (2) b
`
ang (3)
835. Letting n 835. Cho n
836. Applying (5) 836.

Ap d
.
ung (5)
837. Interchanging f and g 837.
,
i ch

cho nhau f v` a g
838. yields (gives) h = ... 838. du
,
a ra h = ...
839. we obtain (get/have) f = g [Note:
without "that"]
839. Ta nh
.
n du
,
.
o
,
c f = g
840. we conclude (deduce/see) that ... 840. ch ung ti k

t lu
.
n ( suy ra / nh`n
th

y) ...
841. we can assert that ... 841. ch ung ta c o th
,
kh
,
ang d
.
inh r
`
ang ...
842. we can rewrite (5) as ... 842. ch ung ta c o th
,
vi

t l
.
ai (5) ...
843. We continue in this fashion obtaining
(to obtain) f = ...
843. Ch ung ti ti

p t
.
uc theo c ach n` ay c o
du
,
.
o
,
c ( d
,
thu du
,
.
o
,
c ) f = ...
844. We may now integrate times to con-
clude that ...
844. By gi`o
,
ch ung ta c o th
,
tch h
.
o
,
p th`o
,
i
gian d
,
k

t lu
.
n r
`
ang ...
845. Repeated application of Lemma 6 en-
ables us to write ....
845. L
.
ap di l
.
ap l
.
ai ap d
.
ung B
,
d
`
6 cho
phep ch ung ti vi

t ....
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 47
846. We now proceed by induction. 846. By gi`o
,
ch ung ta ti

n h` anh b
`
ang quy
n
.
ap.
847. We can now proceed analogously to
the proof of ....
847. By gi`o
,
ch ung ta c o th
,
ti

n h` anh
Tu
,
o
,
ng t
.
u
,
ch u
,
ng minh ....
848. We next claim (show/prove that) ... 848. Ch ung ti yu c
`
u ph at bi
,
u ( hi
,
n th
.
i
/ ch u
,
ng minh r
`
ang ) ...
849. We next sharpen these results and
prove that ...
849. Ti

p theo ch ung ta l` am s

ac net nhu
,
ng
k

t qu
,
a n` ay v` a ch u
,
ng minh r
`
ang ...
850. Our next claim is that ... 850. Tuyn b

ti

p theo c
,
ua ch ung ti l` a ...
851. Our next goal is to determine the
number of ...
851. M
.
uc tiu ti

p theo c
,
ua ch ung ti l` a x ac
d
.
inh s

lu
,
.
o
,
ng ...
852. Our next objective is to evaluate the
integral I.
852. M
.
uc tiu ti

p theo c
,
ua ch ung ti l` a
d anh gi a thi

u I .
853. Our next concern will be the be-
haviour of ...
853. Quan tm ti

p theo c
,
ua ch ung ti se
l` a h` anh vi c
,
ua ...
854. We now turn to the case f ,= 1. 854. By gi`o
,
ch ung ta chuy
,
n sang tru
,
`o
,
ng
h
.
o
,
p f ne1 .
855. We are now in a position to show .....
[=We are able to]
855. Ch ung ti hi
.
n dang
,
o
,
m
.
t v
.
i tr d
,
ch u
,
ng minh ..... [= Ch ung ti c o th
,
]
856. We proceed to show that ... 856. Ch ung ti ti

n h` anh d
,
ch u
,
ng minh
r
`
ang ...
857. The task is now to nd .... 857. Nhi
.
m v
.
u l` a by gi`o
,
d
,
t`m ....
858. Having disposed of this preliminary
step, we can now return to ...
858. Sau khi x
,
u
,
ly so
,
b
.
bu
,
o
,
c n` ay , ch ung
ta c o th
,
quay tr
,
o
,
l
.
ai ...
859. We wish to arrange that f be as
smooth as possible. [Note the inni-
tive.]
859. Ch ung ti mu

n s

ap x

p f du
,
.
o
,
c nhu
,
m
.
in nh

t c o th
,
. [Ch u y c ac nguyn
m

u . ]
860. We are thus looking for the family .... 860. Ch ung ti xem nhu
,
v
.
y, cho m
.
t h
.
o ....
861. We have to construct .... 861. Ta ph
,
ai xy d
.
u
,
ng ...
862. In order to get this inequality, it : 862.
,
c o du
,
.
o
,
c s
.
u
,
b

t b`nh d
,
ang n` ay , n o:
863. will be necessary to... 863. se l` a c
`
n thi

t d
,
...
864. is convenient to... 864. thu
.
n ti
.
n d
,
...
865. To deal with If, we note that ... 865.
,
d

i ph o v o
,
i If , ch ung ti lu
,
u y
r
`
ang ...
866. To estimate the other term, we note
that ...
866.
,
u
,
o
,
c tnh th`o
,
i h
.
an kh ac , ch ung ti
lu
,
u y r
`
ang ...
867. For the general case, we note that ... 867.

i v o
,
i tru
,
`o
,
ng h
.
o
,
p chung, ch ung ti
lu
,
u y r
`
ang ...
868. We are now in a position to prove the
following theorem.
868. By gi`o
,
ch ung ta d a s

an s` ang d
,
ch u
,
ng
minh d
.
inh ly sau dy.
869. We shall begin with showing that ... 869. Ta se b

at d
`
u b
`
ang vi
.
c ch
,
ra r
`
ang ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 48
870. We begin by establishing ... 870. Ta se b

at d
`
u b
`
ang vi
.
c thi

t l
.
p....
871. We rst observe that ... 871. Tru
,
o
,
c tin ta nh
.
n xet r
`
ang ...
872. We proceed now to establish the fun-
damental result ...
872. By gi`o
,
ta chuy
,
n sang thi

t l
.
p k

t
qu
,
a co
,
b
,
an ...
873. Evidently, Obviously, Clearly 873. D

th

y, Hi
,
n nhin, R o r` ang.
874. It is obvious that ... 874. Hi
,
n nhin l` a ...
875. It is plain that ... 875. R o r` ang l` a ...
876. It is clear that ... 876. R o r` ang l` a ...
877. It is easy to prove (show, see, check,
verify, ...) that ...
877. D

d` ang ch u
,
ng minh(ch
,
ra, nh
.
n
th

y, ki
,
m tra, th
,
u
,
l
.
ai) l` a ...
878. It is easily seen that ... 878. D

th

y r
`
ang ...
879. It is easily be seen that ... 879. C o th
,
d

th

y r
`
ang ....
880. As an immediate consequence of The-
orem 1 we have ...b
880. Nhu
,
m
.
t h
.
qu
,
a c
,
ua tr
.
u
,
c ti

p c
,
ua
.
inh
ly 1 ta c o ...
881. Lemmas 5 and 6 immediately give the
rst assertion of the Theorem.
881. C ac b
,
d
`
5 v` a 6 cho ngay di
`
u kh
,
ang
d
.
inh d
`
u tin c
,
ua
.
inh ly n` ay.
882. The Theorem now follows from apply-
ing Corollary 2.
882. By gi`o
,
d
.
inh ly du
,
.
o
,
c suy ra b
`
ang c ach
ap d
.
ung H
.
qu
,
a 2.
883. The rst part of this Proposition is es-
sentially Lemma 2 in [.].
883. Ph
`
n d
`
u c
,
ua m
.
nh d
`
n` ay th
.
u
,
c ch

t
l` a B
,
d
`
2 trong [.].
884. The second part of the Proposition is
obtained from ...
884. P
`
n th u
,
hai c
,
ua m
.
nh d
`
nh
.
n du
,
.
o
,
c
t`u
,
...
885. We invoke Theorem 8 to deduce that
...
885. Ta d
.
u
,
a v` ao
.
inh ly 8 d
,
suy ra r
`
ang ...
886. By virtue of Lemma 2.1 one can ... 886. Do B
,
d
`
2.1, ta c o th
,
...
887. In view of the lemma above, there is
...
887. Do B
,
d
`
trn, ta c o ...
888. Taking Lemma 3 into account we get
...
888. C u y B
,
d
`
3 ta nh
.
n du
,
.
o
,
c ...
889. Taking account of Lemma 3, we get ... 889. C u y B
,
d
`
3 ta nh
.
n du
,
.
o
,
c ...
890. It follows from Fubinis Theorem ap-
plied to indicator function that ...
890. T`u
,
d
.
inh ly Fubini ap d
.
ung cho h` am ch
,

d
.
inh suy ra r
`
ang ...
891. This Theorem can be proved by re-
peated application of Lemma 1.2.
891.
.
inh ly n` ay c o th
,
ch u
,
ng minh b
`
ang
c ach ap d
.
ung B
,
d
`
1.2 l
.
ap l
.
ai nhi
`
u
l
`
n.
892. We can now combine the results of
Theorem 5.1 with the method of ...
and obtain the following theorem.
892. By gi`o
,
ta c o th
,
k

t h
.
o
,
p c ac k

t qu
,
a
c
,
ua d
.
inh ly 5.1 v o
,
i phu
,
o
,
ng ph ap c
,
ua
... v` a thu du
,
.
o
,
c ...
893. Arguing as in ... we can ... 893. Ly lu
.
n nhu
,
trong ... ta c o th
,
....
894. It follows readily from ... that 894. T`u
,
... suy ra ngay r
`
ang ....
895. To do this we shall utilize the results
obtained in ...
895.
,
l` am vi
.
c d o ta se d` ung c ac k

t qu
,
a
nh
.
n du
,
.
o
,
c trong ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 49
896. That fact follows from (2) and the ob-
servation that t tends to 0.
896. i
`
u d o du
,
.
o
,
c suy ra t`u
,
(2) v` a t`u
,
nh
.
n
xet r
`
ang t ti

n t o
,
i 0.
897. Equality (6) follows from replacing
by in (3).
897.
,
ang th u
,
c (6) suy ra t`u
,
(3) b
`
an c ach
thay b
,
o
,
i .
898. This follows from (1) with alpha in
place of .
898. i
`
u d o suy ra t`u
,
(1) v o
,
i alpha thay
cho .
899. Substituting from (3) and (4) in (2)
yields ...
899. Vi
.
c thay (3) v` a (4) v` ao (2) cho ta ...
900. Combining (5), (6) and (7) gives
(yields) ...
900. K

t h
.
o
,
p (5), (6) v` a (7) ta c o ...
901. ... which together with (2.1) implies
that ...
901. ... di
`
u d o c` ung v o
,
i (2.1), cho phep
suy ra r
`
ang ....
902. we nowapply (1.3) with Aplaying the
role of ...
902. By gi`o
,
ap d
.
ung (1.3) v o
,
i A d ong vai
tr` o c
,
ua ...
903. Dening Q
i
in term of F
i
, as Q is de-
ned in term of F, one has ...
903.
.
inh ngha Q
1
theo F
i
, nhu
,
Q d a du
,
.
o
,
c
d
.
inh ngha theo F, ta c o ...
904. In exactly the same way, but replacing
Q by A and interchanging the role of
x, y, we have ...
904. B
`
ang chnh c ach

y, nhu
,
ng thay Q
b
`
ang A v` a d
,
i vai tr` o c
,
ua x, y ta c o
...
905. In the same way as in .... 905. C ung b
`
ang c ach nhu
,
trong ...
906. By an argument analogous (similar)
to the previous one. We get ...
906. B
`
ang l
.
p lu
.
n tu
,
o
,
ng t
.
u
,
(gi

ng) l
.
p
lu
.
n trn. Ta nh
.
n du
,
.
o
,
c...
907. By an argument analogous to that
used for the proof of Theorem 1 ...
907. B
`
ang l
.
p lu
.
n tu
,
o
,
ng t
.
u
,
nhu
,
l
.
p lu
.
n
d` ung d
,
ch u
,
ng minh
.
inh ly 1 ...
908. In the case ... the proof is analogous to
the one above.
908. Trong tru
,
`o
,
ng h
.
o
,
p ... c ach ch u
,
ng minh
tu
,
o
,
ng t
.
u
,
nhu
,
trn.
909. According to the method of ... 909. Theo phu
,
o
,
ng ph ap c
,
ua ...
910. The main tool for our proof will be the
following Lemma.
910. Cng c
.
u chnh c
,
ua ch ung ta trong
ch u
,
ng minh se l` a B
,
d
`
sau.
911. The main tool we shall use to derive
our results utilizes the following con-
cepts.
911. Cng c
.
u chnh m` a ch ung ta se d` ung
d
,
suy ra c ac k

t qu
,
a s
,
u
,
d
.
ung c ac kh ai
ni
.
m sau.
912. Assume the contrary, that ... 912. Gi
,
a s
,
u
,
ngu
,
.
o
,
c l
.
ai l` a ...
913. In the contrary case ... 913. Trong tru
,
`o
,
ng h
.
o
,
p ngu
,
.
o
,
c l
.
ai ...
914. Otherwise ... 914. Trong tru
,
`o
,
ng h
.
o
,
p ngu
,
.
o
,
c l
.
ai ...
915. Were this false, there would exist ... 915. N

u di
`
u d o sai, th` se t
`
n t
.
ai ...
916. If it were not so, then we should have
...
916. N

u khng nhu
,
th

th` ch ung ta se c o
...
917. If this were not so, there would be ... 917. N

u khng nhu
,
th

th` se c o ...
918. This contradicts the hypothesis. 918. i
`
u d o tr ai v o
,
i gi
,
a thi

t.
919. Which contradicts ... 919. i
`
u d o tr ai v o
,
i ...
920. Which contradicts with ... 920. (m` a) di
`
u d o mu thu

n v o
,
i ...
921. We thus arrive at a contradiction. 921. Nhu
,
th

ch ung ta di t o
,
i mu thu

n.
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 50
922. from which the contradiction ... would
arise
922. m` a t`u
,
d o mu thu

n ... se x
,
ay ra.
923. The assumption that ... now leads to
a contradiction by the same reasoning
used in the proof of (8).
923. Gi
,
a thi

t ... by gi`o
,
d

n t o
,
i mu thu

n
b
,
o
,
i chnh l
.
p lu
.
n d a d` ung trong
ch u
,
ng minh (8).
924. Since (7) is clearly violated (13) holds 924. V` r o r` ang (7) b
.
i vi ph
.
am, nn (13) l` a
d ung.
925. Since ..., one of the conditions (3),
(5), (7) and (9) must fail
925. V` ... nn m
.
t trong nhu
,
ng di
`
u ki
.
n
(3), (5), (7) v` a (9) ph
,
ai khng d ung.
926. But this shows that ..., a contradiction. 926. Nhu
,
ng di
`
u d o ch
,
ra r
`
ang ... mu
thu

n.
927. Since
n
must satisfy (3) 927. V`
n
ph
,
ai th
,
oa m an (3).
928. Since is arbitrary chosen, we get ... 928. V` du
,
.
o
,
c ch
.
on t` uy y nn ta c o ...
929. This is incompatible with A being dis-
joint from D
929. i
`
u d o mu thu

n v o
,
i vi
.
c A khng
c o di
,
m chung v o
,
i D.
930. That (2) =(1) is trivial, so ... 930. i
`
u (2) =(1) l` a t
`
m thu
,
`o
,
ng, v
.
y ...
931. Consequently, Therefore, Hence 931. Cho nn, T`u
,
d o, Do d o.
932. Since ..., it follows that ... 932. V` ... nn suy ra r
`
ang ...
933. Observe, further, that ... 933. Sau nu
,
a, ta nh
.
n xet r
`
ang ...
934. We prove rst the necessity of the con-
dition.
934. Tru
,
o
,
c h

t ta ch u
,
ng minh tnh c
`
n c
,
ua
di
`
u ki
.
n.
935. We now turn to the proof of suf-
ciency.
935. By gi`o
,
ta quay sang ch u
,
ng minh tnh
d
,
u.
936. The "if" part ... 936. Ph
`
n "n

u" ...
937. The "only if" part ... 937. Ph
`
n "ch
,
n

u" ...
938. Conditions (1) through (5) .... 938. C ac di
`
u ki
.
n t`u
,
(1) d

n (5) ...
939. Assuming the condition (1) fullled,
we shall show that ...
939. Gi
,
a s
,
u
,
di
`
u ki
.
n (1) du
,
.
o
,
c th
,
oa m an,
ta se ch
,
ra r
`
ang ...
940. Now, by the above ... 940. By gi`o
,
, qua nhu
,
ng di
`
u ki
.
n trn ...
941. ... as shown above. 941. ... nhu
,
d a du
,
.
o
,
c ch u
,
ng minh
,
o
,
trn.
942. It has already been shown that... 942.
,
O
,
trn d a ch
,
ra l` a ...
943. We have thus proved that ... 943. Nhu
,
th

ch ung ta d a ch u
,
ng minh du
,
.
o
,
c
l` a
944. We have remarked before on the fact
that ...
944. Ta d a nh
.
n xet
,
o
,
trn v
`
s
.
u
,
vi
.
c l` a ...
945. Using the results just obtained we ... 945. S
,
u
,
d
.
ung c ac k

t qu
,
a v`u
,
a thu du
,
.
o
,
c, ta
...
946. By the results just mentioned. 946. Qua c ac k

t qu
,
a v`u
,
a k
,
t o
,
i.
947. With this fact in hand, we can prove
the following proposition.
947. C o s

an s
.
u
,
ki
.
n d o, ta c o th
,
ch u
,
ng
minh m
.
nh d
`
sau dy.
948. The result above shows ..., the next
theorem in addition shows that ...
948. K

t qu
,
a
,
o
,
trn cho th

y ..., c` on d
.
inh ly
ti

p sau dy se ch
,
thm l` a ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 51
949. The next observation shows that ... 949. Nh
.
n xet ti

p theo cho th

y r
`
ang ...
950. By translating if necessary we may as-
sume that x = 0.
950. B
`
ang t
.
inh ti

n n

u c
`
n c o th
,
gi
,
a thi

t
r
`
ang x = 0.
951. In view of the preceding remark, we
can limit attention to methods ...
951. Do nh
.
n xet trn, ta ch
,
c
`
n gi o
,
i h
.
an
s
.
u
,
quan tm t o
,
i c ac phu
,
o
,
ng ph ap ...
952. We shall conne our attention to the
case, where ...
952. Ta se h
.
an ch

s
.
u
,
ch u y v` ao tru
,
`o
,
ng h
.
o
,
p
m` a ...
953. It sufces to treat the case where ... 953. Ch
,
c
`
n xet tru
,
`o
,
ng h
.
o
,
p m` a.
954. Then, by taking a subsequence, if nec-
essary, we can assume that ....
954. Khi

y, b
`
ang c ach l

y d ay con n

u c
`
n,
ta c o th
,
gi
,
a thi

t.
955. By passing to an appropriate subse-
quence and renumbering if necessary,
let us assume that the sequence is con-
vergent.
955. B
`
ang c ach chuy
,
n qua d ay con thch
h
.
o
,
p v` a d anh s

l
.
ai n

u c
`
n, ta h ay gi
,
a
s
,
u
,
l` a d ay h
.
i t
.
u.
956. Proceeding to a subsequence, if neces-
sary, we may assume that ...
956. Chuy
,
n qua d ay con, n

u c
`
n ta c o th
,
gi
,
a thi

t r
`
ang ...
957. Dropping to a subsequence, if neces-
sary, (9) shows that ...
957. R ut l
.
ai m
.
t d ay con, n

u c o (9) ch
,
ra
r
`
ang ...
958. Along a subsequence n

we have
M
n
2 ...
958. Su

t thay d ay con n

ta c o M
n
2.
959. Taking ( to be the class of all se-
quences of form (1) we obtain ...
959. L

y ( l` a l o
,
p t

t c
,
a c ac d ay d
.
ang (1) ta
nh
.
n du
,
.
o
,
c ...
960. We pick so large that ... 960. Ta l

y ra d
,
u l o
,
n sao cho ...
961. Given any 0, we can choose 961. Cho tru
,
o
,
c 0, ta c o th
,
ch
.
on ....
962. For the validity of Lemma 1 it is
enough to suppose merely that 1.
962. B
,
d
`
1 c o hi
.
u l
.
u
,
c, ch
,
c
`
n gi
,
a thi

t
l` a 1.
963. Without loss of generality we may as-
sume that ...
963. Khng m

t tnh t
,
ng qu at ta c o th
,
gi
,
a
thi

t r
`
ang ...
964. We shall omit the easy proof of the fol-
lowing properties of ...
964. Ta se b
,
o qua ch u
,
ng minh d

d` ang c ac
tnh ch

t sau dy c
,
ua ...
965. For the nal assertion of the proposi-
tion, observe that ...
965.

i v o
,
i di
`
u kh
,
ang d
.
inh cu

i c` ung c
,
ua
m
.
nh d
`
, h ay lu
,
u y r
`
ang ...
966. The problem is now reduced to prov-
ing that ...
966. L uc n` ay v

n d
`
r ut l
.
ai ch
,
c` on ch u
,
ng
minh r
`
ang ...
967. To complete the proof it remains to
show that ...
967.
,
ho` an th` anh vi
.
c ch u
,
ng minh ch
,

c` on ph
,
ai ch
,
ra r
`
ang ...
968. There remains the question of suitable
choice of ...
968. C` on l
.
ai v

n d
`
l` a ch
.
on thch h
.
o
,
p ...
969. To this end, we remark ... 969. Nh
`
am m
.
uc dch d o, ta ch u y ...
970. It is worth noticing that ... 970. ang ghi nh
.
n l` a ...
971. It holds that [f(y)[ 971. Ta c o [f(y)[ .
972. We attempt to show that ... 972. Ta se g

ang ch
,
ra r
`
ang ...
973. We infer that ... 973. Ta k

t lu
.
n r
`
ang ...
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 52
974. We then have the desired properties. 974. Khi

y ta c o nhu
,
ng tnh ch

t mong
mu

n.
975. Since is nite, the proposition fol-
lows.
975. V` l` a hu
,
u h
.
an, m
.
nh d
`
d a du
,
.
o
,
c
ch u
,
ng minh.
976. This completes (concludes) the proof. 976. i
`
u d o ho` an th` anh (k

t th uc) vi
.
c
ch u
,
ng minh.
977. The proof is complete. 977. Ch u
,
ng minh d a xong.
978. The proof is straight-forward. 978. Ch u
,
ng minh l` a t u
,
c kh

ac.
979. The proof parallels that of Theorem
10 and will be omitted.
979. Ch u
,
ng minh gi

ng nhu
,
d

i v o
,
i
.
inh ly
10 v` a se khng tr`nh b` ay
,
o
,
dy.
980. ... as was to be shown. 980. ... d o chnh l` a c ai c
`
n ch u
,
ng minh.
981. We use our results to derive an impor-
tant extension of Theorem [].
981. Ta s
,
u
,
d
.
ung k

t qu
,
a c
,
ua m`nh d
,
suy ra
m
.
t m
,
o
,
r
.
ng quan tr
.
ong c
,
ua
.
inh ly
[].
982. ... a result which we shall have oppor-
tunity to use later.
982. ... m
.
t k

t qu
,
a m` a ta se c o s
,
u
,
d
.
ung sau
n` ay.
983. The function f, besides being measur-
able, is summable.
983. H` am f khng nhu
,
ng do du
,
.
o
,
c c` on kh
,
a
t
,
ng.
984. The function L is dened to be con-
stant except for jumps at the points a
i
(i = 1, 2, ..., N).
984. H` am F du
,
.
o
,
c x ac d
.
inh l` a h` am const
tr`u
,
nhu
,
ng bu
,
o
,
c nh
,
ay c ac di
,
m a
i
(i =
1, 2, ..., N).
985. The function attains the lower bound
of its values on this set.
985. H` am

y d
.
at c
.
n du
,
o
,
i c
,
ua c ac gi a tr
.
i
c
,
ua n o trn t
.
p n` ay.
986. f may not be dened on all of X. 986. f c o th
,
khng x ac d
.
inh trn to` an b
.

X.
987. We now wish to remove these restric-
tions.
987. By gi`o
,
ta mu

n b
,
o di c ac h
.
an ch

d o.
988. The proof is by a standard compact-
ness argument
988. Ch u
,
ng minh b
`
ang l
.
p lu
.
n quen thu
.
c
d
.
u
,
a trn tnh compact.
989. If, as is usually the case, A is invertible,
then ....
989. N

u nhu
,
thu
,
`o
,
ng hay x
,
ay ra A kh
,
a
ngh
.
ich, th` ...
990. Observe, in passing, that K
1
and K
2
lie in opposite half-spaces determined
by H.
990. Nhn dy ta nh
.
n xet r
`
ang K
1
v` a K
2
n
`
am trong c ac n
,
u
,
a khng gian d

i
nhau x ac d
.
inh b
,
o
,
i.
991. The proof is by induction on the di-
mension of the subspace.
991. Ch u
,
ng minh b
`
ang quy n
.
ap theo th u
,
nguyn c
,
ua khng gian.
992. As the next step, we claim that ... 992. Bu
,
o
,
c ti

p theo, ta kh
,
ang d
.
inh r
`
ang ...
993. We contend that ... 993. Ta kh
,
ang d
.
inh r
`
ang ...
994. We now set out to prove this assertion,
along the way we shall establish a few
other equivalent properties.
994. By gi`o
,
ta b

at d
`
u ch u
,
ng minh di
`
u
kh
,
ang d
.
inh d o, d
.
oc du
,
`o
,
ng ta se thi

t
l
.
p m
.
t s

tnh ch

t tu
,
o
,
ng du
,
o
,
ng
kh ac.
CH
,
U
`
9
References - T` ai li
.
u tra c

u
,
u
995. (see for instance [7, Th. 1]) 995. (xem v d
.
u ch
,
ang h
.
an [7, Th. 1])
996. (see [7] and the references given
there)
996. (xem [7] v` a tra c u
,
u du
,
a ra
,
o
,
dy)
997. (see [Ka2] for more details) 997. (xem [Ka2] v o
,
i chi ti

t ho
,
n)
998. (see [Ka2] for the denition of ... ) 998. (xem [Ka2] cho d
.
inh ngha c
,
ua ....)
999. (see [Ka2] for the complete bibliogra-
phy)
999. (xem [Ka2] cho t` ai li
.
u tham kh
,
ao d
`
y
d
,
u)
1000. The best general reference here is ... 1000. T` ai li
.
u tra c u
,
u t
,
ng quan nh

t
,
o
,
dy
l` a ....
1001. The standard work on ... is ... 1001. Cng vi
.
c chu
,
n trn .... l` a .....
1002. The classical work here 1002. Cng vi
.
c c
,
di
,
n
,
o
,
dy
1003. This was proved by Lax [8]. 1003. i
`
u n` ay d a ch u
,
ng minh b
,
o
,
i Lax[8].
1004. This can be found in Lax [7, Ch. 2]. 1004. i
`
u n` ay c o th
,
t`m trong Lax [7,
Ch.2].
1005. This construction is due to Strang [8]. 1005. C ach xy d
.
u
,
ng n` ay suy ra t`u
,
Strang[8].
1006. This construction goes back to the
work of ... (as far as [8]).
1006. C ach xy d
.
u
,
ng n` ay tr
,
o
,
l
.
ai cng tr`nh
c
,
ua ......
1007. This construction was motivated by
[7].
1007. C ach xy d
.
u
,
ng n` ay d a du
,
.
o
,
c th uc d
,
y
b
,
o
,
i [7].
1008. This construction generalizes that of
[7].
1008. C ach xy d
.
u
,
ng n` ay m
,
o
,
r
.
ng k

t qu
,
a
c
,
ua [7].
1009. This construction follows [7]. 1009. C ach xy d
.
u
,
ng n` ay suy ra [7].
1010. This construction is adapted from [7]
(appears in [71).
1010. C ach xy d
.
u
,
ng n` ay du
,
.
o
,
c c
.
p nh
.
t t`u
,
[7].
1011. This construction has previously been
used by Lax [7].
1011. C ach xy d
.
u
,
ng n` ay d a du
,
.
o
,
c d` ung do
Lax[7].
1012. For a recent account of the theory we
refer the reader to [7]
1012.

i v o
,
i m
.
t k

t qu
,
a g
`
n dy c
,
ua ly
thuy

t n` ay , ch ung ti m`o
,
i d
.
c gi
,
a xem
[7 ]
1013. For a treatment of a more general case
we refer the reader to [7]
1013.

i v o
,
i th
.
u
,
c hi
.
n m
.
t tru
,
`o
,
ng h
.
o
,
p t
,
ng
qu at ho
,
n , ch ung ti m`o
,
i d
.
c gi
,
a xem
[7 ]
1014. For a fuller (thorough) treatment we
refer the reader to [7]
1014.

i v o
,
i m
.
t k

t qu
,
a d
`
y d
,
u ho
,
n ( ky
lu
,
o
,
ng) , ch ung ti m`o
,
i d
.
c gi
,
a xem [7
]
1015. For a deeper discussion of .... we refer
the reader to [7]
1015.

i v o
,
i m
.
t cu
.
c th
,
ao lu
.
n su s

ac
ho
,
n v
`
.... ch ung ti m`o
,
i d
.
c gi
,
a xem
[7 ]
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 54
1016. For direct constructions along more
classical lines we refer the reader to
[7]
1016.

i v o
,
i c ac cng tr`nh tr
.
u
,
c ti

p c` ung
nhi
`
u d` ong c
,
di
,
n , ch ung ti m`o
,
i
d
.
c gi
,
a xem [7 ]
1017. For yet another method we refer the
reader to [7]
1017.

i v o
,
i phu
,
o
,
ng ph ap kh ac , ch ung ti
m`o
,
i d
.
c gi
,
a xem [7 ]
1018. We introduce the notion of...., follow-
ing Kato [7].
1018. Ch ung ti gi o
,
i thi
.
u c ac kh ai ni
.
m ....
, theo Kato [7] .
1019. We follow [Ka] in assuming that ..... 1019. Ch ung ti theo [ Ka ] trong gi
,
a d
.
inh
r
`
ang .....
1020. The main results of this paper were
announced in [7].
1020. C ac k

t qu
,
a chnh c
,
ua nghin c u
,
u n` ay
d a du
,
.
o
,
c cng b

trong [7] .
1021. Similar results have been obtained in-
dependently by Lax and are to be pub-
lished in [7].
1021. K

t qu
,
a tu
,
o
,
ng t
.
u
,
d a du
,
.
o
,
c d
.
c l
.
p b
,
o
,
i
Lax v` a se du
,
.
o
,
c cng b

trong [7] .
1022. The author proves the interesting re-
sult that
1022. T ac gi
,
a ch u
,
ng minh k

t qu
,
a th u v
.
i
1023. The proof is short and simple, and the
article well written.
1023. B
`
ang ch u
,
ng l` a ng

an v` a do
,
n gi
,
an , v` a
b` ai vi

t c ung b
`
ang
1024. The results presented are original. 1024. C ac k

t qu
,
a tr`nh b` ay ban d
`
u.
1025. The paper is a good piece of work on
a subject that attracts considerable at-
tention.
1025. B` ai vi

t n` ay l` a m
.
t m
,
anh t

t cng vi
.
c
v
`
m
.
t ch
,
u d
`
thu h ut s
.
u
,
ch u y d ang
k
,
.
1026. I am pleased to recommend it for pub-
lication in Studia Mathematica.
1026. Ti h` ai l` ong d
,
gi o
,
i thi
.
u n o cho cng
b

trong Studia Mathematica .

1027. It is a pleasure to recommend it for
publication in Studia Mathematica.
1027. o l` a m
.
t ni
`
m vui d
,
gi o
,
i thi
.
u n o
cho cng b

trong Studia Mathemat-

ica .
1028. I strongly recommend it for publica-
tion in Studia Mathematica.
1028. Ti d
`
ngh
.
i cng b

trong Studia
Mathematica .
1029. The only remark I wish to make is
that condition B should be formulated
more carefully.
1029. Nh
.
n xet duy nh

t I mu

n th
.
u
,
c hi
.
n
l` a di
`
u ki
.
n B c
`
n du
,
.
o
,
c xy d
.
u
,
ng c
,
n
th
.
n ho
,
n .
1030. A few minor typographical errors are
listed below.
1030. M
.
t v` ai l

i nh
,
o d anh m ay du
,
.
o
,
c li
.
t k
du
,
o
,
i dy.
1031. I have indicated various corrections
on the manuscript.
1031. Ti d a ch
,
ra di
`
u ch
,
nh kh ac nhau
trn b
,
an th
,
ao .
1032. The results obtained are not particu-
larly surprising and will be of limited
interest.
1032. C ac k

t qu
,
a thu du
,
.
o
,
c khng ph
,
ai l` a
d
.
ac bi
.
t d ang ng
.
ac nhin v` a se du
,
.
o
,
c
quan tm h
.
an ch

.
1033. The results are correct but only mod-
erately interesting.
1033. K

t qu
,
a l` a chnh x ac nhu
,
ng ch
,
v`u
,
a th u
v
.
i .
1034. The results are rather easy modica-
tions of known facts.
1034. C ac k

t qu
,
a d a du
,
.
o
,
c s
,
u
,
a d
,
i kh a d

d` ang c ac s
.
u
,
ki
.
n du
,
.
o
,
c bi

t d

n .
Nguy

n H u
,
u i
,
n - Thu
.
t ng u
,
To an h
.
oc - huudien@vnu.edu.vn 55
1035. The example is worthwhile but not of
sufcient interest for a research arti-
cle.
1035. V d
.
u l` a d ang gi a nhu
,
ng khng quan
tm d
`
y d
,
u cho m
.
t b` ai vi

t nghin
c u
,
u .
1036. The English of the paper needs a thor-
ough revision.
1036. Anh ngu
,
c
,
ua b` ai b ao c
`
n m
.
t phin
b
,
an ky lu
,
o
,
ng .
1037. The paper does not meet the stan-
dards of your journal.
1037. Gi

y khng d ap u
,
ng c ac tiu chu
,
n
c
,
ua t
.
ap ch c
,
ua b
.
an .
1038. Theorem 2 is false as stated. 1038.
.
inh ly 2 l` a sai nhu
,
d a nu .
1039. Theorem 2 is false in this generality. 1039.
.
inh ly 2 l` a sai chung chung n` ay .
1040. Lemma 2 is known (see .... ) 1040. B
,
d
`
2 du
,
.
o
,
c bi

t d

n (xem ....)
1041. Accordingly, I recommend that the pa-
per be rejected.
1041. Theo d o, ti d
`
ngh
.
i b
.
i t`u
,
ch

i gi

y .
CH
,
U
`
10
M
.
t s

quy t

ac

d
.
oc k y hi
.
u
10.1. C ac k y hi
.
u cng th

u
,
c chung
1042. + 1042. plus
1043. 1043. minus
1044. 1044. plus or minus
1045. 1045. multiplication sign (sign of multiplication)
1046. : 1046. division sign (sign of division)
1047. ( ) 1047. round brackets (parentheses)
1048. [ ] 1048. square brackets (brackets)
1049. { } 1049. curly brackets (braces)
1050. 1050. equivalent, similar
1051. 1051. congruent to ..., ...is isomorphic to ...
1052. = 1052. alpha equals beta, alpha is equal to beta
1053. ,= 1053. alpha is not beta, alpha is not equal to beta
1054. 1054. alpha approximately equals beta
1055. 1055. alpha plus or minus beta
1056. > 1056. alpha is greater than beta
1057. 1057. alpha is substantially greater than beta
1058. < 1058. alpha is less than beta
1059. 1059. alpha is substantially less than beta
1060.
2
>
n
1060. alpha second is greater than alpha n-th
1061. x 1061. x lends to innity
1062. x = 1062. x approaches innity
1063. n! 1063. n factorial
1064.

1064. alpha prime

1065.

1065. alpha double prime, alpha second prime

1066.

1066. alpha triple prime

1067. 1067. alpha vector, the mean value of alpha
1068. x 1068. the rst derivative
1069. x 1069. the second derivative
1070.
...
x 1070. the third derivative
1071.
1
1071. alpha rst, alpha sub one, alpha sufx one
1072.
n
1072. alpha n-th, alpha sub n, alpha sufx n
1073. f

c
1073. f prime sub c, f prime sufx c, f sufx c prime
10.1 C ac ky hi
.
u cng th u
,
c chung 57
1074.

2
1074. alpha second double prime, alpha double prime second
1075. 90

1075. ninely degree

1076. 6

1076. six minute

1077. 10

1077. ten seconds (ten inches)

1078. + = 1078. alpha plus beta is gamma, alpha plus beta equals gamma,
alpha plus beta is equal to gamma, alpha plus beta makes
gamma
1079. ( +)
2
1079. alpha plus beta all squared
1080. = 1080. alpha minus beta is gamma; alpha minus beta leaves
gamma
1081. (2x y) 1081. bracket two x minus y close the brackets
1082. 2 2 = 4 1082. twice two in four
1083. 5 5 = 25 1083. ve times ve is twenty ve, ve multiplied by ve equals
twenty ve.
1084. S = v

t 1084. S is equal to v multiplied by t; S equals v times t.

1085. =

1085. alpha is equal to the ratio of beta to gamma.

1086.

= 1086. beta divided by gamma is alpha; beta by gamma equals

alpha.
1087.

2

= 1087. alpha beta square (divided) by beta equals alpha beta.

1088.

= 0 1088. alpha by innity is equal to zero.

1089.

= 0 1089. alpha by innity is equal to zero.

1090.
x

x
2
y
2
y
1090. x plus or minus square root of x square minus y square all
over y.
1091.

=
a
b
1091. the ratio of alpha to beta equals the ratio of a to b; alpha
to beta is as a to b.
1092.
1
2
1092. a half (a one half)
1093.
1
3
1093. a third (a one third)
1094.
1
4
1094. a forth; a squarter
1095.
3
4
1095. three fourths; three squarters
1096. 2
1
2
1096. two and a half
1097. 0.5 1097. o [ou] point ve; zero point ve; nought point ve.
1098. 0.002 1098. o [ou] point o [ou] o [ou] two; zero point zero zero two.
1099. .002 1099. point two noughts two.
1100. 0.0000001 1100. o [ou] point six noughts one.
1101. 1.12 1101. one point one two.
1102. 15.505 1102. fteen point ve o [ou] ve
10.1 C ac ky hi
.
u cng th u
,
c chung 58
1103. x
2
1103. x square; x squared; the square of x; the second power of
x; x to the second power; x raised to the second power.
1104. x
3
1104. x cube; x cubed; x raised to the third power.
1105. x
n
1105. x to the n-th power; ...
1106. x
n
1106. x to the minus n-th power.
1107.

1107. the square root of alpha.
1108.
3

= 1108. the cube root of alpha is beta.

1109.
5

2
1109. the fth root of alpha square.
1110. =

R
2
+X
2
1110. alpha equals to the square root of (capital) R square plus
x square.
1111.

1
+A
2xb

1111. the square root of alpha rst plus capital A divided to xb

double prime.
1112.
df
dx
1112. df over dx; the rst derivative of f with respect to x.
1113.
d
2
f
dx
2
1113. the second derivative of f with respect to x d two f over d
x square.
1114.
d
n
f
dx
n
1114. the n-th derivative of f with respect to x.
1115.

2
f
x
2
+

2
f
y
2
= 0 1115. partial d two f over partial d x square plus partial d two f
over partial d y square equals zero.
1116. y = f(x) 1116. y is a function of x.
1117.

1117. the intergral from alpha to beta; integral between limits

alpha and beta.
1118.
d
dx

x
x0
Fdx 1118. d over dx of the integral from x
0
to x of capital F dx.
1119. E =
P1

1119. capital E is equal to the ratio of the product P1 to the

product alpha beta.
1120. m
n
=
n

m
1120. alpha to the m by n-th power equals the n-th root of alpha
to the m-th power.
1121.

dx

c
2
y
2
1121. the integral of dx divided by the square root of c square
minus y square.
1122.
+

=
c +d
c d
1122. alpha plus beta over alpha minus beta is equal to c plus d
over c minus d.
1123. V =
u

sin
2
cos
2

1123. V equals u square root of sin square alpha minus cosine

square alpha.
1124. tan =
tan
l
1124. tangent alpha equals tangent beta divided by l.
1125.
3
= log
c
d 1125. alpha cubed is equal to the logarithm of d to the base c.
1126. [(x +a)
p

x]
q
1126. x+a in round brackets to the power p minus the r-th root
of x all (in square brackets) to the minus q-th power.
1127. (Dr
1
)[(Dr
2
)y] 1127. open round brackets capital D minus r rst close the round
brackets open square and round brackets capital D minus
r second close the round bracket by y close the square
brackets.
10.2 Ky hi
.
u chuyn ng` anh 59
1128. f
v
=
m
2

2
[rp
2
m
2
+R
2
(R
1
+

2

2
rp
)]
1128. f sub v is equal to m omega square alpha square divided by
square brackets, r, p square m square plus capital R second
round brackets opened capital R rst plus omega square
alpha square divided by rp round and square brackets
closed.
1129. [f
j
(t
1
) f
j
(t
2
)[ 1129. the absolute value of the quantity f sub j of t one minus f
sub j of t two
1130. max
j=1,n

n
i=1
a
ij
(t) 1130. maximum over j of the sum from i equals one to i equaqls
n of the modulus of a
ij
of (t), where j runs from one to n.
10.2. K y hi
.
u chuyn ng` anh
10.2.1. Logic
1131. xF(x) 1131. for all x F(x) holds
1132. xF(x) 1132. there exists an x such that F(x) holds.
1133. A B 1133. A and B (Conjunction)
1134. A B 1134. A or B (Disjunction)
1135. A 1135. not A (negation)
1136. A =B 1136. A implies B (Implication)
1137. A B 1137. A and B are logically equivalent (Equivalence)
10.2.2. Set
1138. x X 1138. element x is a member of the set X (element x belongs to
the set X)
1139. A B 1139. A is a subset of B
1140. A , B 1140. A is a proper subset of B
1141. 1141. Empty set
1142. A B 1142. Union of sets A and B
1143. A B 1143. Intersection of sets A and B
1144. A
c
1144. Complement of the set A
1145. A/R 1145. Set of equivalence classes of A with respect to an equiva-
lence relation R
1146. AB 1146. Cartesian product of A and B
1147.

1147. Cartesian product of the A sub lambda

1148. x[p(x) 1148. Set of all element x with the property p(x)
1149. A

1149. Family with index set Lambda

1150. f : X Y 1150. mapping f from X to Y
1151. f[
A
1151. restriction of a mapping f to A
1152. g f 1152. Composite of mapping f and g
1153. limsup A
n
1153. Supperior limit of the sequence of sets A sub n
10.2 Ky hi
.
u chuyn ng` anh 60
1154. liminf A
n
1154. Inferior limit of the sequence of sets A sub n
1155. lim

1155. Inductive limit of A sub lambda

1156. lim

1156. Projective limit of A sub lambda

10.2.3. Order
1157. (a, b) 1157. open interval
1158. [a, b] 1158. closed interval
1159. (a, b], [a, b) 1159. half-open- interval
1160. max A 1160. Maximum of A
1161. min A 1161. Minimum of A
1162. sup A 1162. Supremum of A
1163. inf A 1163. inmum of A
10.2.4. Algebra
1164. a b (mod n) 1164. a and b are congruent modulo n
1165. a[b 1165. a dividies b
1166. det A 1166. Determinant of a square matrix A
1167. trA 1167. Trace of a square matrix A
1168. A
T
1168. Transpose of a matrix A
1169. I
n
1169. Unit matrix of degree n
1170. AB 1170. Kronecker product of two matrix A and B
1171. M

= N 1171. Two algebraic systems M and N are isomorphic
1172. M/N 1172. Quotiont space of an algebraic system M by N
1173. dimM 1173. Dimension of a linear space M
1174. f 1174. Image of a mapping f
1175. ker f 1175. Kernel of a mapping f
1176. Coim f 1176. Coimage of a mapping f
1177. Coker f 1177. Cokernel of a mapping f
1178. ( a,

b) 1178. inner product of two vectors a and

b
1179. M N 1179. tensor product of two modules M and N
1180. hom(M, N) 1180. Set of all homomorphisms from M to N
1181.
M
1181. Exterior algebra of a linear space M
10.2.5. Topology
1182. a
n
a 1182. sequence a sub n converges to a
1183. a
n
a(a
n
a) 1183. sequence a sub n converges monotically decreasingly (in-
creasingly) to a
1184. lima
n
1184. limit of a sequence a sub n
10.2 Ky hi
.
u chuyn ng` anh 61
1185. limsup a
n
1185. superior limit of a sequence a sub n
1186. liminf a
n
1186. inferior limit of a sequence a sub n
1187.

E, clE 1187. Closure of a set E
1188. E

, int E 1188. Interior of a act E

1189. d(x, y) 1189. distance between two point x and y
1190. C 1190. Boundary of C
1191. [[x[[ 1191. Norm of x
10.2.6. Function
1192. grad 1192. gradient of a function varphi
1193.

1193. Laplacian of a function varphi

1194.
D(u
1
, u
2
, ..., u
n
)
D(x
1
, x
2
, ..., x
n
)
1194. Jacobian determinat of (u
1
, u
2
, ..., u
n
) with respect to
(x
1
, x
2
, ..., x
n
)
1195. [z[ 1195. absolute value of z
1196. Re z 1196. real part of a complex number z
1197. Im z 1197. Imaginary part of a complex number z
1198. arg z 1198. Argument of a complex number z
1199. T(T) 1199. Domain of an operator T
1200. !(T) 1200. Range of an operator T
1201. Supp T 1201. Support of a function f
10.2.7. Probability
1202. P(E) 1202. Probability of an event E
1203. E(X) 1203. Mean (expectation) of a random variable X
1204. V (X)
2
(X) 1204. Variance of a random variable X
1205. (X, Y ) 1205. Correlation coefcient of two random variables X and Y
1206. E(X[Y ) 1206. Conditional expectation of random variable X under the
condition Y
CH
,
U
`
11
M
.
t s

quy t

ac ng

u
,
ph ap
11.1. Ch u y m
.
ao t
`
u
,
x ac d
.
inh
1.
.
ai t` u
,
ngha l` a "mentioned earlier", "that":
Let A X. If B = 0 for every B intersecting the set A, then ...
Dene exp x =
i!

x
i
. The series can easily be shown to converge.
2. u
,
ng tru
,
o
,
c m
.
t danh t` u
,
(ho
.
ac d
.
ai t` u
,
) ch
,
m
.
t d

i tu
,
.
o
,
ng duy nh

t d a x ac d
.
inh (ho
.
ac
trong d
.
inh ngha):
Let f be the linear form f (g, F).
Let f be the linear form denned by (2). [If there is only one.]
u = 1 in the compact set K of all points at distance 1 from L.
We denote by B(X) the Banach space of all linear operators in X.
...., under the usual boundary conditions.
...., with the natural denitions of addition and multiplication.
Using the standard inner product we may identify ....
3. Trong c

u tr uc: the + tnh ch

t (ho
.
ac d
.
ac tnh kh ac ) +of + d

i tu
,
.
o
,
ng:
The continuity of f follows from....
The existence of test functions is not evident.
There is a xed compact set containing the supports of all the f
j
.
Then x is the centre of an open ball U.
The intersection of a decreasing family of such sets is convex.
Ngo
.
ai l
.
: Every nonempty open set in R
k
is a union of disjoint boxes.
4. u
,
ng tru
,
o
,
c s

lu
,
.
o
,
ng n

u n o bao g
`
m t

t c
,
a d

i tu
,
.
o
,
ng ta xet:
The two groups have been shown to have the same number of generators.
hu
,
ng: Two groups only were mentioned.]
Each of the three products on the right of D) satises ....
hu
,
ng: There are exactly 3 products there.]
5. u
,
ng tru
,
o
,
c m
.
t s

th u
,
t
.
u
,
:
The rst Poisson integral in (4) converges to g.
11.2 Ch u y m
.
ao t` u
,
khng x ac d
.
inh 63
The second statement follows immediately from the rst.
6. u
,
ng tru
,
o
,
c tn d` ung nhu
,
m
.
t thu
.
c tnh:
the Dirichlet problem
the Taylor expansion
the Gauss theorem
Nhu
,
ng : Taylors formula [thi

u "the"]
a Banach space
7. u
,
ng tru
,
o
,
c m
.
t danh t` u
,
s

nhi
`
u n

u ta mu

n ch
,
m
.
t l o
,
p c ac d

i tu
,
.
o
,
ng nhu
,
to` an th
,
,
ch u
,
khng m
.
t ph
`
n t
,
u
,
d

i tu
,
.
o
,
ng:
The real measures form a subclass of the complex ones.
This class includes the Helson sets.
11.2. Ch u y m
.
ao t
`
u
,
khng x ac d
.
inh
1. Thay cho s

m
.
t "one":
The four centres lie in a plane.
A chapter will be devoted to the study of expanding maps.
For this, we introduce an auxiliary variable z.
2. C o ngha l` a th` anh vin c
,
ua m
.
t l o
,
p c ac d

i tu
,
.
o
,
ng nhu
,
"some", "one of":
Then D becomes a locally convex space with dual space D

.
The right-hand side of (4) is then a bounded function.
This is easily seen to be an equivalence relation.
Theorem 7 has been extended to a class of boundary value problems.
The transitivity is a consequence of the fact that ....
Let us now state a corollary of Lebesgues theorem for .....
After a change of variable in the integral we get .....
We thus obtain the estimate with a constant C.
trong s

nhi
`
u th` khng:
The existence of partitions of unity may be proved by ....
The denition of distributions implies that ....
11.2 Ch u y m
.
ao t` u
,
khng x ac d
.
inh 64
...., with suitable constants.
...., where G and F are differential operators.
3. Trong c ac d
.
inh ngha nh u
,
ng l o
,
p d

i tu
,
.
o
,
ng (ngha l` a khi t
`
n t
.
ai r

t nhi
`
u d

i tu
,
.
o
,
ng v o
,
i
tnh ch

t d a cho):
A fundamental solution is a function satisfying ....
We call C a module of ellipticity.
A classical example of a constant C such that ....
We wish to nd a solution of (6) which is of the form ....
4. trong s

nhi
`
u th` thi:
The elements of D are often called test functions.
the set of points with distance 1 from K
the set of all functions with compact support
The integral may be approximated by sums of the form ...
Taking in (4) functions v which vanish in U we obtain ...
Let f and g be functions such that ....
5. Trong s

nhi
`
u khi ta tham chi

u t o
,
i m

i ph
`
n t
,
u
,
c
,
ua l o
,
p:
Direct sums exist in the category of abelian groups.
In particular, closed sets are Borel sets.
Borel measurable functions are often called Borel mappings.
This makes it possible to apply H
2
-results to functions in any H
p
.
N

u ta ch
,
t o
,
i t

t c
,
a ph
`
n t
,
u
,
c
,
ua l o
,
p th` d` ung "the":
The real measures form a subclass of the complex ones.
6. Tru
,
o
,
c m
.
t tnh t` u
,
m` a n o hu
,
o
,
ng theo ngha "c o d
.
inh lu
,
.
o
,
ng th
.
u
,
c t

n` ay":
This map extends to all of M in an obvious fashion.
A remarkable feature of the solution should be stressed.
Section 1 gives a condensed exposition of ....
Section 1 describes in a unied manner the recent results ....
A simple computation gives ...
Combining (2) and (3) we obtain, with a new constant C, ...
11.3 Ch u y b
,
o qua m
.
ao t` u
,
65
A more general theory must be sought to account for these irregularities.
The equation (3) has a unique solution g for every f.
But: (3) has the unique solution g = ABf.
11.3. Ch u y b
,
o qua m
.
ao t
`
u
,
1. Tru
,
o
,
c m
.
t danh t` u
,
ch
,
t o
,
i dang hi
.
n h` anh:
Application of Denition 5.9 gives (45).
Repeated application (use) of (4.8) shows that....
The last formula can be derived by direct consideration of....
A is the smallest possible extension in which differentiation is always possible.
Using integrationby parts we obtain
If we apply induction to (4), we get
Addition of (3) and (4) gives
This reduces the solution to division by Px.
Comparison of (5) and (6) shows that
2. Tru
,
o
,
c c ac danh t` u
,
ch
,
t o
,
i tnh ch

t n

u ta khng k
,
ra d

i tu
,
.
o
,
ng th
.
u
,
c t

:
In question of uniqueness one usually has to consider ....
By continuity, (2) also holds when f = 1.
By duality we easily obtain the following theorem.
Here we do not require translation invariance.
3. Sau m
.
t bi
,
u th u
,
c b

t k`y v o
,
i "of":
a type of convergence
a problem of uniqueness
the condition of ellipticity
the hypothesis of positivity
the method of proof
the point of increase
4. Tru
,
o
,
c c ac d

i tu
,
.
o
,
ng d anh s

:
It follows from Theorem 7 that ....
Section 4 gives a concise presentation of ....
Property (iii) is called the triangle inequality.
This has been proved in part (a) of the proof.
11.3 Ch u y b
,
o qua m
.
ao t` u
,
66
Nhu
,
ng:
the set of solutions of the form (4.7)
To prove the estimate (5.3) we rst extend ....
We thus obtain the inequality (3). [Or: inequality (3)]
The asymptotic formula (3.6) follows from ....
Since the region (2.9) is in U, we have ....
5.
,
tr anh l
.
ap l
.
ai t` u
,
ti

p sau:
the order and symbol of a distribution
the associativity and commutativity of A
the direct sum and direct product
the inner and outer factors of f [Note the plural.]
Nhu
,
ng:
a decit or an excess
6. Tru
,
o
,
c c o tn s
,
o
,
h u
,
u:
Minkowskis inequality, but: the Minkowski inequality
Fefferman and Steins famous theorem,
more usual: the famous Fefferman-Stein theorem
6. Trong m
.
t s

m
.
nh d
`
m t
,
a m
.
t danh t` u
,
, d
.
ac bi
.
t sau "with" v` a "of":
an algebra with unit e; an operator with domain H
2
; a solution with vanishing
Cauchy data; a cube with sides parallel to the axes; a domain with smooth boundary;
an equation with constant coefcients; a function with compact support; random
variables with zero expectation
the equation of motion; the velocity of propagation;
an element of nite order; a solution of polynomial growth;
a ball of radius 1; a function of norm p
But: elements of the form f = ...
Let B be a Banach space with a weak symplectic form w.
Two random variables with a common distribution.
7. Sau cum t` u
,
"to have":
F has nite norm.
11.3 Ch u y b
,
o qua m
.
ao t` u
,
67
F has compact support.
Nhu
,
ng:
F has a nite norm not exceeding 1.
F has a compact support contained in I.