For an orthonormal basis , define the Hilbert-Schmidt norm by . For a possibly uncountable basis, the nonnegative sum means the supremum over finite subsets. Parseval's identity gives, for any other orthonormal basis ,
Changing the domain basis in the last expression proves basis independence. Polarization gives a basis-independent inner product
with the same first-argument linear convention. The sums converge by the Cauchy-Schwarz inequality. The operator-norm bound follows by applying Cauchy-Schwarz to the coordinates of a unit vector.
To prove completeness, let be Cauchy in this norm. The operator-norm bound gives a bounded-operator limit . For a finite subset of the basis,
For large , the right side is uniformly small by the Cauchy property. Taking the supremum over shows is Hilbert-Schmidt and ; it also shows is Hilbert-Schmidt. Thus the Hilbert-Schmidt operators form a Hilbert space. Finite-rank operators are dense there: keeping finitely many basis columns makes the sum of omitted squared column norms tend to zero. The operator-norm bound then shows that every Hilbert-Schmidt operator is compact.
Now let be a strongly continuous unitary representation of the compact metric group , as is standard for a representation of a topological group. Fix and average the positive rank-one operator :
The integrand is continuous in the Hilbert-Schmidt norm, so this Bochner integral exists in the complete space just proved. Normalized Haar measure and invariance show that is positive, compact and commutes with every . Moreover,
the integrand is positive near the identity and every nonempty open set has positive Haar measure. Thus . A nonzero eigenspace is finite-dimensional and invariant under , by (a). Within it choose a nonzero invariant subspace of smallest dimension; it is irreducible. Its orthogonal complement is invariant because the representation is unitary, so the finite-dimensional space splits into irreducibles.
Take a maximal orthogonal family of such finite-dimensional irreducible invariant subspaces. If their closed span had a nonzero orthogonal complement, the same averaging argument on that complement would produce another member, contradicting maximality. Therefore
This compact averaging of a rank-one operator argument does not require itself to be separable. Strong continuity is the topological representation hypothesis used in the averaging step.
For a finite-rank operator , define and its trace norm by
where are its nonzero singular values, counted with multiplicity. The finite-rank spectral theorem gives orthonormal systems with , where .
For every bounded operator ,
Choose the contraction taking to and vanishing on their orthogonal complement. It attains equality, so
This formula proves the triangle inequality and absolute homogeneity. Also , so vanishing of the trace norm forces . Thus it is a norm on the vector space of finite-rank operators.
The map , where , is a bounded linear map into the dual of this normed space. Its norm is at most . Rank-one tests give the reverse inequality: and , so taking unit vectors gives .
Conversely, let be a bounded linear functional for the trace norm. The sesquilinear form satisfies
The Riesz representation theorem gives a unique bounded operator with , and . Since every finite-rank operator is a finite sum of rank-one operators, linearity implies for every . Hence
The same identification extends to the completion, the trace-class operators. This is trace-class duality; completeness of the original finite-rank space is not required to identify its bounded dual.
Use complex inner products linear in the first argument throughout. The spectral theorem for compact self-adjoint operators states that, for a compact operator on a Hilbert space, its nonzero spectral values are real eigenvalues, each of finite multiplicity, with no possible accumulation point except zero. Moreover,
where are the mutually orthogonal eigenspace projections. The operator series converges in operator norm when the nonzero eigenvalues are listed in decreasing absolute value. The sum is at most countable, even if the kernel is nonseparable. Zero need not be an eigenvalue.
First prove that a nonzero compact self-adjoint operator has an eigenvalue of magnitude its norm, without assuming a spectral decomposition. Put and choose unit vectors with . Since , expansion gives
Compactness of supplies a subsequence for which converges; the displayed estimate then forces itself to converge to a unit vector satisfying . The vectors and are eigenvectors for and , respectively, whenever nonzero, and they cannot both vanish. This proves the claim.
Self-adjointness gives reality of every eigenvalue and orthogonality of eigenspaces for distinct eigenvalues. An eigenspace for cannot contain an infinite orthonormal sequence: its images under would have pairwise distance , contradicting compactness. The same argument proves that there are only finitely many mutually orthogonal eigenvectors with eigenvalues of magnitude at least any given . Hence all nonzero eigenspaces together have a countable orthonormal basis, and their eigenvalues tend to zero if there are infinitely many.
Let be the orthogonal complement of the closed span of all these eigenspaces. It is invariant under . If were nonzero, the norm-attaining eigenvalue argument applied to that compact self-adjoint restriction would produce another nonzero eigenvector, a contradiction. Thus , and the converse inclusion follows from orthogonality. This establishes the asserted decomposition. On its orthogonal summands the tail of the operator series has norm equal to the supremum of the omitted eigenvalue magnitudes, proving norm convergence.
Finally, a nonzero complex number not among these eigenvalues has positive distance from their set and from zero. Inverting separately on the eigenspaces and kernel therefore gives a bounded inverse. This proves that no other nonzero spectral values occur and completes the theorem.
Use the Lipschitz constant convention in the final quantity; it is a seminorm, with constants having value zero. Also interpret the coupling space as . The printed has an undefined . The third quantity has a duplicated printed label; it is placed in part iii here, with the fourth in part iv.
First prove weak optimal transport duality. For any feasible continuous pair and any coupling of probability distributions with marginals ,
Taking the supremum over pairs and infimum over couplings gives . These quantities are finite: is a coupling and the continuous cost is bounded on the compact metric space . The zero pair is feasible, so .
The reverse inequality is established in part ii by finite approximation and a proof of the required finite linear programming duality. Parts iii and iv then show that all the dual formulations agree.
The overlap of the two charts is obtained by inverting . Since , this also inverts ; then and . Thus its coordinate ring is . The other chart has coordinate . A global section is therefore an element in the intersection
inside : a Laurent polynomial with both only nonnegative and only nonpositive exponents is constant.
Let . Reducing the presentation of gives
As a vector space and as a ring extension, this is
where and is annihilated by . In particular : the free basis of in part ii remains a basis after tensoring with . Although mapped to before reduction, reducing the subring is not the same operation as taking its image inside ; that distinction is exactly where the extra section arises.
On the overlap, is invertible and , so restricts to zero. Therefore the section on the first chart glues to zero on the second chart and defines a nonzero global nilpotent section on . More precisely the reduced first-chart ring is , and
in . The only extra compatible sections are multiples of . Hence
The map printed in the question reduces modulo and includes its image as constants. Its kernel is and its cokernel is . More strongly, even the usual base-change map after tensoring,
is not surjective. This is global-section base-change failure in a flat projective family, despite the properness and flatness proved above.
On , write , , and . The equations include and ; after making these substitutions, the remaining equations are identities. Therefore
The other chart is
There is a homomorphism defined by , , . To prove injectivity rather than merely exhibit a parametrization, reduce monomials using the four relations. Powers of reduce to at most one ; any remaining product of with or eliminates ; powers of reduce to at most one . Thus every element is an -linear combination of
Their images are , with pairwise distinct degrees. Since is a domain and , these images are -linearly independent. Hence they are a basis, the map is injective, and
In particular is torsion-free, indeed free, as an -module.
The two charts cover by the prime-ideal argument in part i. Both coordinate rings are torsion-free over the discrete valuation ring , hence flat: over a principal ideal domain a torsion-free module is a filtered union of finitely generated free submodules, and filtered colimits preserve flatness. Thus the morphism is flat on an open cover and therefore flat everywhere. It is proper because is a closed subscheme of the proper projective space . Consequently is both proper and flat over .
Use the polynomial graded ring , as in the PDF; the doubled brackets in the converted TeX are an OCR error. Let denote the homogeneous defining ideal. The four cubic coordinates in the proposed map never vanish simultaneously on , since and already have that property. Substitution makes each generator of zero, so they define a morphism into the generic fibre.
The two standard opens and cover . Indeed, a homogeneous prime containing contains by , and then contains by . Such a prime contains the irrelevant ideal and gives no point of Proj.
On put , , . Over , where is invertible, the equations give
Thus the generic-fibre chart is exactly . The proposed map restricts to this isomorphism with . On put . The equations give
so this chart is , and the map has . On the overlap . These are the standard two charts of the projective line, proving the scheme-level isomorphism
Equivalently, rescaling by gives the usual twisted cubic. The chart proof also shows that the extra cubic relation introduces no additional generic-fibre scheme structure.
Assume . Every has a unique th root in : existence is the field inclusion and uniqueness follows from injectivity of the Frobenius endomorphism in a field. Since , this root satisfies the monic polynomial over . Because is an integrally closed domain, this gives . The identities
and uniqueness show that
is a ring homomorphism.
On the rule sends a fraction to the fraction of its unique roots. Since , inverting is equivalent to inverting , so the rule localizes. Also, for a prime , exactly when ; hence the induced point map agrees with that of . The localized rules consequently glue to a morphism . Its pullback followed by the Frobenius endomorphism sends to , which proves
If another morphism satisfies this equation, it has the same point map because the Absolute Frobenius morphism fixes points, and its pullback of must be a th root of in the normal domain . That root is unique. Thus is unique.
Assume . For , its power belongs to and is integral over , because is finite over . Because is an integrally closed domain, . Thus
is a ring homomorphism, defining a morphism . Its composition with is the Absolute Frobenius morphism of , because the composite ring map sends to in .
These local morphisms glue. Explicitly, over a distinguished open , the ring rule is
so it is exactly the localization of . For the underlying topology, each fibre of consists of a single point: if primes contract to the same , then
so . The map sends that point of back to its unique point above it. Thus localization compatibility on a basis of a topology also gives compatibility on overlaps of arbitrary affine charts. We obtain
For uniqueness, is surjective on points, so the equation determines the point map of . On each affine chart it then requires . The inclusion is injective, so this determines uniquely as . Hence the sheaf map and the morphism are unique.
Yes. The same telescoping argument proves the counting lemma for octahedrally quasirandom three-uniform hypergraphs for every fixed simple three-uniform hypergraph .
Label its vertices of a hypergraph and give vertex of a hypergraph a nonempty host part . For each hypergraph edge , let be the corresponding host hypergraph edge indicator function of subset density , with . The normalized labelled hypergraph copy count is
If the host parts are disjoint, every such vertex of a hypergraph choice is automatically injective. Enumerate the hypergraph edges as and telescope
In the term for , fix all variables outside this triple. Since is simple and three-uniform, every other hypergraph edge intersects in at most two vertices of a hypergraph. Its remaining factor therefore depends on at most two of . Group all two-variable factors according to the pairs . Absorb each one-variable factor into any pair containing its variable, and constants into any group. The three resulting pair functions remain bounded by one.
The balanced factor is now multiplied by exactly the sort of pair functions handled in part (ii). Its average has absolute value at most , independently of the fixed outside variables. Averaging those variables and summing the errors gives
Equivalently,
This counts labelled copies preserving the specified vertex of a hypergraph classes, for arbitrary intersection patterns among the hypergraph edges, and includes the three-uniform tetrahedron as a special case.
For a common host vertex of a hypergraph set of size , the same product average counts homomorphisms. At most assignments identify a pair of distinct labelled vertices of a hypergraph, by the union bound. Thus restricting to injective copies changes the estimate by at most this amount. With a common normalized subset density the injective count is therefore . For induced copies, include the nonhypergraph edge indicator functions as additional factors; their balanced functions are negatives of the corresponding edge-balanced functions and have the same box norm. The same proof applies provided all the relevant triple parts satisfy the stated quasirandomness condition.
First prove the pair-factor correlation bound for the three-dimensional box norm. For real and three functions bounded in absolute value by one, let
Apply the Cauchy-Schwarz inequality in , placing the average inside and removing . This gives
Expand this square, with independent . Apply Cauchy-Schwarz in , removing the product . The result is
Expand with independent and apply Cauchy-Schwarz in , removing the four factors. Then
Therefore , with no independence assumption on the three pair functions.
In this multipartite hypergraph, a simplex is a three-uniform tetrahedron: one vertex of a hypergraph from each of , with all four possible triples present. Write the corresponding hypergraph edge indicator functions as , of subset densities . Its normalized count is
Telescope the product exactly:
For the first term fix . The remaining three factors are bounded pair functions of , and , so the inequality just proved bounds its average by . Averaging over preserves that bound. For each other term fix the vertex of a hypergraph outside its balanced triple and apply the same argument, allowing an unused pair factor to be identically one. The subset density prefactors are at most one. Hence
Multiplying by gives
Thus one may take the absolute constant . This proves the complete-pair-support case of the tetrahedron counting lemma directly; no lower bound on is needed.
Use octahedral quasirandomness of a three-uniform hypergraph, with its eighth-power normalization. Let be the hypergraph edge indicator function, define , and put . All expectations are uniform and independent on the indicated finite sets. The hypergraph is -quasirandom when
The eight triples form the faces of the tripartite octahedral configuration. Repeated choices within a part are included in this normalized average. For real , the expression is nonnegative, since it equals
Thus the condition says that the balanced hypergraph edge indicator function has three-dimensional box norm at most . If the norm itself is used as the quasirandomness parameter instead, the eighth-power parameter here is the eighth power of that parameter; stating this convention fixes the quantitative meaning of the counting error.
First derive the triangle removal lemma from the Szemerédi regularity lemma. Given an allowed deletion fraction , take , , and . Apply part (i), with upper class bound . Delete edges incident with , inside each nonexceptional class, between irregular pairs, and between regular pairs of subset density less than . Their total number is at most
These four terms are bounded respectively by , , , and .
If a triangle in a graph remains, its three vertices lie in three distinct equal classes, all three regular pairs with subset density at least . The permitted regular triangle counting lemma gives at least triangles in a graph in the original graph, where is the class size. This lower bound can also be checked directly: all but vertices of the first class have at least neighbors in each of the other two. Those neighborhoods are large enough to use the regular pair condition on the remaining pair, giving at least edges between them. Hence the total is at least .
Since , a surviving triangle in a graph forces at least original triangles in a graph. Thus a graph with fewer than triangles in a graph, where , can be made triangle-free by deleting fewer than edges, for all sufficiently large . This proves the removal lemma needed here.
Now use the triangle-removal proof of Roth theorem. Fix a subset density lower bound and suppose , , has no nonconstant three-term arithmetic progression. Set and . Use three disjoint copies of and put edges according to
Division by two is valid because is odd. A triangle in a graph corresponds to , , with and . Since and , this congruence is an integer equality. Progression-freeness therefore forces .
Every triangle in a graph is consequently of the form with , so there are exactly triangles in a graph. These triangles in a graph are edge-disjoint: an edge determines ; a edge determines and then ; and an edge determines and . Eliminating them all requires at least edge deletions.
The graph has vertices but only triangles in a graph. Take . For large enough its triangle in a graph count is below , so removal requires fewer than deletions. Yet
a contradiction. Therefore every fixed positive-density subset of a sufficiently long interval contains a nonconstant three-term arithmetic progression.
This proves the qualitative Roth theorem on three-term arithmetic progressions. The quantitative bound from part 2(i) came from the explicit Fourier iteration; the regularity-removal argument gives a density-dependent threshold without that double-logarithmic estimate.
For disjoint nonempty vertex sets , write . A regular pair of vertex sets is -regular if every with , satisfies .
The Szemerédi regularity lemma states that, for every and integer , there are such that every finite simple graph on vertices has a set partition
with , , , and at most irregular unordered pairs among the nonexceptional classes. Prove it for ; larger parameters follow by using a smaller one.
For the energy-increment proof of Szemerédi regularity, keep every exceptional vertex as a singleton cell in the set partition used to measure regularity energy. Define the equitable regularity energy
The sum is ordered, and on diagonal cells subset density means the average of the adjacency indicator, with zero on loops. Thus . If are refined into , expanding squares gives
The cross term vanishes because the weighted arithmetic mean of the refined subset densities is the original subset density. Consequently every refinement of a set partition increases or preserves regularity energy.
Suppose the current nonexceptional classes have common size and there are of them. For each irregular pair , choose witnesses of sizes at least and discrepancy greater than . Refine each class by all its incident witness subsets. There are at most cuts in each class and at most resulting atoms. The witness rectangle is a union of refined rectangles. By the Cauchy-Schwarz inequality, its contribution to the variance identity is at least
Indeed, the sum of squared deviations on the witness rectangle is at least its total weight times the square of their weighted arithmetic mean. If more than unordered pairs are irregular, summing even just one orientation of each gives
provided the exceptional set has at most vertices. This is the strictly positive regularity energy increment.
Restore equal class sizes without losing that increment. Divide every witness atom into blocks of size and make every leftover vertex an exceptional singleton. This is a further refinement of a set partition, so it cannot decrease . There are at most atoms, hence fewer than newly exceptional vertices. If , then , so the number of full blocks is at most . Each original class produces at least one full block: its leftovers occupy less than , whereas . Thus the new class count is at least .
Choose , and choose an initial integer large enough that . Initially partition into equal classes and fewer than exceptional vertices. Take large enough that this initial exception is at most . During at most rounds, the additional exception is at most , so it never exceeds .
A bound on class counts is obtained by iterating at most times starting at ; call the resulting bound . Increasing further to satisfy guarantees at every round, so all full-block constructions are valid. If the desired regularity had not been reached after refinements, the regularity energy increments would total more than one, impossible. Therefore the process terminates with the required partition and bounds. The singleton treatment of discarded vertices is what preserves regularity energy monotonicity during equalization.
Fix and write . Choose the permitted prime with . Part (ii) gives a subset of size at least and its cyclic group model . Thus
To apply the interval form of Roth theorem on three-term arithmetic progressions, represent in and split this interval into two consecutive intervals of length at most . One has at least points. After translation, this is an integer subset of an interval of length at most and subset density bounded below in terms of only. Pad the interval to length if necessary. If had no nonconstant three-term arithmetic progression, part (i) would give
Since with , this is impossible once is sufficiently large depending only on .
Thus contains distinct elements with modulo . Their distinct preimages satisfy in the integers by the Freiman 2-isomorphism. Reordering the endpoints if necessary gives
The required size threshold depends on the fixed constant ; it is not a claim uniform in an arbitrarily growing .
A Freiman 2-isomorphism is an injective map onto its image preserving pair-sum equality in both directions, with repeated summands allowed. Put , so , , and . We prove the half-size cyclic Freiman model with a sharp difference-set bound. Assume ; for an empty set the conclusion is immediate.
Choose an odd auxiliary prime large enough that reduction modulo is injective on and no nonzero element of reduces to zero. Choose a multiplier uniformly in . The forbidden residues are
They form a symmetric set, exclude zero since , and have cardinality at most . For each nonzero , the product is uniform on the nonzero residues. Moreover, is the same event as , so one need only sum over the opposite pairs. The union bound gives
Fix a multiplier avoiding all forbidden events. The use of opposite pairs is what achieves the threshold without an extra factor of two.
Represent each by an integer . Partition these residues into the two half-intervals
At least half of has representatives in one of them; call this subset . Both intervals have diameter less than , so for the integer
satisfies .
Define . If , then , hence and the image relation holds. Conversely, if the image relation holds, then . If the original difference were nonzero, would be nonzero; since , this would be a forbidden residue in . Thus .
Finally is injective. If , choose any and apply the converse to , obtaining . Therefore
The construction actually works for any integer ; the prime hypothesis in the question is sufficient.
A quantitative form of Roth theorem on three-term arithmetic progressions is: there is an absolute constant such that, for , every with no nonconstant three-term arithmetic progression satisfies
All logarithms below are natural. We prove the classical Roth bound for three-term progressions with an unoptimized . The empty set is immediate; write .
First establish a quantitative density increment. Suppose . Put , embed in , and extend all interval functions by zero. Let , and , the balanced subset indicator. Define
The relation in the sum is modulo . For interval elements its integer discrepancy has absolute value less than , so it is precisely the integer relation. Thus . The full interval count is the number of endpoint pairs of the same parity:
Consequently, since ,
Orthogonality of the additive characters gives
Both identities follow by expanding the sums and using for in , and zero otherwise; the latter follows from a finite geometric series. Since is odd, permutes the frequencies. Telescope the difference as
The Cauchy-Schwarz inequality and the displayed Parseval identity on a finite group bound each term by . Indeed, and , so every product of the two remaining L2 norms is at most . Hence
The zero coefficient vanishes because , so choose a nonzero frequency giving this bound.
Let . The pigeonhole principle applied to the fractional parts in intervals gives an integer with . Partition each residue class modulo in into consecutive arithmetic progressions of exactly
elements, leaving fewer than remainder points per residue. The total remainder has size at most . The size hypothesis gives . On a full arithmetic progression , the phase varies from its value at the first point by at most .
Let . Replacing the phase by its first value on each full arithmetic progression and estimating the remainder using gives
Also . Therefore the sum of the positive is
Since the total length of these arithmetic progressions is at most , at least one has . Thus the step just proved is
An affine map taking this arithmetic progression to preserves the absence of nonconstant three-term arithmetic progressions.
Now iterate. Write for successive lengths and subset densities, with and . Since every subset density is at most one,
Consequently successful steps are impossible. On the other hand, subset densities never decrease, so with ,
Suppose . Since ,
Let . We have . Therefore every length through step satisfies , and hence . The density increment lemma remains applicable for all steps, contradicting the reciprocal-density bound.
Thus , proving the boxed theorem. The proof includes the Fourier analysis on a finite abelian group detection, conversion to an integer arithmetic progression, and the length bookkeeping that produces the double logarithm.
Choose mutually inverse maps and . This is an extensional reflexive object in the Cartesian closed category. Define its application morphism
For endomorphisms , application in the underlying set is .
It is useful to define term interpretation uniformly over any context object . An environment assigns each free variable a morphism . Variables are interpreted by their assigned maps, and application is interpreted by and pairing. For lambda abstraction, lift the old environment along , interpret the new variable by , and let interpret the body. Then set
Taking gives interpretations in the requested set of endomorphisms. Other context objects are needed in the recursive definition to handle bound variables correctly.
The beta reduction rule follows from and the evaluation identity for currying. Applying the interpreted abstraction to a map gives
Induction on terms identifies this with interpretation of the capture-avoiding substitution of the argument for .
For eta conversion, suppose is not free in and write for the interpretation of . The body on is the uncurried form of . Hence
Thus beta-eta-equivalent terms have equal interpretations in . The full isomorphism, rather than just a retract of the function object, provides the inverse law used in the eta step.
Here a pointed complete partial order is a partially ordered set with a least element in which every nonempty directed set has a least upper bound. Directed means that every pair of its elements has an upper bound within that set. A Scott continuous map is monotone and preserves these directed suprema. It is not required to preserve the least element; restricting to strict maps would change the categorical claim. If completeness is instead formulated only for increasing countable chains, the same arguments below work with those chains.
Order the function space of complete partial orders pointwise: means for every . Its least element is the constant function with value . For a directed family of continuous maps, define . This is well-defined and is its pointwise least upper bound. It is monotone. For any directed ,
The interchange is valid because the combined family is directed, and either iterated supremum is its least upper bound. Thus is a Scott continuous map, proving that is a pointed complete partial order.
Finite products carry the product order, componentwise suprema and least element . The one-element order is a terminal object. For the exponential, use the function space with evaluation . To check joint continuity, take a directed family of pairs . Then
Indeed, directedness supplies a above the pairs indexed by both and , giving . Thus the diagonal values are cofinal in the double family, and evaluation preserves its supremum.
For a continuous , its currying is , . Each section is continuous because is; pointwise directed suprema in the coordinate show that is continuous. Conversely a continuous gives the continuous map . The two constructions are inverse, because they agree on every pair . This gives the natural bijection
with the required evaluation map. Together with the terminal object and products, it proves cartesian closure of pointed complete partial orders with non-strict continuous maps.
Keep the coordinates and operator from part (a). The attenuation is known, and the source is to be reconstructed. Put and . The directed forward attenuated Radon transform, for a detector at the positive end of the line, is
This weight accounts for absorption from each emission point to the detector. It is also derived by solving the real transport equation with zero incoming intensity: its outgoing limit is . In particular reversing the line direction generally changes the measurement. The pair reconstructs from full directed data and known ; it does not infer both unknown functions from the same data.
We must specify the sign convention for the projectors. Use the Hilbert transform and the signed Cauchy boundary operators
Then , and the positive idempotent projectors are and . This is the signed boundary-value convention in the given limits of . To express everything with ordinary complementary projectors, one may instead write , . The given limits become
Both depend on the transverse coordinate and direction but are constant along .
The equation supplies an integrating factor:
where is the inverse of unattenuated complex transport, normalized to vanish at spatial infinity. To see the normalization and analyticity rather than assume them, let . The complexified transport Cauchy kernel is
In the rotated coordinates, . The identity and the Jacobian prove with exactly this normalization. The denominator cannot vanish for nonzero real off the unit circle. The kernel is analytic separately inside and outside that circle, is at zero and at infinity. Thus and the displayed have the corresponding spectral behavior for the smooth decaying data. In particular at infinity and is bounded, indeed , at zero.
The limiting unattenuated inverse on any smooth decaying input is
One may verify this directly in the rotated Fourier variables: has multiplier , so its inverse has a pole at . As , the positive transverse frequencies have the negative tail primitive and the negative transverse frequencies have the positive past primitive; for these allocations reverse. Splitting with the Fourier projectors yields exactly the two formulas above. Applying them to reproduces the assumed limits of and checks the signs.
Now apply the same limiting inverse to . Because are independent of , its line integral is , while its tail is . Hence
The unknown incomplete line integral cancels in their difference. All remaining quantities are obtained from the measurements and known attenuation:
Each projection acts in at fixed , before evaluating and . Pulling a transverse-dependent exponential outside a projector would be incorrect.
The sectionally analytic therefore solves an additive Riemann-Hilbert problem on the counterclockwise unit circle, with the plus value inside. The normalized Cauchy integral formula is
The Sokhotski–Plemelj theorem gives its jump; boundedness at zero and decay at infinity make it unique by the Liouville theorem. Its expansion at infinity is
Substitute into the original equation. The part contributes at order one, the reciprocal derivative and vanish at that order. This derives the projection formula for inverse attenuated Radon transform:
Together with the boxed forward transform this is the requested pair. The derivation uses no small-attenuation approximation. For smooth compactly supported data the operations above are justified directly; sufficient integrable decay permits the same limiting construction.
As a normalization check, set . Then , and . Since the line transform is independent of and , the formula reduces to
the full-angle inverse Radon transform. For the radial Gaussian , and , so the reconstructed value at the origin is , checking the factor.
In single-photon emission computed tomography, represents the internal emission density, the known absorption coefficient and the directed detector counts. Each path integral weights a source point by its survival probability to the detector. Thus the attenuated Radon transform is the forward measurement model and its derived inverse reconstructs the emission distribution, providing the mathematical basis of SPECT.

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