Академический Документы
Профессиональный Документы
Культура Документы
CSE392(63625), M393C(54377)
MW 11:00a.m.-12:30p.m. GDC 5.304
Assignment 1
Note:
• Due 11:59pm September 12, 2018
• There are 100 points in total.
• Solutions must be written by yourself. Copying homework solutions from another student, from
a textbook, from a webpage, or from any other source is not allowed.
• Please typeset your solutions using the latex template provided with the assignments. If you submit
handwritten solutions they must be written legibly.
• The solution must be submitted online using the Canvas assignment page. See instructions
here if you are a first-time user.
• These five problems shall help you re-learn some of your computer science, mathematical and proba-
bility/statistics background:
– Geometry and Topology
– Linear Algebra
– Probability
– Functional analysis
1
Exercise 1 [20pts]
(1) [10pts] For what values of d do the surface area A(d) and the volume V (d) of the d-dimensional unit ball
take on their maximum values respectively? [Hint: The surface area A(d) = 2π (d)/2 /Γ((d)/2). The
Gamma function Γ(x) = (x−1)! is the factorial function shifted down by 1. The volume V (d) = A(d)/d]
(2) [10pts] How about the d-dimensional ball of radius 10? For what values of d do its surface area and
volume take on their maximum values respectively?
V (d)
[Hint: A trick that simplifies the analysis is to consider the ratio V (d+2) ]
Exercise 2 [20pts]
(1) [10pts] Prove that any orthogonal matrix in M2 (R) is either a rotation Rθ about the origin with angle
of rotation θ or a reflection ρθ about the line passing through origin making an angle θ/2. where
cos θ − sin θ cos θ sin θ
Rθ = , ρθ =
sin θ cos θ sin θ − cos θ
Exercise 3 [20pts]
2
(1) [10pts] Given the distribution √1 e−x /18 , what is the probability that x > 2? Express your answer in
3 2π
Rξ 2
terms of the error function erf(ξ) = √2π 0 e−t d t.
(2) [10pts] For each of the following probability distributions, apply the Markov inequality and Chebyshev
inequality to bound Pr[x ≥ a], where a > 1. For what value(s) of a is the Chebyshev bound tighter in
each case?(
1, x = 1
a, p(x) =
0, otherwise
(
1
, 0≤x≤2
b, p(x) = 2
0, otherwise
2
Exercise 4 [20pts]
Let V be a vector space, and define p : V × V → F(C or R). Then p is an inner product on V if it satisfies
the following:
• ∀u ∈ V, p(u, u) > 0; p(u, u) = 0 ⇐⇒ u = 0
• ∀u, v ∈ V, p(u, v) = p(v, u) (Conjugate Symmetry)
• ∀u1 , u2 , v ∈ V, ∀α1 , α2 ∈ F, p(α1 u1 + α2 u2 , v) = α1 p(u1 , v) + α2 p(u2 , v)
Denote as (u, v) = p(u, v). A vector space on which an inner product has been defined is called an inner
product space. Denote the inner product space as (V, (·, ·)).
def 1
(1) [5pts] For an inner product space (X , (·, ·)), prove that kxk = (x, x) 2 is a norm on X .
(2) [5pts] Once the inner product induces a norm, its has lots of properties similar to norms in Euclidean
space:
• Pythagorean: (u, v) = 0 ⇒ ku + vk2 = kuk2 + kvk2
• Parallelogram Law: ku + vk2 + ku − vk2 = 2kuk2 + 2kvk2
Can we introduce an inner product on the function space C[a, b], such that:
1
(f, f ) 2 = max |f (x)| ∀f ∈ C[a, b]
a6x6b
where the function space C[a, b] is the closed set of all continuous functions f defined over the interval
[a, b], i.e.
reaches its minimum. The answer Ris exact, you will get partial points if you solve out numerically.
1
(Hint: consider the norm kf k2 := ( 0 |f |2 dt)1/2 )
Exercise 5 [20pts]
Describe an algorithm (with a justification of its correctness) to search, locate N (hidden) circles Ci of
different radii, in a large bounded rectangular region (R) given by a lower left corner (−L, −B) and the
upper right corner (R, T ) of the Euclidean plane(L, B, R, T 1 are real numbers). The circles are disjoint
but scattered, and may be nested, and so the nesting depth (0 if outermost) needs to be determined as well.
There are bounds of r for the smallest radius, R for the largest radius, and for a minimum separation
distance bound between the boundary of any two circles. The input also includes an Oracle - procedure that
reports all the circle intersection points (counting multiplicities) with any line L within the region (R). The
output should be provided as a list of the circles Ci : (center, radius, nesting depth). [Hint: The Oracle is a
procedure that can be called multiple times for different probing lines L. The returned multiple intersection
points lying on each line L, satisfy a parity rule. ]