Here is a positive integer and is an integer index of a Fourier coefficient. Split a period into intervals and set on the th interval. Periodicity and integrability give
For , is a root of unity different from one and satisfies , so . Therefore
For the same substitution gives . If the mean of is zero, this last mode vanishes as well. Since the linear span of the exponentials with is the space of trigonometric polynomials of degree at most , every pairing with that space is zero. This is the periodic dilation annihilates low Fourier modes property. The integer-index assumption is essential; the stated Fourier orthogonality would generally be false for noninteger .
For , choose a sample satisfying for each integer . A convenient branch is
Thus . The undivided identity in part (d) gives
Rotation invariance makes all three vertex values equal, so . The exponential has the same endpoint value at both ends. Integration by parts in the definition of therefore gives
These are the Fourier coefficients with the positive-exponential convention. Hence the computed boundary trace is
Every quantity in this rotationally invariant Neumann reconstruction in an equilateral triangle is determined by the prescribed . To check that no denominator was silently divided by zero, put , . Then
Neither factor vanishes for . For sufficiently smooth compatible traces, the periodic extension of is continuous and piecewise smooth; the Fourier series recovers , with the usual endpoint convention. Reality implies even though the sampling formula uses complex arguments.
For , first impose the zero-flux compatibility from part (c). For take the nonzero root and use the same coefficient formula with . The coefficient is an arbitrary real constant times , expressing the additive constant for this problem with a Neumann boundary condition. The zero sample cannot determine it. For example, admits every constant solution, so no uniquely specified is possible without a normalization.
For completeness, negative parameters can be handled without assuming away resonances. Let be a real orthonormal eigenbasis of the Neumann Laplacian, with , and define
using the corresponding oriented on each side. The weak equation and Green's first identity give the explicit coefficient relation
At a nonresonant parameter this determines the unique solution. Its common trace is the continuation of the displayed spectral Fourier coefficients from ; choose either nonzero root of . If an individual quotient is at a nonresonant parameter, use its removable limit in , rather than declare a new eigenvalue. For example, a double sampling root can make without making the boundary problem singular. The weak coefficient relation proves that the solution is analytic in the parameter wherever no vanishes, so these nonresonant limits exist.
At a genuine resonance , the Fredholm solvability condition is precisely for every . Necessity follows directly from the coefficient relation. For compatible smooth data, sufficiency follows by dividing all nonresonant coefficients and leaving the resonant ones free. The boundary functional is continuous on , so ; away from the finite resonant eigenspace this implies . Thus the resulting series converges in and satisfies the weak equation, not just its individual coefficient identities. The full solution and its boundary values are thus
with convergence in the weak solution space and the associated trace sense. Rotation averaging selects the common-side component; a nonsymmetric homogeneous addition can have different traces on the three sides. Incompatible resonant data give no solution. For arbitrary real , compatibility and the free homogeneous components are essential; the source does not specify conditions that would select a unique trace at resonance.
Let denote the common trace transform of the unique solution, or of the rotational average at an exceptional parameter. Because and are real and is real, and . Taking the Schwarz conjugate of the global relation means replacing by and conjugating the whole equation. It yields the second of the conjugate global relations for the modified Helmholtz equation:
In this conjugation the rotated arguments interchange; after putting terms in the order , the coefficients have the displayed signs and arguments. Define
The elementary cube-root identities give
Multiply the first global relation by and the conjugate one by . Then the coefficient of is one in both equations:
where all the quantities on the right are known,
Subtracting eliminates . If
the resulting solution for the requested transform is
At a zero of the denominator this identity is interpreted in its undivided form. The transforms themselves remain finite for ; consequently the numerator must vanish. That cancellation, rather than evaluation of a singular quotient, determines the Fourier coefficients below.
The Generalized Stokes theorem applied to the closed differential one-form gives
Equivalently, the global relation is
The identical outward Neumann boundary data make the three known transforms equal:
To reduce the unknown traces to a single function, use rotation invariance and uniqueness. For the difference of two solutions has zero outward derivative and
by Green's first identity. Thus . Rotation by preserves the equation, the domain and the oriented boundary data, so it preserves ; hence and . The global relation becomes the single equation with three spectral unknowns
The three unknowns are evaluations of the same boundary transform, not three freely specified boundary data.
The printed allowance of all real requires a qualification. At , existence requires by the divergence theorem, and solutions differ by a constant. Fixing a rotation-invariant normalization gives uniqueness and the same rotational conclusion. In fact the unnormalized solution is already invariant: its rotation difference is constant, and three successive rotations make three times that constant zero. For , uniqueness fails precisely when is an eigenvalue of the Neumann Laplacian. At these parameters identical data do not force an arbitrary solution to be rotationally invariant. Averaging any solution over the three rotations produces a solution with the common trace used here; the difference is a homogeneous Neumann eigenfunction, or a sum of them. Part (e) describes both solvability and this remaining freedom rather than assuming uniqueness for every real parameter.
Fix counterclockwise arclength on each side and take the outward normal derivative. Write
The unit tangent is and the outward unit normal is . On side this gives the chain-rule identity
Put . The exponential in the closed differential one-form pulls back to
Also . Consequently the contribution of side is , where the required local side spectra are
These are spectral integral transforms in the local coordinate of each side. Keeping the tangential-derivative term is important: premature integration by parts in a single side integral would leave corner values, which cannot simply be discarded. At the special samples used below, those endpoint terms do vanish for the rotationally invariant solution.
With the Wirtinger derivatives, . Put , . The PDF has the factor in this exponential; omitting it, as the TeX does, would give the wrong local relation. Choose
Indeed, and , so direct differentiation gives
The unwanted terms cancel exactly. Thus the divergence identity is equivalent to the modified Helmholtz equation, including its Laplace equation case . Equivalently,
is a closed differential one-form. Its oriented boundary integral supplies the polygonal modified Helmholtz global relation.
In single-photon emission computed tomography, the unknown is an emitting source, rather than the absorption coefficient reconstructed by transmission computed tomography. Photons emitted at different points on the same ray are weighted by their probability of surviving the path to the detector. If the known attenuation is and the detector is at the positive end of the ray, the data are an attenuated Radon transform
The directional transport equation is with zero incoming intensity. An integrating factor derives this attenuation weight. The same complexification, boundary-value and jump strategy gives spectral reconstruction of an attenuated Radon transform when attenuation is known. The unattenuated inverse from part (d) applies directly only when ; for nonzero attenuation the weighted jump and inverse must be used. This distinction allows emission imaging of the source without confusing it with reconstruction of the absorbing medium.
In ideal computed tomography, the unknown is an absorption coefficient . Along a straight ray the transmitted intensity satisfies , so
Thus calibrated transmission measurements supply the Radon transform of the slice. The inversion above reconstructs the coefficient by filtered backprojection: filter each projection in its transverse variable and then accumulate it over the rays through each image point. This turns a collection of line-integral measurements into a spatial map, which is the key usefulness of the result.
The ideal derivation assumes known ray geometry, sufficiently complete angular sampling and a straight-ray attenuation model. The ramp Fourier multiplier grows at high frequency, so measurement noise is amplified. Practical reconstruction therefore uses discretization and regularization of an inverse problem, for example a window on the ramp filter. Limited angles or missing detector positions cannot be treated as if they were complete noiseless Radon transform data.
The two boundary values have jump
The line-tail contributions cancel. Because the complexified transport Cauchy kernel is holomorphic on both sides of the unit circle and vanishes at spectral infinity, the Cauchy integral formula reconstructs it from this jump:
There is no additional entire term: its inside and outside boundary values would agree, so it would define an entire function vanishing at infinity. Expand outside the circle as . Then
In the original coordinate , the transport equation is . Its constant term at infinity is . Since
we obtain the inverse Radon transform in filtered backprojection form:
Opposite directions represent the same unoriented line. Reversing by reverses ; the Hilbert transform changes sign under this reversal, and its derivative changes it back. Thus the integrand agrees for opposite directions and the factor becomes if the angular integral is over . With the convention , the Hilbert transform has Fourier multiplier ; the derivative makes the filter . This also identifies the formula with the standard ramp-filter reconstruction.
Define the Radon transform and its transverse Hilbert transform by
Use the signed Cauchy boundary operators and . Thus and are the complementary idempotent projections; itself carries the signed lower-boundary convention. The PDF defines the outside limit but omits the definition of the inside limit in its displayed formula. We take , as required by that formula.
As , apply the Sokhotski–Plemelj formula to the kernel from part (b):
The principal value contribution is . The delta contribution is the same from either side and equals
Since for the inside limit, the resulting boundary value is
The outside limit similarly has in place of . Naming the signed convention explicitly prevents a sign error from treating as a positive projection.
The distributional identity gives the Cauchy-Green operator solution
where is in the changed real coordinates. The singularity is locally integrable. For Schwartz functions, splitting the integral into a region near the origin and a rapidly decaying far region proves . If two solutions obey this decay, their difference has zero Wirtinger derivative and is an entire holomorphic function tending to zero; the Liouville theorem proves uniqueness.
The change-of-variables Jacobian has absolute value . Therefore an equivalent form of the complexified transport Cauchy kernel is
In the original complex coordinate , it is
For the denominator can be rewritten to give the kernel . For it is . Consequently the spectral solution is holomorphic separately inside and outside the unit circle, with at zero and at infinity. These normalizations will determine its jump reconstruction.
For definiteness take in the Schwartz space; sufficiently smooth compactly supported data are also adequate. These hypotheses make the line integrals, Cauchy principal values and decay estimates below well defined. Write with , , and introduce orthonormal local coordinates
Let , and . Substitution into the directional transport equation gives
Now make the invertible real-linear change of coordinates
Since , its Wirtinger derivative is . Hence , as required. The change becomes singular at , where the complex operator degenerates to a real directional derivative. Also the original equation contains , so is excluded from the differential equation; the normalized solution will extend analytically there.
Expanding the matrix determinant from part (b) gives
The finite-interval Airy spectral determinant obeys . At the origin,
This zero comes from coalescence of the three rotated equations; it is removable in the underlying boundary system. Indeed, with has only the zero quadratic solution.
For , a zero of is equivalent to the existence of a nonzero combination satisfying the homogeneous endpoint conditions. This can be checked by expanding the determinant of those three endpoint equations. Such a function satisfies , so it is an eigenfunction of with eigenvalue . Integration by parts yields
so every nonzero zero has . None lies on the boundary : by a cube-root rotation it suffices to take real. With , the determinant equation becomes
The right-hand side has squared modulus for , whereas the left-hand side has modulus one. Therefore there are no nonremovable spectral poles in , and the contour representation has no discrete residue contribution from that domain.
Taken literally as a claim about the operator's discrete spectrum, however, the printed assertion is false. To see this constructively, put , . Then
Thus zeros occur when
Between successive positive cosine maxima and adjacent negative minima the difference changes sign. There are consequently infinitely many positive roots, producing genuine negative eigenvalues of . The third-order resolvent maps into , whose inclusion into is compact, so these are indeed discrete spectrum of an operator with compact resolvent. The valid conclusion is absence of poles in the reconstruction sectors, not absence of operator eigenvalues.
The rotated global relations form a square system for the three missing boundary traces. Solve this system and substitute the resulting finite-time spectral boundary transforms into the integral representation. The pieces containing have zero contour contribution by analyticity, rotation of the relevant sectors and the Cauchy integral theorem. The remaining expression involves only . The finite-interval Airy spectral determinant has no nonremovable zeros in the contour domains, as established below, so this elimination introduces no extra spectral data there. Differentiating the representation, and using temporal inversion and compatibility at the corners, verifies the partial differential equation, initial value and the three prescribed boundary values.
For a direct Hadamard well-posedness check, the homogeneous difference satisfies
This proves uniqueness and continuous dependence for homogeneous boundary data. More generally subtract a smooth quadratic boundary lift satisfying the three prescribed endpoint conditions. The remaining problem has homogeneous boundary conditions and forcing . Its semigroup generator is on with . It is a dissipative operator; for every real the equation has a unique solution, since the homogeneous third-order boundary system is injective by the same energy identity and therefore invertible. Thus is maximal dissipative and generates a contraction semigroup. This gives existence and continuous dependence on the lifted data and forcing. Smooth compatible data therefore define a well-posed problem. This operator argument and the spectral elimination describe the same evolution.
Let
The upper domain is the sector ; the lower domain consists of the sectors and . Orient their boundaries with the corresponding domain to the left. For and , the Fokas method gives the integral representation
Here are the combinations of all six finite-time spectral boundary transforms defined above. Initially, Fourier inversion of the global relation gives the first integral together with and . For the left endpoint, deform through the upper complementary sectors, where the spatial exponential decays and
is bounded. This replaces the real line by . For the right endpoint, deform in the lower half-plane; the real portions of run from right to left. Thus its integral is the negative of the real-line integral, explaining the minus sign in the last displayed term. The arc contributions vanish by spatial exponential decay and integration by parts in the transforms. Oscillatory real-line integrals can equivalently be defined by a decaying cutoff and its limit.
Finally use the finite-horizon extension of a boundary transform. The difference between upper limits and contains , bounded in , while the appropriate spatial factor decays inside or . The Cauchy integral theorem makes this difference vanish. Keeping also avoids an artificial endpoint half-value in temporal inversion. The integral representation at this stage deliberately includes the unknown traces; the rotated global relations eliminate them in the next step.
Use negative-exponential spatial Fourier transforms and finite-time spectral boundary transforms:
Write and . Integrate the local relation first over and then over time. The left and right endpoint fluxes have opposite signs, giving the finite-interval Airy global relation
All these spatial and temporal integral transforms are entire functions of for sufficiently smooth data on the finite intervals. Put and , . The dispersion relation obeys ; hence the same global relation holds at all three . In particular, the missing traces satisfy the concrete linear system
where, with a common upper time limit ,
The finite-time spectral boundary transforms are invariant under these rotations because their time kernel depends only on . The coefficients multiplying them are not invariant; these differences make the three equations useful for eliminating the missing boundary traces.
For the Airy equation, let . Its local relation follows by arranging the flux so that the unwanted spatial derivatives cancel:
Consequently
Thus the dispersion relation and the required flux are given by
The calculation is polynomial in the complex spectral parameter, so the local relation holds for every .
Let the point light be at . For a subdivision curve point , its projected shadow lies on the ray beyond the subdivision curve:
The shadow is the first intersection of that ray with the receiving subdivision surface after the subdivision curve point. Thus solve
and retain the smallest admissible . This is the defining equation for shadow tracing for a subdivision curve.
First organize the subdivision surface patches into a bounding volume hierarchy. For a restricted subdivision curve interval, rays through its enclosing volume define an enclosing ray cone from ; subdivision surface bounds that do not meet this cone can be rejected. Refine surviving subdivision curve intervals and subdivision surface patches. For a fixed , isolate all possible ray intersections using those bounds, then correct each regular candidate with the Jacobian matrix for the Newton method
The scalar triple product shows that is invertible exactly when . Enforce the patch domain and throughout correction, and choose the smallest valid . Bounds or validated root isolation, rather than a fixed list of subdivision curve samples, are needed if every shadow component is to be found.
Once a regular intersection is known, follow it as changes. Differentiating gives a useful predictor:
Take a small predictor step in and apply a Newton method correction at the new subdivision curve parameter. Move through patch adjacency with its chart transition; shrink steps when derivatives or error estimates change rapidly. Subdivide further and test a geometric curve-to-chord bound to approximate the resulting shadow trace to a chosen tolerance.
Surface-boundary crossings terminate or clip a trace. If a ray has no admissible subdivision surface intersection, that subdivision curve parameter contributes no shadow on . At grazing contact the Jacobian is singular, so use interval subdivision and root isolation to detect the event and seed any outgoing branches. If several intersections are possible, recheck which is first; facing the light locally is helpful but is not a proof of global uniqueness. Open-curve endpoints and closed-curve seams must also be accounted for. With a compact represented geometry, transversal intersections and validated subdivision bounds, this algorithm traces every visible component; a purely sampled implementation gives only a tolerance-dependent approximation and cannot certify arbitrary tiny missed components.
For a directional light, replace the ray by for a fixed propagation vector and . The intersection equation becomes , with Jacobian and continuation right-hand side . The same enquiries and event handling apply.
The corresponding subdivision surface interrogation needs mesh connectivity and patch adjacency, boundary and crease flags, local coordinate charts with transition maps, and subdivision into smaller patches with their original-chart mappings. Its evaluation enquiry returns a limit point, tangent derivatives and a normal vector; second derivatives are supplied only where the limit is sufficiently smooth. Certified bounding volumes and patch approximation errors allow a hierarchy for intersection and proximity searches. Boundary-curve enquiries complete the interface for clipping.
On regular parts of a subdivision surface, these evaluations may use its equivalent tensor-product or box spline patch. Near an extraordinary subdivision vertex, the local subdivision matrix determines the limit position through its constant left eigenvector, and its tangent modes determine the normal vector under the scheme's characteristic map of a subdivision surface regularity conditions. Refinement alone does not establish those conditions. A subdivision surface may have a well-defined tangent plane there without possessing second derivatives or Gaussian curvature. An interrogation interface must distinguish these cases and can work on surrounding regular charts when a higher derivative is unavailable at the vertex itself.
Together, subdivision, bounds, topology and limit evaluation support ray–subdivision surface intersection: bounds eliminate irrelevant patches; surviving patches are refined, and regular candidate intersections are corrected using position and first derivatives. The returned intersection is a point of the limit subdivision surface with an error certificate, rather than automatically a point on the last control mesh.
A useful subdivision curve interrogation supplies the following connected capabilities. It describes the parameter interval, open or closed topology, endpoints and break points; it evaluates the limit point and, where the scheme guarantees them, and ; and it refines or restricts an interval while retaining the mapping to the original parameter. It also provides enclosing bounds and a certified curve-to-chord error on each restricted piece. These are enough to build clipping, intersections, closest-point searches, tangents, curvature and adaptive sampling.
The enquiries concern the subdivision limit, not just a finite refined control polygon. For a stationary local refinement matrix , a limit vertex can be obtained from a normalized left eigenvector , , as . Derivatives use the appropriately scaled difference schemes or equivalent spline evaluation on regular intervals. The convergence and derivative hypotheses must actually hold for the scheme; no second derivative can be requested at an intrinsic crease.
If the subdivision mask is nonnegative and preserves constants, descendants and limit points lie in the relevant control-point convex hull, giving a useful enclosing volume. For subdivision masks with negative weights, that hull need not be an enclosure: the interface must supply another valid bound, for example from a proven refinement-error estimate. This distinction is important for safe spatial rejection in an algorithm.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact