Use the course convention that a root system is finite and is a reduced root system satisfying the crystallographic root system condition. These hypotheses are essential for the angle restriction. For roots , the two Cartan integers
satisfy . If are not parallel, the strict Cauchy-Schwarz inequality and integrality give . These values give angles , or , or , and or , respectively. If the roots are parallel, reducedness implies , giving or . Therefore
Here are examples accounting for every angle. In the A1 root system, the pairs and give . Two roots from different summands of give . The six unit vectors at angles form an A2 root system: taking one root at angle zero and another at or gives those two angles. In the B2 root system , pair with or to obtain . In a G2 root system, take short unit roots at angles and long roots of length at angles . A short root at zero paired with long roots at gives the remaining angles.
We construct a Hermitian hyperbolic plane over a finite field inside each successive two-dimensional piece. By the field norm surjectivity proved above, choose with . From two vectors in an orthonormal basis, form . Then , so is a nonzero isotropic vector. Nondegeneracy supplies with ; rescaling the second argument achieves this normalization. In fact already works in this two-dimensional piece. By quadratic finite-field norm and trace surjectivity, choose with and put . Direct expansion gives
Thus are linearly independent, and their Gram matrix is , which is invertible even in characteristic two. Their span is nondegenerate, so its orthogonal complement for a sesquilinear form is again nondegenerate. Repeat the construction there. In even dimension this exhausts ; in odd dimension the final one-dimensional complement has a nonzero diagonal value, which can be normalized to one using the field norm. Calling its vector , we obtain
with the terms present only in odd dimension. This proves all the requested pairings and the basis assertion.
The printed hint needs a qualification. If is irreducible over , its two roots are conjugate, so and ; the hinted vectors then do work. They need not work when it splits. For example, over its roots are , fixed by conjugation in . For either choice the proposed has norm , respectively or , rather than zero. The norm-and-trace construction above proves the assertion without that restriction.
Take to be linear in its first argument and conjugate-linear in its second, with . For a Hermitian form over a quadratic finite field, . We first establish the quadratic finite-field norm and trace surjectivity needed for orthonormalization of a finite-field Hermitian form. The field norm maps onto because the multiplicative group of a finite field is cyclic of order . The field trace is an -linear map into . It is nonzero: a nonzero polynomial of degree cannot vanish at all elements. It is therefore onto, including in characteristic two.
There must be with . Otherwise, for any , expanding the diagonal value gives
If , varying contradicts the surjectivity of the field trace. Thus all pairings would vanish, contrary to nondegeneracy. Choose with ; then has norm one. Every decomposes uniquely as
The restricted Hermitian form over a quadratic finite field on the orthogonal complement for a sesquilinear form is nondegenerate: a vector there orthogonal to that complement is also orthogonal to , hence to all of , and is zero. Induction produces an orthonormal basis .
The unitary group over a finite field is the group of invertible -linear maps preserving . In the orthonormal basis just constructed, its concise description is
The notation here uses the size of the matrix field; it is also frequently written . There is no determinant-one condition in this definition.
For , is not measurable with respect to the original Brownian filtration : its conditional variance is . Thus it is not even adapted on the full half-line. It also fails the martingale condition before time one. With , ,
The appropriate filtration is
Brownian independent increments make a continuous -martingale, with quadratic variation . Define the stochastic integral
The value of the integrand at zero is immaterial; it is square-integrable against the bracket because . Consequently , and the Lévy characterization of Brownian motion makes a -Brownian motion. Associativity of stochastic integrals gives the Brownian motion under a quadratic time change representation
The function is continuous at zero. One can first verify the inverse-integrand identity on and then let using the Itô isometry, since .
A simple example is
for a standard Brownian motion . The Itô formula gives , a continuous square-integrable martingale on every finite horizon. For , write , independent of the past and normal with variance . Then
Since , this conditional second moment is already a nonconstant function of the martingale's own past for . The tower property of conditional expectation gives the same expression on conditioning on that own past. Were the increments independent, that conditional second moment would be constant. Thus the increments are not independent.
The terminal bracket value printed as zero is incompatible with a strictly increasing bracket starting at zero. If the intended value is infinity, solution applies directly. In fact the substantive conclusion holds for every deterministic continuous bracket , whether its terminal value is finite or infinite, and without strict increase.
For , the Itô formula makes
a complex local martingale. Its modulus is the deterministic value , bounded on every finite horizon, so its real and imaginary parts are true martingales there. Conditioning between and gives
This deterministic conditional characteristic function shows that the increment is independent of and is normal with mean zero and variance . Induction over ordered times gives independent Gaussian increments and hence jointly Gaussian coordinate vectors. Since is finite at every finite time, the integrable terminal bracket criterion applied on each fixed horizon also upgrades to a true square-integrable martingale. This proves the deterministic quadratic variation characterizes a Gaussian continuous local martingale result in a form covering the corrected question.
Put . Its continuous, strictly increasing paths start at zero and tend to infinity. Thus the inverse is finite and continuous, and
so each is a stopping time. Set and . This is the inverse-clock construction in the Dambis-Dubins-Schwarz theorem.
To verify its martingale property, stop at times bounding its path, its bracket and time itself. The stopped and are bounded martingales. Optional sampling at and shows that the time-changed process, stopped at , is a martingale and that its square minus the stopped clock is a martingale. These clock stopping times tend to infinity because . Therefore is a continuous local martingale with and quadratic variation . The Lévy characterization of Brownian motion identifies it as a -Brownian motion.
Strict monotonicity and continuity give and , so
The inverse-clock argument proves the asserted representation; the random clock need not be independent of the Brownian motion it produces.
Use the Itô formula up to :
For fixed , the stopped stochastic integrand is bounded on each finite horizon, so its integral has expectation zero. The linear growth condition for an SDE and give
Writing , and bounding the active-time integrand by the stopped square, yields
The Gronwall inequality gives a bound independent of :
On , continuity gives . The Markov inequality therefore gives
Since , the event is the intersection of these decreasing events and has probability zero. Taking integer proves almost surely. This proves global existence with locally, rather than globally, Lipschitz coefficients under the stated growth bound.
The existence and pathwise uniqueness theorem for a stochastic differential equation states that locally Lipschitz drift and diffusion on an open domain give a pathwise unique strong solution of a stochastic differential equation up to a maximal lifetime . The initial value is measurable with respect to the initial sigma-algebra, and the filtration satisfies the usual conditions for a filtration. On , if are exits from increasing balls, then ; a finite lifetime entails escape from every compact subset. The coefficients need not satisfy a global growth bound for this local result.
One construction truncates the coefficients outside each compact region to globally Lipschitz coefficients, solves the resulting global equations, and patches their solutions until the exits. Pathwise uniqueness makes solutions from larger truncations agree on the smaller stopped interval. Their union is the maximal local solution of a stochastic differential equation, and any extension would contradict the exhaustion of the domain by the exit times.
For the integrable terminal bracket criterion, assume , or more generally . This initial-value assumption is necessary if it is not already part of the notation: an integrable but non-square-integrable random constant process has zero quadratic variation and still fails square-integrability.
For the zero-starting case, choose a localizing sequence bounding both and its quadratic variation. The stopped processes are true square-integrable martingales, and the Itô isometry gives
For each fixed time these variables are uniformly integrable by their bounded second moments. Almost sure convergence as is therefore convergence in . Passing to the limit in the stopped conditional-expectation identity gives : the local martingale is a true martingale. The Fatou lemma also gives
so belongs to the global space. For general square-integrable , apply this argument to and use .
Take a standard Brownian motion and define
The Itô formula gives , so both are continuous martingales starting at zero. Their second moments are and , making them L2-bounded continuous martingales. At equal times, the odd moments of a centered normal random variable vanish, so
They are consequently weakly orthogonal continuous martingales by solution.
Their product, for , is . The Itô formula gives
The continuous finite-variation term is not identically zero: it has variance at every . Uniqueness of the continuous semimartingale decomposition therefore shows that is not even a local martingale. Equivalently is not zero, so the pair is not orthogonal continuous local martingales.
For a stopping time , optional sampling for gives , hence
This is justified by truncation and the Cauchy-Schwarz inequality, as in solution. If is a martingale, bounded optional sampling gives , proving the required condition.
Conversely suppose the required condition holds. Every bounded stopping time lies below some deterministic , so the displayed identity gives . The product is continuous and adapted, and its stopped values are integrable: the Doob L2 maximal inequality bounds the product of the two path suprema in by the Cauchy-Schwarz inequality. The characterization of a martingale by bounded continuous-time stopped expectations therefore makes a martingale. Thus orthogonality is equivalent to the backward-stopping expectation test. In contrast to weakly orthogonal continuous martingales, this tests the product at random times, not only deterministic times.
The endpoint value printed in this part is erroneous. The correct conclusion is
Already gives convergence in probability to zero and rules out an almost sure limit of one.
To prove the stronger endpoint convergence, use time reversal of a Brownian bridge. Set , including . Both and are centered Gaussian processes, and for ,
They therefore have the same finite-dimensional distributions. The path of is continuous at zero, since its stochastic integral is continuous there. In particular its values at positive rational times tend to zero at zero with probability one. Equality of the laws on the countable rational coordinates transfers this event to . The path of is continuous at every time in , so its supremum on any interval bounded away from zero is determined by rational times. The rational endpoint condition consequently implies as along all real times. Hence as , and setting gives a continuous version on the whole closed interval. This proof uses equality of coordinate laws, without assuming terminal continuity in advance.
For times and real coefficients , the linear combination of coordinates is
The Gaussianity of deterministic Brownian stochastic integrals makes this a centered normal random variable. Indeed step-function approximations give linear combinations of independent normal increments, and the Itô isometry gives convergence in ; their characteristic functions converge to that of a normal variable with the limiting variance. Since every linear combination is normal, the coordinate vector is a Gaussian random vector. Appending the deterministic coordinate preserves that property, so is a centered Gaussian process on .
For , the covariance version of the Itô isometry gives
At the covariance is zero because , agreeing with the formula. Thus the Brownian bridge covariance kernel is
Its finite-dimensional distributions identify it as a Brownian bridge; continuity at the terminal endpoint is established next.
Write for the driving Brownian motion throughout; the two symbols in the displayed formulas refer to the same process. For the deterministic integrand is square-integrable on , so
is well defined. The Itô product rule, with zero quadratic covariation against the deterministic factor, gives
For the other form, apply the same Itô product rule to :
Multiplying by gives the stochastic integral representation of a Brownian bridge
The drift coefficient is singular only at the terminal endpoint, so this calculation is performed on compact subintervals of .
Let , and write for any odd-weight word . The parity functional on the four-dimensional binary linear code is nonzero, so its kernel has dimension three and its other fibre is the coset . For example belongs to the standard length-seven Hamming code and has odd Hamming weight. Denote the two logical basis states by and , corresponding to these two cosets. The eight computational orthonormal basis vectors in each sum are distinct, so both logical states have norm one; their disjoint supports make them orthogonal.
For a binary vector , define the product of Pauli Z gates
where the dot product is computed modulo two. The key diagonal overlap, with and , is
If , every summand is one. If , choose with . Translation permutes and negates every summand. The sum must then be zero. Thus
Off-diagonal logical overlaps vanish for every :
because a diagonal Pauli operator cannot move a computational basis word from one coset to the disjoint other coset.
The possible errors are and for . Set . Each phase flip is its own adjoint and inverse, so
If , the vector is nonzero and has Hamming weight one or two. By the given dual code identity and the minimum Hamming distance three of the Hamming code, it cannot belong to . Hence all its diagonal logical overlaps vanish. If , the product is the identity and its logical overlaps are . Combining both cases gives
This proves the Knill--Laflamme condition with an identity error-overlap matrix, not merely a possibly degenerate scalar matrix. In particular the eight two-dimensional error subspaces are mutually orthogonal. This is precisely nondegenerate phase-flip correction in the Steane code.
To exhibit recovery rather than only the criterion, let be the orthogonal projector onto the code and . The projective measurement consisting of these eight mutually orthogonal projectors, completed by , determines which error occurred. For an arbitrary encoded pure state affected by , outcome occurs with certainty and leaves unchanged. Applying again recovers . The outcome gives the error syndrome and does not reveal or , so recovery preserves logical quantum superpositions.
An equivalent explicit error syndrome uses three commuting X-type stabilizer generators. Choose a parity-check matrix for with the seven different nonzero binary columns:
Its rows span . For a row , the operator permutes each of and , and therefore has eigenvalue on both logical states. A phase flip at position changes its eigenvalue to , since . Measuring the three commuting stabilizer generators gives the th column of as a binary syndrome; no error gives the zero column. All eight outcomes are different, and applying the identified restores the code state. Measuring these stabilizer generators never distinguishes the two logical states.
Finally, if a noise Kraus operator is a coherent linear combination , the same syndrome measurement separates its mutually orthogonal components . Conditional recovery returns in every nonzero branch. Linearity then also corrects any quantum channel whose Kraus operators lie in this span. The argument therefore corrects arbitrary unknown single-site phase flips nondegenerately, including coherent phase-error amplitudes, rather than only a known error on a basis codeword.

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