The local Harnack inequality for harmonic functions states that if is harmonic on a neighbourhood of , then
More generally, for any compact in a connected open domain , there is such that for every nonnegative harmonic on . Positivity is essential; the assertion is not for arbitrary sign-changing functions.
First prove the mean value property for harmonic functions. For a smooth harmonic function the spherical mean has derivative
so it equals ; integration in the radius gives the ball mean property. The preceding Weyl lemma supplies smoothness if harmonicity was initially distributional.
For the inclusion and nonnegativity give
Taking the supremum over and the infimum over proves the local estimate directly. To obtain the compact-set form, connect centres of a finite ball cover of to a fixed interior point by paths in . The compact union of those paths stays a positive distance from the complement of . Subdivide the paths into finitely many steps small enough that the local estimate applies at consecutive points. Multiply the finitely many comparison constants, first from one point of to the reference point and then to any other point of . This gives a constant independent of . In particular a nonnegative harmonic function is either everywhere positive or identically zero on each connected component.
The strong maximum principle for subharmonic functions is: on a connected open domain, the canonical upper semicontinuous representative of a subharmonic function cannot attain a finite global maximum at an interior point unless it is constant. A local maximum instead forces constancy on an appropriate neighbourhood; it alone does not assert constancy on the whole domain unless that value is a global maximum.
Suppose on and . For every sufficiently small ball centred at , the subharmonic mean inequality gives
The nonnegative function has integral zero, so almost everywhere on that ball. Its canonical representative is then at every point of the ball, by taking still smaller local averages.
The maximum set is consequently open by the same argument at each of its points. It is closed relative to , because upper semicontinuity makes its complement open. It is nonempty, and connectedness gives . Therefore . This proves the principle, including its representative and connectedness hypotheses. Arbitrary representatives do not satisfy it: the function equal to zero almost everywhere but assigned value one at the origin has zero distributional Laplacian and an artificial pointwise maximum.
For a real locally integrable function, the definitions are distributional:
Thus the Laplacian is respectively a positive distribution, a negative distribution, or zero. A superharmonic function is the negative of a subharmonic function; being both is equivalent to being harmonic. For a function these conditions are , , and pointwise.
An equivalence class does not itself specify point values. For the maximum principle use the canonical representative of a subharmonic distribution
These normalized integrals are ball averages. To justify this construction, first mollify : its smooth local regularizations satisfy . For any smooth subharmonic function, the spherical mean obeys
This follows by differentiating the spherical integral and applying the divergence theorem. Its ball mean also increases with radius: its derivative is times the spherical mean minus the ball mean. Local convergence of the regularizations passes the monotonicity of the ball means to . The decreasing-radius limit therefore exists, possibly as minus infinity at an exceptional point, and equals almost everywhere by the Lebesgue differentiation theorem. It is upper semicontinuous as the local infimum of continuous ball averages and satisfies
For a superharmonic function use the corresponding lower semicontinuous representative and reverse the inequality.
For a distributionally harmonic function, the smooth regularizations are harmonic and have constant spherical means. A radial mollifier of integral one therefore reproduces them by averaging these means. At fixed interior radius , pass to the local limit to obtain almost everywhere on a smaller region. The right side is smooth and has zero distributional Laplacian, giving the smooth harmonic representative. This proves the relevant Weyl lemma. Changing a value at a single point can spoil a pointwise maximum principle, so the representative convention is essential.
For every compactly supported smooth test function , integration by parts in the definition of the weak derivative gives
Both and belong to , so the assumed weak limits imply
This is exactly the distributional characterization of . Since are all in , the defining condition of the H1 space is satisfied. Thus
For complex functions the same argument uses conjugated test functions in the pairing. No prior identification of an weak limit is needed.
Let be a test function supported in . Symmetric cancellation gives
The integrand is bounded by , so the limit exists and
This is a continuous linear functional on every fixed-support test space, hence a distribution. It also specifies its local order as at most one.
For the boundary value, split the ordinary complex denominator:
The real part paired with is
It converges to the principal value by dominated convergence theorem, using the same bound . In the second part set :
Here is an integrable majorant. The correct Sokhotski–Plemelj formula is therefore
The resulting functional is continuous, with bound , so it too is a distribution.
The printed PDF has the wrong sign on its delta term. For a real even nonnegative test function with , the principal value is zero while the imaginary part of every regularized integral is negative. Its limit is , disproving the printed plus sign directly. A plus sign instead belongs to the boundary value .
For a bounded connected domain with the interior cone property, and , the mean-zero form of the Poincaré inequality is
No zero boundary trace is imposed. Subtracting the mean is essential because nonzero constants have zero gradient.
Suppose the estimate failed. Subtract means and normalize to obtain with
This sequence is bounded in the Sobolev space . The allowed Rellich-Kondrachov compactness theorem on cone domains provides a subsequence converging strongly in to . Its mean is zero and its norm is one. For any compactly supported smooth test function ,
Thus every weak derivative of vanishes. To show this implies constancy, mollify on any ball compactly contained in . The resulting smooth function has zero gradient and is constant on the smaller ball. Passing to its limit makes constant almost everywhere on that ball. Overlapping balls have the same constant, and connectedness connects any two points by a chain of such balls. Hence is constant almost everywhere throughout . Its zero mean makes it zero, contradicting norm one. This proves the stated Poincaré inequality. The frequently used stronger Sobolev-Poincare formulation also follows: with , the cone-domain Sobolev embedding theorem gives . Insert and the estimate just proved to obtain
Thus both the same-exponent and critical-exponent mean-zero versions are covered. Connectedness cannot be dropped without subtracting a separate mean on every component. The usual meaning of the stated range is ; with is not part of this Sobolev-space formulation.
As usual, the bounded set is assumed Lebesgue measurable and an exponent is positive; the conventional Banach-space assertion concerns . No boundary regularity of is needed. Choose a smooth compactly supported cutoff equal to one on a ball containing . Weak convergence and the Uniform boundedness principle give a common bound for , hence also for . These functions have a common compact support.
We prove their local compactness directly. Translation and the fundamental theorem along line segments give, by density from smooth functions,
For a compactly supported mollifier , integration of this estimate gives
At fixed , Hölder's inequality bounds and uniformly by the norm of the corresponding smoothing kernels. Their supports lie in one fixed compact set, so the Arzelà-Ascoli theorem makes this smoothed family precompact in . The uniform approximation makes the original family totally bounded in : choose a finite net for the smoothed family and add the approximation error. Completeness gives relative compactness.
Every strongly convergent subsequence of has limit , since multiplication by preserves weak convergence. Consequently the whole sequence converges strongly: otherwise a subsequence with distance at least a fixed positive number would have a further convergent subsequence and contradict that unique limit. In particular .
The critical Sobolev inequality supplies a uniform bound in . For clarity, this estimate follows from part 2(a), not from compactness at the critical exponent. For a compactly supported smooth , integrating by parts against the vector field gives
Its distributional divergence is the sphere-area multiple of a point mass; applying the Hardy–Littlewood–Sobolev inequality with yields . Density extends this to .
For choose with . Hölder's inequality gives
For , use . The same integral estimate also works for if is understood with its usual quasi-norm. Thus strongly for every positive . We have never asserted that multiplying by the possibly nonsmooth indicator preserves .
Write and . The exponent on the finite-set expression is in the PDF; the TeX aid drops its prime. Ignore zero-measure sets, whose integrals vanish. The equivalence is
For the first bound, let and choose a finite-measure subset . Since ,
Exhaust by its intersections with bounded balls. If its measure is finite these give the desired bound in the limit; if it is infinite they force . Now take the supremum over .
For the other direction it suffices to assume ; the zero and infinite cases are immediate. For a set with , the layer cake representation gives
Split at . The first contribution is , and the second is . Their sum is . Multiply by and take the supremum. This proves the equivalence even when the quantities are extended-valued. The integral expression is an actual norm on the weak Lq space, since the triangle inequality holds inside every set integral. The distribution-function expression is generally a quasi-norm. The factor is sharp: on has and attains on every initial interval. In higher dimensions, multiply this example by the indicator of a unit box in the remaining coordinates.
One potential form of the Hardy–Littlewood–Sobolev inequality is: if , , and , then
A normalization constant for the Riesz potential only changes . Equivalently, for , and ,
The exponent relation is necessary under dilation. We prove the potential estimate and then derive the bilinear version.
First establish the needed maximal estimate, so it is not an unproved step in the argument. Define the centered Hardy-Littlewood maximal function by . For integrable , cover a compact subset of by finitely many balls whose averages exceed . Order these balls by decreasing radius and greedily retain a ball if it is disjoint from those already retained. Every discarded ball intersects a retained ball of at least its radius, so lies in its triple. Hence
The passage from compact subsets uses inner regularity of Lebesgue measure; the superlevel set is open because fixed-radius local averages are continuous. For , split . The second summand's maximal function is at most , and the first is integrable. Therefore
The layer cake representation and Tonelli theorem give
Thus the Strong Lp bound for the Hardy-Littlewood maximal function is proved for every .
For , split at radius . Dyadic shells with radii give
For the outer part, Hölder's inequality gives
The last integral is finite exactly because . Balance the two bounds by to obtain the Hedberg inequality
The zero cases follow directly or by a limit; is finite almost everywhere by the maximal estimate. Since , integration and the proved maximal bound yield . Taking and pairing with proves the bilinear form by Hölder's inequality, because . All integrals are justified first for nonnegative truncations and then by monotone convergence and the resulting finite bound. The strong estimate does not include or .
The assertion that fails is weak compactness of the unit ball; the abstract Banach-Alaoglu theorem for dual balls never fails. Consider the concentration prevents weak compactness in L1 example
Suppose a subsequence converged weakly in to . For each , all sufficiently late supports lie inside . Testing against every bounded measurable function supported outside that ball shows that almost everywhere there. Taking the countable union over proves almost everywhere on . But testing against the bounded constant function one gives , a contradiction.
The same argument applies to every subnet whose indices tend to infinity, so the sequence has no weak cluster point in the ball and the ball is not weakly compact. It converges against smooth compactly supported tests to a point mass, which is not an density. Thus boundedness in does not imply the weak compactness proved in part (b); concentration is the obstruction.
The relevant Banach-Alaoglu theorem says that for the closed bounded balls of are compact in the weak topology. In particular, every bounded sequence has a weakly convergent subsequence whose limit has norm no larger than the common bound. Applying the preceding duality of Lp spaces also identifies this as weak-star compactness of ; its weak and weak-star test spaces are both .
Here is a direct proof of both compactness and the subsequence assertion. Let and choose a countable dense set in the separable Lp space . Each scalar sequence is bounded. Successive subsequence selection followed by the diagonal subsequence argument gives for which these pairings converge for every . For arbitrary ,
First approximate by and then take large. This proves convergence of every pairing, and the limit is linear with . Apply the already proved duality of Lp spaces with in place of : for an with . Thus
To obtain compactness rather than only a sequential statement, on the radius- ball define
Density and Hölder's inequality show that this is a metric space distance and that its topology is exactly the weak topology on this ball: every remaining test pairing is uniformly approximated there by a dense-set pairing. The subsequence argument proves sequential compactness for this metric. A sequentially compact metric space is compact: otherwise either an infinite separated sequence contradicts total boundedness or a Cauchy sequence without a limit contradicts sequential compactness; completeness and total boundedness give compactness by successive finite coverings. This completes the proof. The same argument is the Sequential Banach-Alaoglu theorem for a separable predual.
Use the bilinear pairing , so the map is complex linear. With the sesquilinear convention the representing map would instead be conjugate linear. For conjugate exponents , Hölder's inequality gives . If , take , defined as zero where . Then
Consequently . This also proves injectivity of the representation.
For surjectivity, let be a nonzero element of the continuous dual space of and choose with . Its kernel is a closed linear subspace. Use the allowed best-approximation fact to choose and put . Thus and
For each , the vector belongs to . Therefore , giving
Membership follows from ; the zero functional is represented by zero. This proves the isometric isomorphism without using a representation theorem as a substitute for the proof. It is the closed-hyperplane proof of Lp duality.
Write the normalized qubit as , with . Only the amplitude changes between the two phase gates, so
Since ,
The phase-gate discretization error is uniform over all input states; its exact operator norm is . To choose an approximating gate, round to the nearest integer and reduce it modulo . Taking the shortest circular angle difference gives , and hence a uniform state-vector error at most . The circular choice handles the identified endpoints and correctly.
The eigenvalue on of every power is one, and its eigenvalue on is . Thus
If is odd, its greatest common divisor with is one. Divisibility can therefore be cancelled, giving
In particular, the powers with are distinct. Each is the phase gate with , and multiplication by is a permutation of these residue classes. Equivalently, for any desired , choose , where is the modular inverse. Then , using the representative and repeated forward applications only. Thus the powers generate the entire set. Once the preceding identification procedure has found , these powers can also be labelled and selected classically.
The inverse quantum Fourier transform in the original PDF has matrix elements multiplying . The converted TeX incorrectly repeats in the bra; using the actual PDF operator,
If , every summand of the inner sum is one, so it equals . If , let . Then and , and the finite geometric series gives . This is orthogonality of roots of unity. Hence
A quantum measurement in the computational basis consequently returns the integer with probability one.
Put and label the binary digits of by , with . The Walsh-Hadamard transform prepares the uniform quantum superposition . Applying the phase gate to the qubit for digit multiplies its basis amplitude by . Taking their product gives
With the most significant qubit written first, this proves
Each power is implemented by repeated uses of the supplied gate. The total is uses. This realizes dyadic phase-gate identification without needing an unknown controlled gate or asserting a gate-call cost polynomial in .
Use phase-flip protection by Hadamard conjugation. Insert a Hadamard gate on each of the three data wires immediately after the two encoding CNOTs and before the physical error. Insert another Hadamard on each data wire immediately after the error and before syndrome detection. Leave the two syndrome ancillas and every detection, recovery and decoding gate unchanged.
The first layer changes the encoded state to , the three-qubit phase-flip repetition code. The two layers surrounding the error turn the effective error seen by the old circuit into
Since and , the four physical cases become respectively . The original coherent syndrome and recovery circuit corrects all four, as its syndrome table shows. Thus two Hadamard layers on the three data wires, straddling the error, give the required phase-flip protection. The final top wire is the original , not , because the second layer returns the data to the original coding basis before recovery and decoding.
The point needing proof is that a corrected error's residual state cannot retain dependence on the logical input. Let denote the complete linear map from the logical input to all five output wires for error . Protection gives and . Applying protection to and comparing its two top-qubit components yields
so . Denote the common vector by . Linearity then gives for every input.
The encoding and all operations surrounding the error are fixed. Replacing the error by consequently replaces the overall map by , giving
Because and the surrounding circuit are unitary, the output is normalized for every normalized input; the residual vector in parentheses thus has norm one. This proves linearity of coherent quantum error correction and hence protection against . Orthogonality of and is not required for this proof.
Use the Hadamard gate identity on the first data wire. The branch is corrected as above and has syndrome . The branch changes the encoded state to , with syndrome . No bit-flip recovery is triggered, and decoding leaves on the top wire.
By linearity of the full quantum circuit, its output for is therefore
where the four-bit strings are ordered as wires . The two syndrome states are orthogonal. Taking their partial trace removes the cross terms, so the reduced density matrix is
The top output undergoes a completely dephasing channel in the computational basis. The bit-flip component is corrected, but the undetected phase component destroys logical coherence after the syndrome is ignored.
Number the wires from top to bottom as . The first two controlled-NOT gates encode into the bit-flip repetition code
on data wires . The lower two zero ancillas store an error syndrome. Reading the PDF's four detection CNOTs gives
The syndrome and the data qubit to be flipped are therefore
This is coherent syndrome extraction for the three-qubit repetition code. The recovery Toffoli gates implement these conditions; the intervening Pauli X gates temporarily turn zero-valued controls into one-valued controls and then restore the syndrome wires. Finally, inverse encoding returns the logical state to the top wire and resets data wires 2 and 3 to zero.
For the specified error , the encoded data becomes . Both terms have syndrome , so detection factors out without revealing the logical amplitudes. Recovery flips data wire 1, restoring , and decoding yields
The lower four wires need not all return to zero: their syndrome record is independent of the logical state, which is what the correction requirement needs.

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