Let and let be the first visit to strictly after , with if there is none. Put . The Strong Markov property at each finite first return time gives, by induction,
The number of visits, including time zero, is . By Tonelli theorem for nonnegative terms,
If , this geometric series is , and is the probability of never returning. If , every term of the final series is one and both sides are infinite. Thus
with the prescribed infinite-value convention. This covers both transient states and recurrent states.
Away from , a Green function for this second-derivative operator is linear in . The left boundary condition makes it on , and the right Neumann boundary condition makes it constant on . Continuity gives . Integrating the distributional equation through the Dirac delta function gives the jump , so . Therefore
Apply the Green function to the forcing:
Evaluation yields
Indeed , so , and . A difference of two solutions is linear with these homogeneous boundary conditions, hence zero; the boundary value problem has a unique solution.
Lift the angular coordinate continuously to a real coordinate and write and for a prescribed winding number . Assume for the calculation; reversing the endpoints changes no length. The arc length functional on the circular cylinder is
The Euler-Lagrange equation says is constant. This expression is strictly increasing in , so is constant. The candidate is the helix
It is a global minimum within the chosen winding class: the integrand is strictly convex, and Jensen inequality bounds the functional below by , with equality only for constant slope. Equivalently, unrolling the cylinder makes the minimizing path a straight segment.
The signed pitch of a helix, measured for an increase of in angle, is
Its geometric magnitude is . If only the physical endpoints are fixed, choose the integer minimizing ; opposite points may give two equally short helices. If the lifted endpoint angles are prescribed, use that winding class. A zero angular increment gives a straight generator, the limiting infinite-pitch case.
Use Fourier inversion with the stated Fourier transform convention:
For , close the contour integral in the lower half-plane, where decays. Jordan lemma eliminates the large semicircle. The contour is clockwise, so the residue theorem supplies times the residue at . That simple pole has
Consequently
The minus sign uses both the clockwise orientation and the residue ; it is consistent with the full odd function away from zero.
The convention in this question counts a point whenever every open neighbourhood meets , without excluding the point itself. These are adherent points, whose set is the closure ; they differ from limit points under the convention that requires a different point of in each neighbourhood.
If is a closed set and , the open set is a neighbourhood of disjoint from . Thus every adherent point lies in . Conversely, if every adherent point lies in , each has an open neighbourhood disjoint from . Their union is , which is open. Hence is closed exactly when it contains all the points specified in the question.
The interior of a set and closure are
The neighbourhood description of the closure follows because failure to be adherent is equivalent to lying in an open set disjoint from .
For closure of a connected set, suppose were a separation into two nonempty relatively open sets. Their intersections with the connected subset would separate unless one intersection were empty. Say . Choose and an open set with and . Since , the set meets , contradicting . Thus the closure of a connected set is connected. The empty-set case holds directly.

There are unlisted articles, also show them or only show them.