Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
A Picard iterate is one of the successive approximate solutions of a differential equation obtained by repeatedly applying its integral solution operator. If and , the usual operator is . An integrating factor can produce a different, equivalent operator with better estimates, as in Global Picard iteration with a decaying kernel. The word iterate denotes an approximate function; Picard iteration denotes the procedure.
Consider the Volterra integral equationwhere is continuous, , , and the continuous kernel satisfies for , with . If , there is exactly one continuous solution on the whole half-line. It is bounded, and Picard iteration beginning at converges in supremum norm with contraction ratio at most .
For a proof, the integral of the kernel is at most . Thus maps the closed ball of radius in the Banach space of bounded continuous functions into itself, since . Factoring gives on this ball. The contraction mapping theorem gives its unique fixed point. A first-exit argument shows that every continuous solution, even one not initially assumed bounded, stays strictly inside the same ball: a first time with would contradict . Reapplying the estimate gives the strict global bound , so uniqueness is unrestricted within the continuous solution class. If , zero is the only solution by the Gronwall inequality on each finite interval.
For Picard iteration , , assume and a Lipschitz constant on a rectangle containing every iterate. The first difference is at most . Integrating the preceding bound multiplied by proves the displayed estimate by mathematical induction. Its uniform bounds sum to a convergent exponential series for every finite , so the Weierstrass M-test gives uniform convergence without requiring .
For two arbitrary initial functions in a function set preserved by the Picard iteration operator , the same induction givesThus some iterate is a contraction mapping on any fixed finite interval for which every iterate stays in that set. The iterated contraction argument gives a unique fixed point of on a nonempty complete metric space, without requiring . For a rectangle with field bound and vertical radius , supplies the required self-mapping property.
For a source with exactly two photons in each input arm, let be the probability of one horizontal and one vertical photon in the trigger arm. This sector alone supplies exactly one trigger photon. Splitting the other arm across its two output ports has probability ; the final polarizing beam splitter selects equal polarizations with probability . The fourfold success probability is therefore . The two-pair component of polarization-entangled down-conversion has , giving ; independent pair bookkeeping has , giving . Pair-label distinguishability can also destroy the conditional GHZ state coherence and must be checked separately.
The 1999 experiment used an approximately , pump pulse and a beta barium borate crystal. Two polarization-entangled photon pairs supplied four photons. A trigger and three other photodetectors selected a GHZ state through fourfold coincidence counting. Narrow interference filters lengthened the photon coherence time to approximately , exceeding the pump duration and suppressing timing information about which pair supplied which photon. The optical mode matching was essential to coherence, not merely to routing photons.[ref]
Observation of Three-Photon Greenberger-Horne-Zeilinger Entanglement by Dik Bouwmeester and others. Printed pp. 1346–1347, figure 1 and equations (1)–(10): pump, filters, indistinguishable alternatives and coincidence conditioning
The observed state was selected by all four detections, which also measured the photons. A trigger alone did not demonstrate a guaranteed surviving three-photon output. This distinction connects postselection to what an apparatus actually supplies, rather than identifying a fourfold coincidence with an unconditional source.[ref]
Observation of Three-Photon Greenberger-Horne-Zeilinger Entanglement by Dik Bouwmeester and others. Printed p. 1345, paragraph beginning “The main idea”: explicit requirement that both trigger and three output photons be detected
For one unit-charge Dirac field in , define the insertion as . The one-loop ultraviolet pole is . The Ward identity cancels any apparent divergent vector mass term. With photon counterterm insertion , this gives in the minimal subtraction scheme.
The allowed phonon energies, including their wavevector, branch and phonon polarization labels when resolved. A phonon dispersion relation records the branch-resolved spectrum, whereas the phonon density of states sums over those labels.
An internal harmonic vibration spectrum with lowest positive frequency has the displayed low-temperature thermal phonon population, where is its degeneracy. The continuum bulk law fails when thermally occupied wavelengths reach the sample size. Mechanical boundary conditions determine ; rigid translation of the entire solid is not an internal phonon mode.
The proposal that phonological work benefits reading most when linked to reading instruction. A matched-group intervention found greater reading progress for integrated work, even though phonology-only work particularly improved phonological tasks.[ref]
Ameliorating Early Reading Failure by Integrating the Teaching of Reading and Phonological Skills: The Phonological Linkage Hypothesis by Peter J. Hatcher and others. Child Development 65, 41–57; matched groups of seven-year-old poor readers, reading/phonology/combined/control conditions
For a differentiable dispersion relation and nonzero wavenumber , group velocity equals phase velocity precisely where . Equality at an isolated stationary point of does not establish a nondispersive branch. For a gravity-capillary wave, the equality occurs at and the phase-speed minimum, even though the relation is dispersive elsewhere.
An unrestricted Boolean function on inputs cannot be classified as constant or nonconstant with certainty using a single phase oracle query, even with quantum ancillas. Write a purified query input as with and . The zero constant function leaves it unchanged; the function supported only at produces a vector with inner product with it. Perfect discrimination of pure states requires orthogonality, forcing for all and thus , a contradiction. This is an exact quantum query complexity obstruction for all nonconstant inputs, rather than the restricted promise used by the Deutsch-Jozsa algorithm.
For the perpetual American call option model and a fixed exercise threshold , this is the discounted expectation of at its first hit, with zero payoff if the hit never occurs. The stationary ordinary differential equation and boundary conditions , prove the formula. At fixed , differentiation gives , so the unique maximizing threshold is . If a larger threshold is imposed, and its value lies below immediate exercise payoff just below . This is allowed for a committed policy, but violates the exercise lower bound if quoted for an unrestricted American call option.
The historical study of permutations of letters or quantities and their compositions, closely connected with the development of group theory and the theory of polynomial equations.
A disjoint cycle decomposition writes a permutation as a product of disjoint permutation cycles. Repeatedly apply the permutation to a point until it returns to that point; these successive points form one cycle. Repeat on points not yet used. Finiteness and injectivity ensure that each process returns to its starting point. This partitions the underlying finite set into cycles. The decomposition is unique up to reordering the cycles, cyclically rotating the entries within each cycle, and optionally omitting fixed-point one-cycles. Include the one-cycles when specifying cycle type.
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!
Intro to OurBigBook
. Source. We have two killer features:
- 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-calculusArticles 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/derivativeVideo 2. OurBigBook Web topics demo. Source. - 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.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.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. - Infinitely deep tables of contents:
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





