Академический Документы
Профессиональный Документы
Культура Документы
THEORY OF EQUABILITY
(1) POSTULATE – 1
Work done can be defined as the product of difference
of rest mass from moving mass of a body and the
difference of square of velocity of that moving body
from the square of velocity of light in vacuum (c=3*10 8
m/s).
Work done(w) = (m-m0)(c2-v2)
Where,
m=moving mass of a body
m0=rest mass of a body
v=velocity of that body
c=velocity of light in vacuum.
Proof: According to Einstein Special Theory of Relativity
the relativistic moving mass of a body is given by
m=m0/[1-(v2/c2)]1/2 --------------------------(1)
Differentiating both sides w.r.t to ‘t’
dm/dt = d(m0/[1-(v2/c2)]1/2)/dt
dm/dt = d(m0c/[c2-v2]1/2)/dt
dm/dt = {[c2-v2]1/2 d(m0c)/dt – m0c d([c2-
v2]1/2)/dt}/(c2-v2)
dm/dt = {0-m0c*(1/{2[c2-v2]1/2})(-2va)}/(c2-v2)
[since,m0,c are constants]
(c2-v2) dm/dt=(vacm0)/([c2-v2]1/2)
Also, [c2-v2]1/2 = (m0c)/m
(c2-v2) dm/dt = (m0cavm)/(m0c)
Multiplying both sides by dt we get
(c2-v2) dm = ma*vdt
Integrating both sides we get,
(c2-v2) dm=ma*v dt
(c2-v2)(m-m0)=mavt ----------------------------------------(2)
Now, we know f=ma and s(distance) = vt
(c2-v2) (m-m0) =f*s
We know, w=f*s
Hence,
w=(c2-v2) (m-m0)--------------------------------------------(3)
k=c2(m-m0)
(m-m0)=k/c2 --------------------------------------(5)
we know that,
relativistic work done (w)
=(m-m0)(c2-v2)
Putting the value of (m-m0) from equation (5) we
get
w=(k)*[1-(v2/c2)]
w=k[1-(v2/c2)]----------------------------------------(6)
(1.2) DEDUCING THE CLASSICAL EXPRESSION FOR
KINETIC ENERGY.
The formula for relativistic work done of a particle
of rest mass m0 is given by
w=(c2-v2) (m-m0)
But, m=m0/[1-(v2/c2)]1/2
Where,
m is the moving mass of the particle moving with
velocity v.
w=[m0(1-{v2/c2})-1/2-m0][c2-v2]
w=m0[(1-{v2/c2})-1/2-1][c2-v2] ----------------------(7)
Expanding (1-{v2/c2})-1/2 by binomial theorem we get,
(1-{v2/c2})-1/2 = 1 + (1/2)(v2/c2)+(3/8)(v4/c4)+……
For small velocities v<<c, the terms beyond (1/2)
(v2/c2) are negligible.
Then,
(1-{v2/c2})-1/2 1 + (1/2)(v2/c2)
Making this substitution in equation (7) we obtain,
w m0 [1 + (1/2)(v2/c2)-1] [c2-v2]
w (1/2)(m0v2) [(c2/c2)-(v2/c2)]
w (1/2)(m0v2)[1-( v2/c2)]
Comparing the above expression with the equation
(6) we get,
k (1/2)(m0v2)--------------------------------(8)
which is the classical expression for the kinetic
energy.
(1.3) DEDUCING WORK-ENERGY THEOREM FROM
EQUATION (6).
In relativity, the momentum p of a particle at any
velocity v can be defined in defined as
p=mv
But, m=m0/[1-(v2/c2)]1/2
Where,
m is the moving mass of the particle moving with
velocity v.
p= m0v/[1-(v2/c2)]1/2
now,
force(f) = dp/dt = d(m0v/[1-(v2/c2)]1/2)/dt -----(9)
the work done by force F in a displacement ds of the
body is equal to the change in the Kinetic Energy k of the
body,
dk=Fds
putting the value of F from equation (9) we
get,
dk= {d(m0v/[1-(v2/c2)]1/2)/dt}ds
(c2-v2)dk=[(m0c*c2)/[c2-v2]1/2]*(dv/dt)*ds
But, (c2-v2)1/2=(m0c)/m
(c2-v2)dk = [(m0c*c2m)/m0c]*(ds/dt)*dv
(c2-v2)dk = mc2*vdv
Integrating both sides we get,
(c2-v2) ∫dk=mc2 vdv
(c2-v2)k=mc2[(v2-u2)/2]
[(c2-v2)k]/c2 = (1/2)m[v2-u2]---------------(10)
Since, the particle starts from rest so u=0 and
w=(k)*[1-(v2/c2)]
w=(1/2)mv2---------------------------------------------(11)
(2) POSTULATE – 2
The Gravitational Force between two particles at
rest separated by a distance from each other is
equal to the Gravitational Force between that two
particles moving with equal and uniform velocity
keeping the distance same between them.
(Gm0m’0)/r2 = [(Gmm’)/r2] [1-(v2/c2)]
Where
m0=Rest mass of first particle.
m’0=Rest mass of second particle.
m=Moving mass of first particle.
m’=Moving mass of second particle.
r=Distance between the two particles.
G=Gravitational Constant.
v=Velocity of both the particles.
c=Velocity if light in vacuum.
Proof:- According to Newton’s Law Of Gravitation
F=(Gm0m’0)/r2----------------------------------(12)
Now,
m0=m[1-(v2/c2)]1/2
m’0=m’[1-(v2/c2)]1/2
putting the value of m0 and m’0 in equation (12)
we get,
F=[(Gmm’)/r2] {[1-(v2/c2)]1/2}2
F=[(Gmm’)/r2] [1-(v2/c2)]-----------------------(13)
Hence,
(Gm0m’0)/r2 = [(Gmm’)/r2] [1-(v2/c2)] [proved]
Equation (13) can also be said as the formula to find
relativistic Gravitational Forces.
For example:-
Two particles A and B has rest mass of 20 kg and 30
kg separated by a distance 10m. Suddenly, both of
them started to move with a velocity 2*108m/s.
Verify the theory of equability in this case.
m0 of A=20kg m’0 of B=30kg
r=10m
m of A=26.8 kg m’ of B=40.2kg
F=6G F’=5.9G=6G
Hence,
The theory of equability is Verified.
CHAPTER 2
MOTION: MECHANICS AND
THEORY OF SEPARATIONAL
FORCE
According to Newton’s first law of motion, if a
body is in a state of rest, it will remain in the
state of rest and if it is in the state of motion, it
will remain moving in the same direction with
the same speed unless an external force is
applied on it.
The above law deals with inertial reference
frame. But have we ever imagined that a body
which we call at rest does it actually at rest. The
apparent view is yes but if we imagine that the
molecules which is constituted inside the body is
at motion. Then how can a body is said to be at
rest? Suppose in an electric circuit, an observer
says that the circuit is at rest but if there is a flow
of electricity inside then, does the whole thing at
rest?
According to surrounding the body is at rest
but according to itself its outer visible surface is
at rest but its inner constituents molecules or sub-
atomic particles are in motion. Hence, the body is
in a state of partial rest-motion state.
A body is said to be in partial rest motion state
when the body is apparently viewed appears to be
at rest but its constituent molecules appear to be
at motion.
This partial rest-motion occurs in a body till the
body does not absolute zero temperature. As,
absolute zero temperature, the molecules stop
vibrating at their positions and the body is said to
be at total rest state(or normal rest state).
A body is said to be in total rest state when the
apparent view of the body and its constituent
molecules appears to be at rest. This state is
possible when the temperature is absolute zero.
A body undergoes total motion state when the
body along with its constituent molecules is
appeared to be in motion.
Imagine a clock with a second’s hand. If we ask
a observer that whether the second’s hand is
moving or not, the observer will say the second’s
hand is in motion and if he thoughts about my
concept then he will answer that the body
undergoes total motion state. But if we observe it
carefully then we can see the whole body of the
second’s hand is not in motion the part of body
which is fixed to clock that small part is in rest.
Here, the constituent molecules are in motion, the
second’s hand is in motion but the fixed point of
the second’s hand though it is a part of the
moving hand is not moving or is hot changing its
position. This type of motion in which outer
visible part is related is known as Surface rest-
motion state. See the below mentioned figure:-
CONCEPT OF UNIVERSE AS A SINGLE
BODY:-
Now, if we imagine Universe as a body and
planets, asteroids, and other heavenly bodies as
its constituent particles then two cases evolves:-
Case 1:- If universe only expands and it does not
move neither on its axis nor it revolves then it
undergoes a state of partial rest-motion state.
Case 2:- If Universe moves on its axis or it
revolves on its axis then it undergoes a state of
total motion state.
Now, if case 2, is true then another concept
comes into existence that is Universe has its own
Gravitational Pull. That is if the Universe rotates
on its axis then the galaxies and other heavenly
bodies would fly away from the universe. So,
there must be equal and opposite force acting on
the bodies. This force can be centripetal or
gravitational force or both but it’s value is very
small. That’s why does not cause any effect on
the bodies.
GRAVITATIONAL FORCE AND
COLLISION
Let there be two bodies of mass m1 and m2
separated from each other with a distance r.
n=∞-∞
n=0
RELATION BETWEEN GRAVITATIONAL
FORCE AND SEPARATIONAL FORCE:-
Gravitational force is the force that attracts
two bodies towards each other. But
separational force is the force that provides
a repulsion between two bodies.
According to Newton’s third law of motion,
to every action there is always an equal and
opposite reaction. Hence, Gravitational
force and Separational force is an action-
reaction pair.
Mathematical relation:-
Let gravitational force be f and separational
force be f’ .
According to Newton’s third law of motion,
F=f’
f’=f
f’=-Gm1m2/r2
... The formula for separational force is:-
F=-Gm1m2/r2
Negative sign denotes the force is opposite in
nature.
Qualitative analysis:-
Put two of mass m1 and m2 beside each other at a
distance r from each (where there is no friction
and no air resistance)
Now, due to gravitational force m1 and m2 should
come together but they does move towards each
other due to the Separational force is present in
between them.
Thus,
Separational force=-Gravitational Force
SEPARATIONAL FORCE AND
CONCLUSION :-
When bodies say m1 and m2 come towards
velocity v1 and v2 they collide with each other
and gets separated due to separational force.
But we know separational force and
gravitational force are equal and opposite but
after collision separational force get an extra
supporting which is the molecules exact.
In the above case, when m1 and m2 strikes
against each other they but after collision the
force obtained from the collision of m1 and m2
is passed through the molecules until the last
molecules provides an extra force.
p=nmv
f=dp/dt
putting the value of f in equation (i) we get,
f’=Gm1m2/r2+2[dp/dt]
multiplying both sides by dt
f’dt=Gm1m2/r2dt+2dp
integrating both sides
f’∫dt=Gm1m2r2∫dt+2∫dp
f’t=Gm1m2/r2*t+2p
f’t=Gm1m2/r2*t+2nmv---------------------------------------(ii)
Hence,
Impulse of separational force=Separational
force+2n momentum of 1 atom.
VERIFICATION OF EQUATION (II)
DIMENSIONALLY:-
Dimension of impulse of force= [MLT-1]
Gravitational force of impulse= [MLT-1]
Momentum of molecule= [MLT-1]
After, writing the dimension on the equation
(ii) we get
[MLT-1]= [MLT-1]+ [MLT-1]
According to principal of homogeneity,
[MLT-1]= [MLT-1]
Hence, verified.
APPLICATION OF SEPARATIONAL
FORCE:-
Some few applications of separational force
are:-
Due to the presence of separational
force the planets does not collide with
each other. Otherwise, as they both
attract each other, they would come
closer and closer and finally they would
collide with each other.
In General Theory of Relativity, it is
said that the gravitational force is
formed when a heavy mass is put on the
space-time it provides a depression as it
forms on fibre when a heavy mass is
put on it. But the lighter mass that is
moon does not fall towards other it is
because of Separational force is present
between them.
In our daily life when we put two
bodies beside each other they do not
collide each other due to the presence
of Separational force is present between
them.
In atoms thought there is force of
attraction between protons and
electrons but the electrons never fall
into nucleus due to the force of
separation.
CHAPTER 3
MASS CHANGES DURING
REFRACTION
REFRACTION:-
Refraction is the bending of light towards or
away from the light when light travels from
one optical medium to another optical
medium of different optical densities.
i=angle of incidence
r=angle of refraction
Moreover, during Refraction velocity and
wavelength of light also changes.
GENERAL & SPECIAL THEORY OF
RELATIVITY AND REFRACTION:-
According to General theory of Relativity,
light has its own gravitational pull. That’s
why it bends towards the Sun. Then a
substance which has its own gravitational
force should have a mass how small it can be.
According to Special theory of Relativity, a
body has two types of mass rest mass and a
mass during its motion. We all know that
mass increases with increase in velocity and
vice-versa. Then, the mass of light will also
change will travelling from one medium to
other of different optical densities.
Mathematically:-
Let the mass of light in medium1 be m1 and in
medium2 be m2.
Velocity of light in medium1 be v1 and
velocity of light in medium2 be v2.
The light passes from medium1 (rarer) to
medium2 (denser). Like the below figue:-
Change in velocity=∇v=v -v 1 2
∇p=p2-p1=m2v2-m1v1
Dividing v2 on both sides,
∇p/v2=m2v2/v2-m1v1/v2
∇p/v2=m2-m1*1n2 [ since, 1n2=v1/v2]
We know, ∇p=∇(mv)= ∇m*∇v
(∇m*∇v)/v2-m2=-m1*1n2
((m2-m1)(v1-v2)-m2v2))/v2=-m1*1n2
(m2v1-m2v2-m1v1+m1v2-m2v2)/m1v2=-1n2
(m2/m1)*1n2-(m2/m1)-1n2+1-(m2/m1)=-1n2
(m2/m1)*1n2-2*(m2/m1)=-1
(m2/m1)*(1n2-2)=-1
(1n2-2)=- (m2/m1)
-(m2/m1)=1n2-2
(m2/m1)=2-1n2
(m1/m2)=1/(2-1n2)
m2=m1/(2-1n2)
CONCLUSION:-
The above formula states that mass of light
changes during refraction. The change of
mass is also a cause for refraction. The
unknown mass of light either is second or first
medium can be found out by this. It also
agrees that mass changes with change in
velocity. Thus, the Special Theory of
Relativity is satisfied.
NOTE:-Mass of photon=1*10-18eV/c2 in
vacuum
CHAPTER 4
WAVE COLLISION AND
LAWS OF COLLISION
(1)Introduction
Earlier, we have only known about matter collision and
real life visible collision and had also learnt how to deal
with them. But in the below topic we will learn about
matter wave collision.
1. INTRODUCTION
It seems to be generally recognized to-day that the
boundary layers developing at the sea bottom
under gravity
waves for all practical purposes can be regarded
as turbulent,
see for instance [6] and [14]. For many years it has
been extensively discussed, however, whether
turbulence could
appear in laboratory studies of wave phenomena,
see [6] and
the long discussions in La Houille Blanche, [2], [4],
[29]
and [30], The experiments by Miche [29], [30],
Vincent [36],
Lhermitte [23], Zhukovets [37] and Collins [6]
demonstrate,
on the other hand, that turbulent oscillatory
boundary layers
can be generated under laboratory conditions also.
The importance of a sound estimate of the wave
friction
factor for shallow water wave forecasting is
obvious.
In this context reference can be made to the
pioneer works
by Bagnold [1] and Johnson and Putnam [13].
Since measurements
in a prototype scale are scarce, and difficult to
perform,
however, it is imperative to know to what extent
model
127
128 COASTAL ENGINEERING
results in this field are applicable in nature, and
vice
versa. This calls for a detailed analysis of the
behaviour
of the wave boundary layer.
As long as the flow is entirely laminar, the
problem
is open for an analytical treatment. This is not the
case
for turbulent flow. Ho consistent theory dealing
with turbulent
oscillatory boundary layers exists. In this paper an
approach by Lundgren, adjusted according to the
experimental
results of the present author, has been adopted for
the rough
turbulent case, see [14] and [15]. The experimental
results
of Bagnold a. o. will be shown to agree quite well
with the
proposed friction factors. Measurements of
turbulent flow
near a smooth wall seem to be missing entirely, so
an analogy
with rough flow has been introduced.
A preliminary report is given in [17]. The more
complex
problem of bottom friction and energy dissipation
in a
wave motion when superimposed by a current has
been studied
in [18].
NOTATION
D (m)
De (m)
Ew (kgf/m s)
H (m)
L (m)
RE (dim.less)
Ee (dim.less)
T (s)
U (m/s)
U1 (m/s)
uc (m/s)
Uf (m/s)
a1 (m)
c (m/s)
d (m)
fe (dim.less)
fw (dim.less)
h (m)
k (m)
P (m)
2.
Water depth
"Equivalent depth"
Specific energy loss per s
Wave height
Wave length
Amplitude Reynolds number
Reynolds number
Wave period
Wave particle velocity
U at the bottom
Current velocity
Friction velocity
Wave particle amplitude at bottom
Wave celerity
Diameter of cylindrical roughness
(Kalkanis)
Wave energy loss factor
Friction factor for %v
Ripple height (Bagnold)
Nikuradse roughness parameter
Ripple pitch (crest to crest)
(Bagnold)
Eq.No.
(3.1)
(3.3)
(3.2)
(3.6) & (5.2)
(3.10)
(3.10)
(5.2)
(3.9)
(3.4)
(3.10)
t (B)
u (m/s)
w (m/s)
X (m)
z (a)
6 (m)
vise (m)
V (m2/s)
Q (kgf s2/
T (kgf/m2)
TW (kgf/m2)
^0 (°)
U) (1/s)
COASTAL ENGINEERING
sible: The side-wall correction for the zone around
MWL is
underestimated by standard methods. The flow
regime is not
fully laminar (see Fig. 3). Due to (invisible)
contamination,
a boundary layer is present at the surface, see van
Dorn [35].
MEASUREMENT OP FORGE
Direct measurement - Eagleson [7], and Iwagaki et
al.
[12] have measured directly the force exerted on a
smooth
plate by progressive shallow water waves.
Measurement of the slope of mean water level -
Using
the concept of the wave thrust, introduced by
Lundgren [28],
it was shown in [8] and [18] how the wave energy
loss factor
can be found by measuring the slope of the mean
water level.
The method is based upon elimination of dH/dx
from the energy
equation mentioned above, and the equilibrium
condition,
stating that the reduction in wave thrust between
two stations
equals the difference in pressure force from the
rise
of the mean water level over the same distance.
(The wave
thrust is identical to the "radiation stress"
obtained independently
of lundgren by Longuet-Higgins and Stewart, [25]
and [26]).
MEASUREMENT OF VELOCITY
The velocity field can be measured either over an
oscillating plate, Kalkanis [20] and [21], or in an
oscillating
fluid, Jonsson [14].
Equation of motion - A knowledge of the complete
velocity
field makes possible a determination of the bed
shear
stress through integration of the equation of
motion, see
[H].
The law of the wall - Very near the wall, the
turbulent
velocity, relative to the wall, will be logarithmic.
Thus, the friction velocity and from that the
friction factor
can be calculated, see [14].
Velocity measurement at a fixed level - This
method
is analogous to the Preston tube technique, see
Jonsson [16].
If the drag cofficient corresponding to a fixed level
near
the bed is found in a steady flow experiment, the
maximum
shear stress can be found directly from measuring
the maximum
velocity at this fixed level.
5. CHARACTERISTICS OF THE WAVE
BOUNDARY LAYER
DIMENSIONAL CONSIDERATIONS
For a given "form" of the outer (potential) velocity
(here sinusoidal), dimonsional analysis yields
directly the
following relationships for the wave boundary
layer thickness
and the wave friction factor:
WAVE BOUNDARY LAYERS 133
6/a1m fw
laminar case f(U1ma1n/v) f(ulma1m/v)
Rough turbulent case f(a-|m/k) f(a-jjj/k)
Smooth turbulent case f (Uima-|„/v) f (U1ma-|jj/v)
"f" denoting "function of". Quantitative
expressions will
be given in the following,
EQUATION OF MOTION
The linearized equation of motion in the boundary
layer reads (for a fixed bed)
with U-j given by (3.6), u and w being the velocity
fluctuations
in the x- and z-directions, respectively. U-|m is
given by ^ &
U1m = ¥ siph
1 &TD (= -TJ5) (5'2)
A solution to (5.1) in the case of turbulent flow has
not been found yet,* It is known, however, that a
logarithmic
velocity distribution is found in the vicinity of the
boundary, see [14], The shear stress gradient at
the boundary
is found from (5.1):
5T SU1
** z=o = " Q **" (5'3)
It is interesting to note, that this gradient is
determined
exclusively by the outer (potential) flow.
LAMINAR CASE
The solution to (5.1) with u~w = 0 reads ([ 22] p.
622):
U = U1m [sin out - exp (- \ f) sin (ait - \ §)] (5.4)
with
6 =yj.y7~f (5.5)
From (3.3) and (5.5) we find
6 = TT
a1m J2~W
where the important "amplitude Reynolds
number" RE formally
makes its first appearance. It can be interpreted as
a measure
of the square of the ratio between amplitude and
theoretical
laminar boundary layer thickness. (Note that the
relationship
6 Re ,R „•>
im
»} See note after refs.
(5.6)
6. NUMERICAL EXAMPLES
COMPARISON BETWEEN PROTOTYPE AND
MODEL
Prototype - D = 12 m, H = 2.3 m, T = 8 s, k = 0.1 m
=> L = 76 m, a^ = 1.0 m, a1?/k =10, RE = 7.9* 105.
Pig.
4 shows that we are well within the rough
turbulent regime,
and Pig. 6 yields fw = 7.0 • 10~d.
8. REFERENCES
[1] Bagnold, R. A. (1946). Motion of Waves in
Shallow Water.
Interaction between Waves and Sand Bottoms.
Proc.Royal
Soe. (A), J87, 1-15.
[2] Biesel, F. and Carry, C. (1956). A propos de
l»amortissement
des houles dans le domaine de 1'eau peu profonde.
La Houille Blanche, JM, 843-853.
[3] Bretschneider, C. L, (1965). Generation of
Waves by
Wind. State of the Art. Hat. Eng. So. Co.,
Wash.,D.C.
[4] Carry, C. (1956). Calcul de 1'amortissement
d'une houle
dans un liquide visqueux en profondeur finie.
la Houille Blanche, JH, 75-79.
[5] Colebrook, C. F. (1939). Turbulent Flow in
Pipes, with
Particular Reference to the Transitive Region
between
the Smooth and Rough Pipe Laws. J. Inst. Civil
Engrs.,
133-156.
[6] Collins, J, I. (1963). Inception of Turbulence at
the
Bed under Periodic Gravity Waves. J. Geophys.
Res.,
.68, 6007-6014.
[7] Eagleson, P. S. (1962). Laminar Damping of
Oscillatory
Waves. Am. Soc. Civ. Engrs., 88, HY 3, 155-181.
[8] Eliasson, J., Jonsson, I. G., and Skougaard, C.
(1964).
A Hew Way of Measuring the Wave Friction
Factor in a
Wave Flume. Basic Res. - Prog. Rep. No. 5, 5-8.
Coastal Engrg. Lab., Tech. Univ. of Denmark.
[9] Inman, D. L. and Bowen, A. J. (1962). Flume
Experiments
on Sand Transport by Waves and Currents. Proc.
8th
Conf. Coastal Engrg., 137-150, Mexico City.
[10] Iwagaki, Y. and Kakinuma, T. (1963). On the
Bottom
Friction Factor of the Akita Coast, Coastal Engrg.
in
Japan, 6, 83-91.
[11] Iwagaki, Y. and Kakinuma, T. (1965). Some
Examples of
the Transformation of Ocean Wave Spectra in
Shallow
Water. Bull. Disaster Prevention Res. Inst., Kyoto
Univ., 14, 43-44.
[12] Iwagaki, Y., Tsuchiya, Y., and Sakai, M.
(1965). Basic
Studies on the Wave Damping due to Bottom
Friction (2).
On the Measurement of Bottom Shearing Stress.
Bull,
Disaster Prevention Res. Inst., Kyoto Univ., 1_4_,
45-46.
142 COASTAL ENGINEERING
[13] Johnson, J. ¥. and Putnam, J. A. (1949). The
Dissipation
of Wave Energy by Bottom Friction. Trans. Am.
Geoph. Union, 30, 67-74.
[14] Jonsson, I. G. (1963). Measurements in the
Turbulent
Wave Boundary Layer. Intern. Assoc. Hydr. Res.,
Proc.
10th Congress, 1, 85-92, London.
[15] Jonsson, I. G. and Lundgren, H. (1965).
Derivation of
Formulae for Phenomena in the Turbulent Wave
Boundary
Layer. Basic Res. - Prog. Rep. No. 9, 8-14. Coastal
Engrg. Lab,, Tech. Univ. of Denmark.
[16] Jonsson, I. G. (1965). Determination of the
Maximum Bed
Shear Stress in Oscillatory, Turbulent Flow, Basic
Res.
- Prog. Rep. No. 9, 14-20. Coastal Engrg. Lab.,
Tech.
Univ. of Denmark.
[17] Jonsson, I. G. (1965). Friction Factor
Diagrams for
Oscillatory Boundary Layers. Basic Res. - Prog,
Rep.
No. 10, 10-21. Coastal Engrg. Lab., Tech. Univ. of
Denmark.
[18] Jonsson, I. G. (1966). The Friction Factor for
a Current
Superimposed by Waves. Basic Res. - Prog. Rep.
No.
11, 2-12. Coastal Engrg. Lab., Tech. Univ. of
Denmark.
[19] Jonsson, I. G. (1966). On the Existence of
Universal
Velocity Distributions in an Oscillatory, Turbulent
Boundary Layer. Basic Res. - Prog. Rep, No, 12, 2-
10.
Coastal Engrg. Lab., Tech. Univ. of Denmark.
[20] Kalkanis, G. (1957). Turbulent Flow near an
Oscillating
Wall. Univ. of California, Inst. of Eng. Res., Ser.
No, 72, Issue No. 3.
[21] Kalkanis, G. (1964). Transportation of Bed
Material due
to Wave Action, U, S, Army, Coastal Engrg. Res.
Center,
Tech. Memo No. 2,
[22] Lamb, H. (1963). Hydrodynamics. Cambridge
at the
University Press.
[23] Lhermitte, P. (1958). Contribution a I'e'tude
de la
couche limite des houles monochromatiques. La
Houille
Blanche, T3_, A, 366-376.
[24] Li, H. (1954). Stability of Oscillatory Laminar
Flow
along a Wall. U. S. Army, Beach Erosion Board,
Tech.
Mem. No. 47.
[25] Longuet-Higgins, M. S. and Stewart, R. W.
(1960).
Changes in the Form of Short Gravity Waves on
Long
Waves and Tidal Currents. J. Fluid Mech., 8, 565-
583.
WAVE BOUNDARY LAYERS 143
[26] Longuet-Higgins, M. S. and Stewart, R. W.
(1962).
Radiation Stress and Mass Transport in Gravity
Waves,
with Application to "Surf Beats". J. Fluid Mech.,
13,
481-504. ~~
[27] Lukasik, S. J. and Grosch, C. E. (1963).
Laminar Damping
of Oscillatory Waves, Am. Soc. Civ. Engrs., 89,
HY 1, 231-239. —
[28] lundgren, H. (1963). Wave Thrust and Wave
Energy Level.
Intern. Assoc. Hydr. Res., Proc. 10th Congress,
J_»
147-151, London.
[29] Miche, R. (1956). Amortissement des houles
dans le
domaine de 1'eau peu profonde. La Houille
Blanche, 11,
726-745. ~~
[30] Miche, R. (1958). Sur quelques re"sultats d1
amortissement
de houles de laboratoire et leur interpretation.
La Houille Blanche, r3, 40-74.
[31] Motzfeld, H. (1937). Die turbulente StrBmung
an welligen
Wanden. ZAMM, 17.. 193-212.
[32] Uikuradse, J. (1933). StrSmungsgesetze in
rauhen Rohren.
Forschungs-Arb. Ing.-Wesen, Heft 361.
[33] Reinius, E. (1961). Steady Uniform Plow in
Open Channels,
Div. of Hydraulics, Royal Inst. of Tech.,
Stockholm, Bull. No. 60.
[34] Sehlichting, H. (1958). Grenzschicht - Theorie.
G. Braun, Karlsruhe.
[35] Van Dora, W. G. (1966). Boundary
Dissipation of Oscillatory
Waves, J. Fluid Mech., 24, 769-779.
[36] Vincent, G. E. (1957). Contribution to the
Study of
Sediment Transport on a Horizontal Bed due to
Wave
Action. Proc. 6th Conf. Coast. Eng., 326-355,
Florida.
[37] Zhukovets, A. M. (1963). The Influence of
Bottom Roughness
on Wave Motion in a Shallow Body of Water. Bull.
(Izv.) Acad. Sci. USSR, Geophys. Ser., Ho. 10, 943-
948.
Transl. from Geophys. Ser,, Wo, 10, 1561-1570,
Added in proof: In a private communication ("On
the Bottom
Ji'rictional Stress in a Turbulent Oscillatory
Flow" March 8,
1965, received Aug. 1966), Professor Kinjiro
Kajiura, Earthq..
Res. Inst., Univ. of Tokyo, has made an important
contribution
to the analytical treatment of oscillatory turbulent
boundary layers. Due to the time limit for the
completionof this paper, the author unfortunately
was unable to incorporate
ADDITIONAL
TOPICS
CHAPTER 6
ON THE STAR PUZZLE
ABSTRACT
In the star puzzle, there are four pegs, the usual three pegs, S, P
and D, and a fourth one at 0.
Starting with a tower of n discs on the peg P, the objective is to
transfer it to the peg D, in minimum
number of moves, under the conditions of the classical Tower of
Hanoi problem and the additional
condition that all disc movements are either to or from the fourth
peg. Denoting by MS(n) the
minimum number of moves required to solve this variant, MS(n)
satisfies the recurrence relation
( ) 1 1{2 ( ) 3 1}, 2; (0) 0
min
MS n k n MS n k n MS k . This paper studies
rigorously
and extensively the above recurrence relation, and gives a
solution of it.
Keywords : Star puzzle, Three-in-a-row puzzle, Recurrence
relation
1. Introduction
The star puzzle, due to Stockmeyer [6], is as follows : There are
four pegs, the usual three pegs S,
P and D, and a fourth one at 0. Initially, the n discs, d1, d2, …,
dn, rest on the source peg, S, in a
tower (with the smallest disc at the top, the second smallest
above it, and so on, with largest disc at
the bottom), as shown in the figure below. The objective is to
transfer the tower from S to the
destination peg, D, in minimum number of moves, (using the
auxiliary peg P), under the
conditions that (1) each move can shift only the topmost disc
from one peg to another, (2) no disc
can be placed on top of a smaller one, and (3) each disc
movement is either to or from 0.
Let MS(n) be the minimum number of moves required to solve
the star puzzle with n ( 1) discs.
To find the recurrence relation satisfied by MS(n), we consider
the following scheme to transfer
the tower of n discs from the source peg, S, to the destination
peg, D.
Step 1 : move the topmost tower of n – k discs from the peg S to
the peg P, using the available four
pegs, in (minimum) MS(n – k) moves.
Step 2 : shift the k discs (resting on the peg S) to the peg D.
Clearly, only three pegs are available.
In this step, the three pegs S, 0 and D (in this order) may be
treated as being arranged in a row,
forming the three-in-a-row puzzle with k discs. The minimum
number of moves involved is 3k – 1.
Step 3 : transfer the tower of n – k discs from the peg P to the
peg D, completing the tower on the
peg D, in (minimum) MS(n – k) moves.
Thus, the total number of moves required is FS(n, k) 2 MS(n –
k) + 3k – 1, where k (1 ≤ k ≤ n – 1) is
such that FS(n, k) is minimized. Therefore, MS(n) satisfies the
following dynamic programming
equation
MS n k n MS n k n MS k (1.1)
with
MS(0) = 0, MS(1) = 2, (1.2)
with the convention that MS(1) is attained at the point k = 1.
Step 2 of the scheme involves a three-in-a-row puzzle, and we
refer to Scorer, Grundy and Smith
[5] and Majumdar [1] for details on the three-in-a-row puzzle.
Since 3k – 1 is even for all k 1, we see that the term inside the
curly brackets on the right-hand
side of (1.1) is even. Thus, MS(n) is even for all n 1. Let
MSM(n) =
MS(n)
2
(1.3)
Then, we have the following result.
Lemma 1.1 : MS(n) is attained at k = K if and only if MSM(n) is
attained at k = K.
Proof : is evident from the defining equation (1.3).
It may be noted here that, the recurrence relation satisfied by
MSM(n) is
with
MSM(0) = 0, MSM(1) = 1. (1.5)
Let
an = MSM(n) – MSM(n –1) for all n 1. (1.6)
Let the sequence
n n1 b be defined as follows :
bn = 2i 3m, i ≥ 0, m ≥ 0, (1.7)
arranged in increasing order. In this paper, we give a rigorous
proof of the result that
an = bn for all n 1,
by showing that an and bn satisfy the same recurrence relation.
This is done in Section 3. In Section
2, we give some preliminary results related to MSM(n).
2. Some Preliminary Results
Some local-value relationships satisfied by MS(n) have been
derived in Majumdar [3]. By Lemma
1.1, they may be adapted to MSM(n), and are given below.
Lemma 2.1 : For any integer n ≥ 1,
(a) 0 < MSM(n + 1) – MSM(n) < MSM(n + 2) – MSM(n + 1)
≤ 2{MSM(n + 1) – MSM(n)},
(b) MSM(n) is attained at a unique value of k.
Corollary 2.1 : For any integers m 1, n 1,
MSM(n + 1) – MSM(n) = MSM(m + 1) – MSM(m) (1)
if and only if m = n.
Proof : The proof of the “if” part is trivial. To prove the “only if”
part, let the equality (1) hold true
for some integers m and n. Now, if m n, then either m > n or n
> m. In either case, part (a) of
Lemma 2.1 is violated.
Lemma 2.2 : Let MSM(n) be attained at the point k = k1 and
MSM(n + 1) be attained at the point k
= k2. Then, k1 ≤ k2 ≤ k1 + 1.
Lemma 2.2 above states that, if MSM(n) is attained at the point k
= K, then MSM(n + 1) is attained
either at
k = K or at k = K + 1.
Corollary 2.2 : Let MSM(n) be attained at k = K and MSM(n +
1) be attained at k = K + 1. Then,
MSM(n + 2) is attained at k = K + 1.
Lemma 2.3 : Let MSM(n) – MSM(n – 1) be of the form 3m for
some integers n 1, m ≥ 0. Let MS(n)
be attained at k = K. Then, MS(n – 1) is attained at k = K – 1, and
MSM(n + 1) is attained at k = K.
Lemma 2.4 : Let, for some N ≥ 1, MSM(N – 1) be attained at k = K and MSM(N) be attained at k = K
+ 1, so that
MSM(N) – MSM(N – 1) = 3K. (2.1)
Then, there is an integer M ≥ 1 such that
MSM(N + M + 1) – MSM(N + M) = 3K + 1, (2.2)
with M = 1 if and only if N = 1 (so that K = 0).
Moreover, M > K.
Lemma 3.4 : For any n such that 3j < bn < 3j+1 for some integer
j ≥ 0, bn = 2bnj1.
Proof : When j = 0, 1 < b1 < 3, and
b2 = 2b1 = 2 b2– o–1,
and the result is true. So, we assume that the result is true for
(and up to) some j, that is, we
assume that, for all n such that 3s–1 < bn < 3s, 1 ≤ s ≤ j,
bn = 2 bn–s.
To prove the result for j + 1, we assume that
bp 3j < bn < 3j + 1bp
Clearly, any such bn is even. Also, since 3j < 2.3j
< 3j + 1, it follows that, for any N with 3j < bN <
2.3j, bN = 2 bM, for some integer M with 3j – 1 < bM < 3j.
Then, by the induction hypothesis,
bM = 2 bM–j.
Now,
: M N : .
nnnMnN
bb
22
b b b b b b N M 1
Therefore,
N,
M-j+(N-M-1) N-j-1
b
2
b b
so that
bN = 2 bN–j–1; 3j < bN < 2.3j.
Let L be the maximum such N so that
bL = 2 bL–j–1, bL+1 = 2.3j.
Now, since (by Lemma 3.2), there are j elements of the sequence
n n1 b such that
p
j
b < bn < p ,
j
2b
it follows that
L – pj = j,
so that
bL+1 = 2 bL–j.
Thus, the result is true for all n with 3j < bn ≤ 2.3j.
If j 1, there is at least one bn such that p
j
2b < bn < p
j+1
b , the minimum of which is bL+ 2.
Clearly,
L+2 p L-j + 1.
j+1
b 2b 2b
In general, if bL+ s < p ,
j+1
b 2 s ln3 ,
ln2
(j 1) j 1
then bL+ s = 2 bL+s–j–1.
We now prove the main result of the paper, given in the theorem
below.
Theorem 3.1 : For all n 1, an = bn.
Proof : Let kj n < kj+1 for some integer j 0 (so that 3j an
< 3j + 1, 3j bn< 3j + 1).
Then, by Theorem 2.1,
ksksj1
jj
a 2a for all 1 s kj+1 – kj – 1.
Thus, by virtue of Lemma 3.3, an and bn satisfy the same
recurrence relation, and hence, we get the
desired result.
The following theorem gives the solution of the recurrence
relation (1.2).
Theorem 3.2 : For n ≥ 1,
MSM(n) a b .
n
m
m
n
m
m
1 1
Proof : Since MSM(n) can be written as
n
m1
MSM(n) MSM(m)-MSM(m-1) ,
we get the desired expression of MSM(n) by Theorem 3.1. Also,
by Corollary 2.2, MSM(n) is
attained at the unique point k = j + 1. Now, since 3j bn <
3j+1, we see that j must satisfy the
inequality j ln3 ≤ ln(bn) < (j + 1) ln3.
We then get the desired expression of k, given in the lemma.
A consequence of Theorem 3.2 is the following
Corollary 3.2 : For all j 0,
kj+1 = kj + ln3
ln2
(j 1)
+ 1, k0 = 1.
Proof : follows immediately, since (by Corollary 3.1), the
number of elements of the sequence
Proof
: follows by virtue of Theorem 3.2, together with (1.3) and
Lemma 1.1.
The expression of MS(n) is given in Corollary 3.3 above. As has
been pointed out by Stockmeyer
[6] (without proof), an interpretation of the expression of MS(n)
is as follows : In the star puzzle
with n discs d1, d2, …, dn in increasing order (so that d1 is the
smallest disc and dn is the largest
one), the disc dn – m + 1 needs exactly 2 bm number of moves
(1 m n) under the optimal strategy.
4. Concluding Remarks
Stockmeyer [6] gives an outline of a proof of the results in
Corollary 3.3, but his argument is
heuristic, is not supported by any theoretical development, and is
incomplete in the sense that it
lacks the proof that
MS(n) – MS(n – 1) = 2bn.
This paper gives a rigorous treatment of the problem, which
unveils many interesting properties.
Lemma 3.4 gives a new recurrence relation satisfied by the
sequence
n n1 b and Corollary 3.2
gives a recurrence relation satisfied by kj. It is interesting that
MSM(n) satisfies the same
recurrence relation as that of bn.
From Corollary 3.3, we observe that, it in fact offers two
methods of finding MS(n) (for any n 1).
The first method is in terms of the sequence
n n1 b . When n is small, we can readily find MS(n)
by this method. For example, adding the first 6 terms of the
sequence
n n1 b , we see that MS(6)
= 48. For large n, we may use Lemma 3.4 to find bn. Thus, for
example, to find MS(17), by
Corollary 3.3, we have
MS(17) = 2[b1
+ b2 + b3 + (b4 + b5
+ b6) + b7 + (b8 + b9 + b10 + b11)
+ b12 + (b13 + b14 + b15 + b16 + b17)]
Now,
b8 = 2b5, b9 = 2b6, b10 = 2b7, b11 = 2b8,
b13 = 2b9, b14 = 2b10, b15 = 2b11, b16 = 2b12, b17 = 2b13,
b7 = 32 = 9, b12 = 33 = 27.
Thus,
MS(17) = 2[1 + 2 + 3 + (4 + 6 + 8) + 9 + (12 + 16 + 18 + 24)
+ 27 + (32 + 36 + 48 + 54 + 64)] = 728.
Alternatively, from Corollary 3.3, since MS(17) is attained at k
= 3 + 1 = 4, we get
MS(17) = 2MS(13) + 34 – 1 = 2MS(13) + 80.
Now, by Corollary 3.3 again, MS(13) is attained at k = 3 + 1 =
4, so that
MS(13) = 2MS(9) + 34 – 1 = 2MS(9) + 80.
Since MS(9) is attained at k = 3, we get
MS(9) = 2MS(6) + 33 – 1 = 2MS(6) + 26.
Now, MS(6) is attained at k = 2, and so
MS(6) = 2MS(4) + 32 – 1 = 40 + 8 = 48.
Finally, we get MS(17) = 728.
The following recurrence relation has been considered by
Matsuura [4] :
min , ,
n k T(n, ) T(k, ) 2 1 n 1
0kn1
T(0, α) = 0 for all 3,
where 3 is an integer. The problem was taken up by
Majumdar [2], who studied some of the
properties of T(n, ). Of particular interest is T(n, 3). It has been
shown by Matsuura [4], by
induction on n, that
T(n, 3) – T(n – 1, 3) = bn for all n 1,
so that MSM(n) = T(n, 3) for all n ≥ 1.
In passing, it may be mentioned here that, a second recurrence
relation satisfied by the sequence
n n1 b has been derived by Matsuura [4], and is given below.
Lemma 4.1 : For any n such that 2i < bn < 2i +1 for some
integer
i 0. bn = 3bn – i – 1.
To make the above result applicable, it is to be supplemented by
Lemma 4.3. To prove Lemma
4.3, we need the result below.
Lemma 4.2 : For any integer i 0,
: i i+1
nn
ln2
ln3
b 2 b 2 (i 1) .
Proof : is similar to that of Corollary 3.1, and is left as an
exercise.
Lemma 4.3 : Let the sequence of integers {qi}i0 be defined as
follows :
qi b = 2i, i 0; q0 = 1.
Then,
qi+1 = qi + ( )ln2
ln3
i + 1
+ 1.
Proof : is similar to Corollary 3.2, and is omitted here.
Using Lemma 4.3, we can form the table below, which would
help us in finding bn for any n 1
fixed.
CHAPTER 7
ANALYTIC FUNCTIONS
2.1 Introduction
The main goal of this topic is to define and give some of
the important properties of complex analytic functions.
A function f(z) is analytic if it has a complex derivative f 0
(z). In general, the rules for computing derivatives will be
familiar to you from single variable calculus. However, a
much richer set of conclusions can be drawn about a
complex analytic function than is generally true about
real differentiable functions.
2.2 The derivative: preliminaries
In calculus we defined the derivative as a limit. In
complex analysis we will do the same. f 0 (z) = lim ∆z→0
∆f ∆z = lim ∆z→0 f(z + ∆z) − f(z) ∆z . Before giving the
derivative our full attention we are going to have to
spend some time exploring and understanding limits. To
motivate this we’ll first look at two simple examples –
one positive and one negative.
Example 2.1. Find the derivative of f(z) = z 2 . Solution:
We compute using the definition of the derivative as a
limit. lim ∆z→0 (z + ∆z) 2 − z 2 ∆z = lim ∆z→0 z 2 + 2z∆z +
(∆z) 2 − z 2 ∆z = lim ∆z→0 2z + ∆z = 2z. That was a
positive example. Here’s a negative one which shows
that we need a careful understanding of limits.
Example 2.2. Let f(z) = z. Show that the limit for f 0 (0)
does not converge. Solution: Let’s try to compute f 0 (0)
using a limit: f 0 (0) = lim ∆z→0 f(∆z) − f(0) ∆z = lim ∆z→0
∆z ∆z = ∆x − i∆y ∆x + i∆y . Here we used ∆z = ∆x + i∆y.
Now, ∆z → 0 means both ∆x and ∆y have to go to 0.
There are lots of ways to do this. For example, if we let
∆z go to 0 along the x-axis then, ∆y = 0 while ∆x goes to
0. In this case, we would have f 0 (0) = lim ∆x→0 ∆x ∆x =
1. On the other hand, if we let ∆z go to 0 along the
positive y-axis then f 0 (0) = lim ∆y→0 −i∆y i∆y = −1. 1 2
ANALYTIC FUNCTIONS 2
The limits don’t agree! The problem is that the limit
depends on how ∆z approaches 0. If we came from other
directions we’d get other values. There’s nothing to do,
but agree that the limit does not exist. Well, there is
something we can do: explore and understand limits.
Let’s do that now. 2.3 Open disks, open deleted disks,
open regions Definition. The open disk of radius r around
z0 is the set of points z with |z − z0| < r, i.e. all points
within distance r of z0. The open deleted disk of radius r
around z0 is the set of points z with 0 < |z−z0| < r. That
is, we remove the center z0 from the open disk. A
deleted disk is also called a punctured disk. z0 r z0 r Left:
an open disk around z0; right: a deleted open disk
around z0 Definition. An open region in the complex
plane is a set A with the property that every point in A
can be be surrounded by an open disk that lies entirely
in A. We will often drop the word open and simply call A
a region. In the figure below, the set A on the left is an
open region because for every point in A we can draw a
little circle around the point that is completely in A. (The
dashed boundary line indicates that the boundary of A is
not part of A.) In contrast, the set B is not an open
region. Notice the point z shown is on the boundary, so
every disk around z contains points outside B. Left: an
open region A; right: B is not an open region 2.4 Limits
and continuous functions Definition. If f(z) is defined on
a punctured disk around z0 then we say limz→z0 f(z) =
w0 if f(z) goes to w0 no matter what direction z
approaches z0. The figure below shows several
sequences of points that approach z0. If limz→z0 f(z) =
w0 then f(z) must go to w0 along each of these
sequences. ANALYTIC FUNCTIONS 3 Sequences going to
z0 are mapped to sequences going to w0.
Example 2.3. Many functions have obvious limits. For
example: lim z→2 z 2 = 4 and lim z→2 (z 2 + 2)/(z 3 + 1) =
6/9. Here is an example where the limit doesn’t exist
because different sequences give different limits.
Example 2.4. (No limit) Show that lim z→0 z z = lim z→0
x + iy x − iy does not exist. Solution: On the real axis we
have z z = x x = 1, so the limit as z → 0 along the real axis
is 1. By contrast, on the imaginary axis we have z z = iy
−iy = −1, so the limit as z → 0 along the imaginary axis is
-1. Since the two limits do not agree the limit as z → 0
does not exist! 2.4.1 Properties of limits We have the
usual properties of limits. Suppose limz→z0 f(z) = w1 and
limz→z0 g(z) = w2 then • limz→z0 f(z) + g(z) = w1 + w2. •
limz→z0 f(z)g(z) = w1 · w2. 2 ANALYTIC FUNCTIONS 4 • If
w2 6= 0 then limz→z0 f(z)/g(z) = w1/w2 • If h(z) is
continuous and defined on a neighborhood of w1 then
limz→z0 h(f(z)) = h(w1) (Note: we will give the official
definition of continuity in the next section.) We won’t
give a proof of these properties. As a challenge, you can
try to supply it using the formal definition of limits given
in the appendix. We can restate the definition of limit in
terms of functions of (x, y). To this end, let’s write f(z) =
f(x + iy) = u(x, y) + iv(x, y) and abbreviate P = (x, y), P0 =
(x0, y0), w0 = u0 + iv0. Then limz→z0 f(z) = w0 iff
( limP→P0 u(x, y) = u0 limP→P0 v(x, y) = v0. Note. The
term ‘iff’ stands for ‘if and only if’ which is another way
of saying ‘is equivalent to’. 2.4.2 Continuous functions A
function is continuous if it doesn’t have any sudden
jumps. This is the gist of the following definition.
Definition.
If the function f(z) is defined on an open disk around z0
and limz→z0 f(z) = f(z0) then we say f is continuous at z0.
If f is defined on an open region A then the phrase ‘f is
continuous on A’ means that f is continuous at every
point in A. As usual, we can rephrase this in terms of
functions of (x, y): Fact. f(z) = u(x, y) + iv(x, y) is
continuous iff u(x, y) and v(x, y) are continuous as
functions of two variables. Example 2.5. (Some
continuous functions) (i) A polynomial P(z) = a0 + a1z +
a2z 2 + . . . + anz n is continuous on the entire plane.
Reason: it is clear that each power (x+iy) k is continuous
as a function of (x, y). (ii) The exponential function is
continuous on the entire plane. Reason: e z = ex+iy = ex
cos(y) + ie x sin(y). So the both the real and imaginary
parts are clearly continuous as a function of (x, y). (iii)
The principal branch Arg(z) is continuous on the plane
minus the non-positive real axis. Reason: this is clear and
is the reason we defined branch cuts for arg. We have to
remove the negative real axis because Arg(z) jumps by
2π when you cross it. We also have to remove z = 0
because Arg(z) is not even defined at 0.
ANALYTIC FUNCTIONS 5
(iv) The principal branch of the function log(z) is
continuous on the plane minus the nonpositive real axis.
Reason: the principal branch of log has log(z) = log(r) + i
Arg(z). So the continuity of log(z) follows from the
continuity of Arg(z). 2.4.3 Properties of continuous
functions Since continuity is defined in terms of limits,
we have the following properties of continuous
functions. Suppose f(z) and g(z) are continuous on a
region A. Then • f(z) + g(z) is continuous on A. • f(z)g(z) is
continuous on A. • f(z)/g(z) is continuous on A except
(possibly) at points where g(z) = 0. • If h is continuous on
f(A) then h(f(z)) is continuous on A. Using these
properties we can claim continuity for each of the
following functions: • e z 2 • cos(z) = (eiz + e−iz)/2 • If
P(z) and Q(z) are polynomials then P(z)/Q(z) is
continuous except at roots of Q(z). 2.5 The point at
infinity By definition the extended complex plane =
C∪{∞}. That is, we have one point at infinity to be
thought of in a limiting sense described as follows. A
sequence of points {zn} goes to infinity if |zn| goes to
infinity. This “point at infinity” is approached in any
direction we go. All of the sequences shown in the figure
below are growing, so they all go to the (same) “point at
infinity”. Various sequences all going to infinity.
ANALYTIC FUNCTIONS 6
If we draw a large circle around 0 in the plane, then we
call the region outside this circle a neighborhood of
infinity. R Re(z) Im(z) The shaded region outside the
circle of radius R is a neighborhood of infinity. 2.5.1
Limits involving infinity The key idea is 1/∞ = 0. By this
we mean limz→∞ 1 z = 0 We then have the following
facts: • limz→z0 f(z) = ∞ ⇔ limz→z0 1/f(z) = 0 • limz→∞
f(z) = w0 ⇔ lim z→0 f(1/z) = w0 • limz→∞ f(z) = ∞ ⇔ lim
z→0 1 f(1/z) = 0 Example 2.6. limz→∞ e z is not defined
because it has different values if we go to infinity in
different directions, e.g. we have ez = ex e iy and lim
x→−∞ e x e iy = 0 lim x→+∞ e x e iy = ∞ lim y→+∞ e x e
iy is not defined, since x is constant, so ex e iy loops in a
circle indefinitely. Example 2.7. Show limz→∞ z n = ∞
(for n a positive integer). Solution: We need to show that
|z n | gets large as |z| gets large. Write z = Reiθ, then |z
n | = |R n e inθ| = R n = |z| n 2.5.2 Stereographic
projection from the Riemann sphere This is a lovely
section and we suggest you read it. However it will be a
while before we use it in 18.04.
ANALYTIC FUNCTIONS 7
One way to visualize the point at ∞ is by using a (unit)
Riemann sphere and the associated stereographic
projection. The figure below shows a sphere whose
equator is the unit circle in the complex plane.
Stereographic projection from the sphere to the plane.
Stereographic projection from the sphere to the plane is
accomplished by drawing the secant line from the north
pole N through a point on the sphere and seeing where
it intersects the plane. This gives a 1-1 correspondence
between a point on the sphere P and a point in the
complex plane z. It is easy to see show that the formula
for stereographic projection is P = (a, b, c) 7→ z = a 1 − c
+ i b 1 − c . The point N = (0, 0, 1) is special, the secant
lines from N through P become tangent lines to the
sphere at N which never intersect the plane. We
consider N the point at infinity. In the figure above, the
region outside the large circle through the point z is a
neighborhood of infinity. It corresponds to the small
circular cap around N on the sphere. That is, the small
cap around N is a neighborhood of the point at infinity
on the sphere! The figure below shows another common
version of stereographic projection. In this figure the
sphere sits with its south pole at the origin. We still
project using secant lines from the north pole. 2.6
Derivatives The definition of the complex derivative of a
complex function is similar to that of a real derivative of
a real function: For a function f(z) the derivative f at z0 is
defined as f 0 (z0) = limz→z0 f(z) − f(z0) z − z0 Provided,
of course, that the limit exists. If the limit exists we say f
is analytic at z0 or f is differentiable at z0. 2 ANALYTIC
FUNCTIONS 8 Remember: The limit has to exist and be
the same no matter how you approach z0! If f is analytic
at all the points in an open region A then we say f is
analytic on A. As usual with derivatives there are several
alternative notations. For example, if w = f(z) we can
write f 0 (z0) = dw dz z0 = limz→z0 f(z) − f(z0) z − z0 =
lim ∆z→0 ∆w ∆z Example 2.8. Find the derivative of f(z) =
z 2 . Solution: We did this above in Example 2.1. Take a
look at that now. Of course, f 0 (z) = 2z.
Example 2.9. Show f(z) = z is not differentiable at any
point z. Solution: We did this above in Example 2.2. Take
a look at that now. Challenge. Use polar coordinates to
show the limit in the previous example can be any value
with modulus 1 depending on the angle at which z
approaches z0. 2.6.1 Derivative rules It wouldn’t be
much fun to compute every derivative using limits.
Fortunately, we have the same differentiation formulas
as for real-valued functions. That is, assuming f and g are
differentiable we have: • Sum rule: d dz (f(z) + g(z)) = f 0
+ g 0 • Product rule: d dz (f(z)g(z)) = f 0 g + fg0 • Quotient
rule: d dz (f(z)/g(z)) = f 0 g − fg0 g 2 • Chain rule: d dz
g(f(z)) = g 0 (f(z))f 0 (z) • Inverse rule: df −1 (z) dz = 1 f 0(f
−1(z)) To give you the flavor of these arguments we’ll
prove the product rule. d dz (f(z)g(z)) = limz→z0 f(z)g(z) −
f(z0)g(z0) z − z0 = limz→z0 (f(z) − f(z0))g(z) + f(z0)(g(z) −
g(z0)) z − z0 = limz→z0 f(z) − f(z0) z − z0 g(z) + f(z0) (g(z) −
g(z0)) z − z0 = f 0 (z0)g(z0) + f(z0)g 0 (z0) Here is an
important fact that you would have guessed. We will
prove it in the next section. Theorem. If f(z) is defined
and differentiable on an open disk and f 0 (z) = 0 on the
disk then f(z) is constant.
ANALYTIC FUNCTIONS 9
2.7 Cauchy-Riemann equations The Cauchy-Riemann
equations are our first consequence of the fact that the
limit defining f(z) must be the same no matter which
direction you approach z from. The CauchyRiemann
equations will be one of the most important tools in our
toolbox. 2.7.1 Partial derivatives as limits Before getting
to the Cauchy-Riemann equations we remind you about
partial derivatives. If u(x, y) is a function of two variables
then the partial derivatives of u are defined as ∂u ∂x(x,
y) = lim ∆x→0 u(x + ∆x, y) − u(x, y) ∆x , i.e. the derivative
of u holding y constant. ∂u ∂y (x, y) = lim ∆y→0 u(x, y +
∆y) − u(x, y) ∆y , i.e. the derivative of u holding x
constant. 2.7.2 The Cauchy-Riemann equations The
Cauchy-Riemann equations use the partial derivatives of
u and v to allow us to do two things: first, to check if f
has a complex derivative and second, to compute that
derivative. We start by stating the equations as a
theorem. Theorem 2.10. (Cauchy-Riemann equations) If
f(z) = u(x, y) + iv(x, y) is analytic (complex differentiable)
then f 0 (z) = ∂u ∂x + i ∂v ∂x = ∂v ∂y − i ∂u ∂y In
particular, ∂u ∂x = ∂v ∂y and ∂u ∂y = − ∂v ∂x. This last set
of partial differential equations is what is usually meant
by the Cauchy-Riemann equations. Here is the short
form of the Cauchy-Riemann equations: ux = vy uy = −vx
Proof. Let’s suppose that f(z) is differentiable in some
region A and f(z) = f(x + iy) = u(x, y) + iv(x, y). We’ll
compute f 0 (z) by approaching z first from the horizontal
direction and then from the vertical direction. We’ll use
the formula f 0 (z) = lim ∆z→0 f(z + ∆z) − f(z) ∆z , 2
ANALYTIC FUNCTIONS 10 where ∆z = ∆x + i∆y. Horizontal
direction: ∆y = 0, ∆z = ∆x f 0 (z) = lim ∆z→0 f(z + ∆z) − f(z)
∆z = lim ∆x→0 f(x + ∆x + iy) − f(x + iy) ∆x = lim ∆x→0 (u(x
+ ∆x, y) + iv(x + ∆x, y)) − (u(x, y) + iv(x, y)) ∆x = lim ∆x→0
u(x + ∆x, y) − u(x, y) ∆x + i v(x + ∆x, y) − v(x, y) ∆x = ∂u
∂x(x, y) + i ∂v ∂x(x, y) Vertical direction: ∆x = 0, ∆z = i∆y
(We’ll do this one a little faster.) f 0 (z) = lim ∆z→0 f(z +
∆z) − f(z) ∆z = lim ∆y→0 (u(x, y + ∆y) + iv(x, y + ∆y)) − (u(x,
y) + iv(x, y)) i∆y = lim ∆y→0 u(x, y + ∆y) − u(x, y) i∆y + i
v(x, y + ∆y) − v(x, y) i∆y = 1 i ∂u ∂y (x, y) + ∂v ∂y (x, y) = ∂v
∂y (x, y) − i ∂u ∂y (x, y) We have found two different
representations of f 0 (z) in terms of the partials of u and
v. If put them together we have the Cauchy-Riemann
equations: f 0 (z) = ∂u ∂x + i ∂v ∂x = ∂v ∂y − i ∂u ∂y ⇒ ∂u
∂x = ∂v ∂y , and − ∂u ∂y = ∂v ∂x. It turns out that the
converse is true and will be very useful to us. Theorem.
Consider the function f(z) = u(x, y) + iv(x, y) defined on a
region A. If u and v satisfy the Cauchy-Riemann
equations and have continuous partials then f(z) is
differentiable on A. The proof of this is a tricky exercise
in analysis. It is somewhat beyond the scope of this
class, so we will skip it. If you’re interested, with a little
effort you should be able to grasp it. 2.7.3 Using the
Cauchy-Riemann equations The Cauchy-Riemann
equations provide us with a direct way of checking that a
function is differentiable and computing its derivative.
Example 2.11. Use the Cauchy-Riemann equations to
show that ez is differentiable and its derivative is ez . 2
ANALYTIC FUNCTIONS 11 Solution: We write ez = ex+iy =
ex cos(y) + ie x sin(y). So u(x, y) = ex cos(y) and v(x, y) =
ex sin(y). Computing partial derivatives we have ux = ex
cos(y), uy = −e x sin(y) vx = ex sin(y), vy = ex cos(y) We
see that ux = vy and uy = −vx, so the Cauchy-Riemann
equations are satisfied. Thus, e z is differentiable and d
dz e z = ux + ivx = ex cos(y) + ie x sin(y) = ez . Example
2.12. Use the Cauchy-Riemann equations to show that
f(z) = z is not differentiable. Solution: f(x + iy) = x − iy, so
u(x, y) = x, v(x, y) = −y. Taking partial derivatives ux = 1,
uy = 0, vx = 0, vy = −1 Since ux 6= vy the Cauchy-Riemann
equations are not satisfied and therefore f is not
differentiable. Theorem. If f(z) is differentiable on a disk
and f 0 (z) = 0 on the disk then f(z) is constant. Proof.
Since f is differentiable and f 0 (z) ≡ 0, the Cauchy-
Riemann equations show that ux(x, y) = uy(x, y) = vx(x, y)
= vy(x, y) = 0 We know from multivariable calculus that a
function of (x, y) with both partials identically zero is
constant. Thus u and v are constant, and therefore so is
f. 2.7.4 f 0 (z) as a 2 × 2 matrix Recall that we could
represent a complex number a + ib as a 2 × 2 matrix a +
ib ↔ a −b b a . (1) Now if we write f(z) in terms of (x, y)
we have f(z) = f(x + iy) = u(x, y) + iv(x, y) ↔ f(x, y) = (u(x,
y), v(x, y)). We have f 0 (z) = ux + ivx, so we can represent
f 0 (z) as ux −vx vx ux . 2 ANALYTIC FUNCTIONS 12 Using
the Cauchy-Riemann equations we can replace −vx by uy
and ux by vy which gives us the representation f 0 (z) ↔
ux uy vx vy , i.e, f 0 (z) is just the Jacobian of f(x, y). For
me, it is easier to remember the Jacobian than the
Cauchy-Riemann equations. Since f 0 (z) is a complex
number I can use the matrix representation in Equation
1 to remember the Cauchy-Riemann equations! 2.8
Cauchy-Riemann all the way down We’ve defined an
analytic function as one having a complex derivative.
The following theorem shows that if f is analytic then so
is f 0 . Thus, there are derivatives all the way down!
Theorem 2.13. Assume the second order partials of u
and v exist and are continuous. If f(z) = u + iv is analytic,
then so is f 0 (z). Proof. To show this we have to prove
that f 0 (z) satisfies the Cauchy-Riemann equations. If f =
u + iv we know ux = vy, uy = −vx, f0 = ux + ivx. Let’s write
f 0 = U + iV, so, by Cauchy-Riemann, U = ux = vy, V = vx =
−uy. (2) We want to show that Ux = Vy and Uy = −Vx. We
do them one at a time. To prove Ux = Vy, we use
Equation ?? to see that Ux = vyx and Vy = vxy. Since vxy =
vyx, we have Ux = Vy. Similarly, to show Uy = −Vx, we
compute Uy = uxy and Vx = −uyx. So, Uy = −Vx. QED.
Technical point. We’ve assumed as many partials as we
need. So far we can’t guarantee that all the partials
exist. Soon we will have a theorem which says that an
analytic function has derivatives of all order. We’ll just
assume that for now. In any case, in most examples this
will be obvious. 2.9 Gallery of functions In this section
we’ll look at many of the functions you know and love as
functions of z. For each one we’ll have to do three
things. 2 ANALYTIC FUNCTIONS 13 1. Define how to
compute it. 2. Specify a branch (if necessary) giving its
range. 3. Specify a domain (with branch cut if necessary)
where it is analytic. 4. Compute its derivative. Most
often, we can compute the derivatives of a function
using the algebraic rules like the quotient rule. If
necessary we can use the Cauchy-Riemann equations or,
as a last resort, even the definition of the derivative as a
limit. Before we start on the gallery we define the term
“entire function”. Definition. A function that is analytic
at every point in the complex plane is called an entire
function. We will see that ez , z n , sin(z) are all entire
functions. 2.9.1 Gallery of functions, derivatives and
properties The following is a concise list of a number of
functions and their complex derivatives. None of the
derivatives will surprise you. We also give important
properties for some of the functions. The proofs for each
follow below. 1. f(z) = ez = ex cos(y) + ie x sin(y). Domain
= all of C (f is entire). f 0 (z) = ez . 2. f(z) ≡ c (constant)
Domain = all of C (f is entire). f 0 (z) = 0. 3. f(z) = z n (n an
integer ≥ 0) Domain = all of C (f is entire). f 0 (z) = nzn−1 .
4. P(z) (polynomial) A polynomial has the form P(z) = anz
n + an−1z n−1 + . . . + a0. Domain = all of C (P(z) is entire).
P 0 (z) = nanz n−1 + (n − 1)an−1z n−1 + . . . + 2a2z + a1. 5.
f(z) = 1/z Domain = C − {0} (the punctured plane). f 0 (z) =
−1/z2 . 6. f(z) = P(z)/Q(z) (rational function). When P and
Q are polynomials P(z)/Q(z) is called a rational function.
2 ANALYTIC FUNCTIONS 14 If we assume that P and Q
have no common roots, then: Domain = C − {roots of Q} f
0 (z) = P 0Q − P Q0 Q2 . 7. sin(z), cos(z) Definition. cos(z) =
e iz + e−iz 2 , sin(z) = e iz − e −iz 2i (By Euler’s formula we
know this is consistent with cos(x) and sin(x) when z = x
is real.) Domain: these functions are entire. d cos(z) dz =
− sin(z), d sin(z) dz = cos(z). Other key properties of sin
and cos: - cos2 (z) + sin2 (z) = 1 - e z = cos(z) + isin(z) -
Periodic in x with period 2π, e.g. sin(x + 2π + iy) = sin(x +
iy). - They are not bounded! - In the form f(z) = u(x, y) +
iv(x, y) we have cos(z) = cos(x) cosh(y) − isin(x) sinh(y)
sin(z) = sin(x) cosh(y) + i cos(x) sinh(y) (cosh and sinh are
defined below.) - The zeros of sin(z) are z = nπ for n any
integer. The zeros of cos(z) are z = π/2 + nπ for n any
integer. (That is, they have only real zeros that you
learned about in your trig. class.) 8. Other trig functions
cot(z), sec(z) etc. Definition. The same as for the real
versions of these function, e.g. cot(z) = cos(z)/ sin(z),
sec(z) = 1/ cos(z). Domain: The entire plane minus the
zeros of the denominator. Derivative: Compute using the
quotient rule, e.g. d tan(z) dz = d dz sin(z) cos(z) = cos(z)
cos(z) − sin(z)(− sin(z)) cos2(z) = 1 cos2(z) = sec2 z (No
surprises there!) 9. sinh(z), cosh(z) (hyperbolic sine and
cosine) Definition. cosh(z) = e z + e−z 2 , sinh(z) = e z − e
−z 2 2 ANALYTIC FUNCTIONS 15 Domain: these functions
are entire. d cosh(z) dz = sinh(z), d sinh(z) dz = cosh(z)
Other key properties of cosh and sinh: - cosh2 (z) − sinh2
(z) = 1 - For real x, cosh(x) is real and positive, sinh(x) is
real. - cosh(iz) = cos(z), sinh(z) = −isin(iz). 10. log(z) (See
Topic 1.) Definition. log(z) = log(|z|) + i arg(z). Branch:
Any branch of arg(z). Domain: C minus a branch cut
where the chosen branch of arg(z) is discontinuous. d dz
log(z) = 1 z 11. z a (any complex a) Definition. z a = ea
log(z) . Branch: Any branch of log(z). Domain: Generally
the domain is C minus a branch cut of log. If a is an
integer ≥ 0 then z a is entire. If a is a negative integer
then z a is defined and analytic on C − {0}. dza dz =
aza−1 . 12. sin−1 (z) Definition. sin−1 (z) = −ilog(iz + √ 1 −
z 2). The definition is chosen so that sin(sin−1 (z)) = z. The
derivation of the formula is as follows. Let w = sin−1 (z),
so z = sin(w). Then, z = e iw − e −iw 2i ⇒ e 2iw − 2ize iw −
1 = 0 Solving the quadratic in eiw gives e iw = 2iz + √ −4z
2 + 4 2 = iz + p 1 − z 2. Taking the log gives iw = log(iz + p
1 − z 2) ⇔ w = −ilog(iz + p 1 − z 2). From the definition we
can compute the derivative: d dz sin−1 (z) = 1 √ 1 − z 2 .
ANALYTIC FUNCTIONS 16
Choosing a branch is tricky because both the square root
and the log require choices. We will look at this more
carefully in the future. For now, the following discussion
and figure are for your amusement. Sine (likewise
cosine) is not a 1-1 function, so if we want sin−1 (z) to be
single-valued then we have to choose a region where
sin(z) is 1-1. (This will be a branch of sin−1 (z), i.e. a range
for the image,) The figure below shows a domain where
sin(z) is 1-1. The domain consists of the vertical strip z = x
+ iy with −π/2 < x < π/2 together with the two rays on
boundary where y ≥ 0 (shown as red lines). The figure
indicates how the regions making up the domain in the
z-plane are mapped to the quadrants in the w-plane. A
domain where z 7→ w = sin(z) is one-to-one 2.9.2 A few
proofs Here we prove at least some of the facts stated in
the list just above. 1. f(z) = ez . This was done in Example
2.11 using the Cauchy-Riemann equations. 2. f(z) ≡ c
(constant). This case is trivial. 3. f(z) = z n (n an integer ≥
0): show f 0 (z) = nzn−1 It’s probably easiest to use the
definition of derivative directly. Before doing that we
note the factorization z n − z n 0 = (z − z0)(z n−1 + z n−2
z0 + z n−3 z 2 0 + . . . + z 2 z n−3 0 + zzn−2 0 + z n−1 0 )
Now f 0 (z0) = limz→z0 f(z) − f(z0) z − z0 = limz→z0 z n − z
n 0 z − z0 = limz→z0 (z n−1 + z n−2 z0 + z n−3 z 2 0 + . . . +
z 2 z n−3 0 + zzn−2 0 + z n−1 0 ) = nzn−1 0 . Since we
showed directly that the derivative exists for all z, the
function must be entire.
ANALYTIC FUNCTIONS 17
4. P(z) (polynomial). Since a polynomial is a sum of
monomials, the formula for the derivative follows from
the derivative rule for sums and the case f(z) = z n .
Likewise the fact the P(z) is entire. 5. f(z) = 1/z. This
follows from the quotient rule. 6. f(z) = P(z)/Q(z). This
also follows from the quotient rule. 7. sin(z), cos(z). All
the facts about sin(z) and cos(z) follow from their
definition in terms of exponentials. 8. Other trig
functions cot(z), sec(z) etc. Since these are all defined in
terms of cos and sin, all the facts about these functions
follow from the derivative rules. 9. sinh(z), cosh(z). All
the facts about sinh(z) and cosh(z) follow from their
definition in terms of exponentials. 10. log(z). The
derivative of log(z) can be found by differentiating the
relation elog(z) = z using the chain rule. Let w = log(z), so
ew = z and d dz e w = dz dz = 1 ⇒ de w dw dw dz = 1 ⇒ e
w dw dz = 1 ⇒ dw dz = 1 e w Using w = log(z) we get d
log(z) dz = 1 z . 11. z a (any complex a). The derivative for
this follows from the formula z a = ea log(z) ⇒ dza dz =
ea log(z) · a z = aza z = aza−1 2.10 Branch cuts and
function composition We often compose functions, i.e.
f(g(z)). In general in this case we have the chain rule to
compute the derivative. However we need to specify the
domain for z where the function is analytic. And when
branches and branch cuts are involved we need to take
care. Example 2.14. Let f(z) = ez 2 . Since ez and z 2 are
both entire functions, so is f(z) = ez 2 . The chain rule
gives us f 0 (z) = ez 2 (2z). Example 2.15. Let f(z) = ez and
g(z) = 1/z. f(z) is entire and g(z) is analytic everywhere
but 0. So f(g(z)) is analytic except at 0 and df(g(z)) dz = f 0
(g(z))g 0 (z) = e1/z · −1 z 2 . Example 2.16. Let h(z) = 1/(ez
−1). Clearly h is entire except where the denominator is
0. The denominator is 0 when ez − 1 = 0. That is, when z
= 2πni for any integer n. Thus, h(z) is analytic on the set C
− {2πni, where n is any integer} 2 ANALYTIC FUNCTIONS
18 The quotient rule gives h 0 (z) = −e z /(ez − 1)2 . A little
more formally: h(z) = f(g(z)). where f(w) = 1/w and w =
g(z) = ez −1. We know that g(z) is entire and f(w) is
analytic everywhere except w = 0. Therefore, f(g(z)) is
analytic everywhere except where g(z) = 0. Example
2.17. It can happen that the derivative has a larger
domain where it is analytic than the original function.
The main example is f(z) = log(z). This is analytic on C
minus a branch cut. However d dz log(z) = 1 z is analytic
on C − {0}. The converse can’t happen. Example 2.18.
Define a region where √ 1 − z is analytic. Solution:
Choosing the principal branch of argument, we have √ w
is analytic on C − {x ≤ 0, y = 0}, (see figure below.). So √ 1
− z is analytic except where w = 1 − z is on the branch
cut, i.e. where w = 1 − z is real and ≤ 0. It’s easy to see
that w = 1 − z is real and ≤ 0 ⇔ z is real and ≥ 1. So √ 1 − z
is analytic on the region (see figure below) C − {x ≥ 1, y =
0} Note. A different branch choice for √ w would lead to
a different region where √ 1 − z is analytic. The figure
below shows the domains with branch cuts for this
example. Re(w) Im(w) Re(z) Im(z) 1 domain for √ w
domain for √ 1 − z Example 2.19. Define a region where
f(z) = √ 1 + ez is analytic. Solution: Again, let’s take √ w to
be analytic on the region C − {x ≤ 0, y = 0} So, f(z) is
analytic except where 1 + ez is real and ≤ 0. That is,
except where ez is real and ≤ −1. Now, ez = ex e iy is real
only when y is a multiple of π. It is negative only when y
is an odd mutltiple of π. It has magnitude greater than 1
only when x > 0. Therefore f(z) is analytic on the region C
− {x ≥ 0, y = odd multiple of π} 2 ANALYTIC FUNCTIONS
19 The figure below shows the domains with branch cuts
for this example. Re(w) Im(w) Re(z) Im(z) −3πi −πi πi 3πi
domain for √ w domain for √ e z + 1 2.11 Appendix:
Limits The intuitive idea behind limits is relatively
simple. Still, in the 19th century mathematicians were
troubled by the lack of rigor, so they set about putting
limits and analysis on a firm footing with careful
definitions and proofs. In this appendix we give you the
formal definition and connect it to the intuitive idea. In
18.04 we will not need this level of formality. Still, it’s
nice to know the foundations are solid, and some
students may find this interesting. 2.11.1 Limits of
sequences Intuitively, we say a sequence of complex
numbers z1, z2, . . . converges to a if for large n, zn is
really close to a. To be a little more precise, if we put a
small circle of radius around a then eventually the
sequence should stay inside the circle. Let’s refer to this
as the sequence being captured by the circle. This has to
be true for any circle no matter how small, though it may
take longer for the sequence to be ‘captured’ by a
smaller circle. This is illustrated in the figure below. The
sequence is strung along the curve shown heading
towards a. The bigger circle of radius 2 captures the
sequence by the time n = 47, the smaller circle doesn’t
capture it till n = 59. Note that z25 is inside the larger
circle, but since later points are outside the circle we
don’t say the sequence is captured at n = 25 2 ANALYTIC
FUNCTIONS 20 A sequence of points converging to a
Definition. The sequence z1, z2, z3, . . . converges to the
value a if for every > 0 there is a number Nsuch that |zn
− a| < for all n > N. We write this as limn→∞ zn = a.
Again, the definition just says that eventually the
sequence is within of a, no matter how small you choose
. Example 2.20. Show that the sequence zn = (1/n + i) 2
has limit -1. Solution: This is clear because 1/n → 0. For
practice, let’s phrase it in terms of epsilons: given > 0 we
have to choose Nsuch that |zn − (−1)| < for all n > NOne
strategy is to look at |zn + 1| and see what Nshould be.
We have |zn − (−1)| = 1 n + i 2 + 1 = 1 n2 + 2i n
< 1 n2 + 2 n So all we have to do is pick N large enough
that 1 N2 + 2 N < Since this can clearly be done we have
proved that zn → i. This was clearly more work than we
want to do for every limit. Fortunately, most of the time
we can apply general rules to determine a limit without
resorting to epsilons! Remarks. 1. In 18.04 we will be
able to spot the limit of most concrete examples of
sequences. The formal definition is needed when dealing
abstractly with sequences. 2. To mathematicians is one
of the go-to symbols for a small number. The prominent
and rather eccentric mathematician Paul Erdos used to
refer to children as epsilons, as in ‘How are the epsilons
doing?’ 3. The term ‘captured by the circle’ is not in
common usage, but it does capture what is happening. 2
ANALYTIC FUNCTIONS 21 2.11.2 limz→z0 f(z) Sometimes
we need limits of the form limz→z0 f(z) = a. Again, the
intuitive meaning is clear: as z gets close to z0 we should
see f(z) get close to a. Here is the technical definition
Definition. Suppose f(z) is defined on a punctured disk 0
< |z − z0| < r around z0. We say limz→z0 f(z) = a if for
every > 0 there is a δ such that |f(z) − a| < whenever 0 <
|z − z0| < δ This says exactly that as z gets closer (within
δ) to z0 we have f(z) is close (within ) to a. Since can be
made as small as we want, f(z) must go to a. Remarks. 1.
Using the punctured disk (also called a deleted
neighborhood) means that f(z) does not have to be
defined at z0 and, if it is then f(z0) does not necessarily
equal a. If f(z0) = a then we say the f is continuous at z0.
2. Ask any mathematician to complete the phrase “For
every ” and the odds are that they will respond “there is
a δ . . . ” 2.11.3
Connection between limits of sequences and limits of
functions
Here’s an equivalent way to define limits of functions:
the limit limz→z0 f(z) = a if, for every sequence of points
{zn} with limit z0 the sequence {f(zn)} has limit a.
CHAPTER 8
PERMUTATION AND
COMBINATION SERIES
ABSTRACT
The Permutation Series and Combination Series will ensure
the readers to understand proper calculation of Permutation
and Combination and will also help them to grew their
knowledge on the topic.
It is very helpful topic for the students to strengthen their
roots in mathematics. The magic that Mathematics have in it
will be exposed to the readers to understand their
Mathematics thoroughly and will also help them to enlarge
their thinking capabilities.
Hence, this topic is very interesting as it provides a link
between A.P, G.P with Permutation and Combination.
It will help to calculate many selections and others in a very
small time.
REFERENCES:-
[1]Amit Rastogi,Mathematics
[2]Saha and Saha, ISC Mathematics xii
[3] Ml.Aggarwal, Understanding ISC Mathematics xii