How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
A systematic Gaussian Gibbs sweep need not be reversible
Example
Assume AC and take in Full conditionals for a bivariate normal target. Initialize and use the systematic order then . The resulting full-sweep kernel preserves but is not reversible with respect to it.
Facts & Assumptions
Given: AC, the bivariate normal target, and the systematic update order in the Example.
AC is inherited from the cited normal conditional-density convention. The Axiom of Choice.
The full conditionals are and for every conditioning value. Full conditionals for a bivariate normal target.
A systematic full sweep of exact Gibbs updates leaves invariant. A systematic Gibbs sweep preserves the target.
Reversibility means symmetry of the two-time transition flow on every measurable rectangle. Reversibility for a probability kernel.
For square-integrable real random variables, covariance is and is bilinear when the terms are integrable. Moments, variance, and covariance on a probability space.
A target probability and transition kernel define the joint law of one transition with the corresponding iterated-integral identity. A prior and model kernel define a joint law.
A systematic scan in the order then has chronological kernel composition . Composition of probability kernels.
Finite measures agreeing on the generating rectangles agree on the product sigma-algebra. Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system.
A multivariate normal law has the specified mean vector and covariance matrix. Multivariate normal law, including singular covariance.
Verification
Given: The hypotheses in the Example and facts [A1], [F1]–[F7].
The conditional means in [F1], integrated in the order [F6] under the joint law [F5], give and . By [F8], the initial target has and . The first conditional variance in [F1] gives , so . The invariant full-sweep law [F2] gives , hence . Thus all four coordinates are square-integrable, and their cross-products are integrable by .
The means in step 1.1 are zero, so [F4] makes each cross-covariance equal to its product expectation. Using the kernel order [F6], the first conditional mean in [F1], and [F8], . For the other cross term, the second conditional mean followed by the first gives . The integrability established in step 1.1 justifies these signed iterated integrals.
If the full-sweep kernel were reversible, [F3] would give equality of its two-time law and the state-swapped measure on every rectangle. Both are finite measures, so [F7] gives equality on the product sigma-algebra. The integrable function would then have the same integral as its state-swapped version , forcing because all four coordinates are centered. But [F8] and step 2.1 give these covariances as and , which differ for . Hence the full-sweep kernel is not reversible, although [F2] proves it preserves .
Depends on
- Full conditionals for a bivariate normal target
- A systematic Gibbs sweep preserves the target
- Reversibility for a probability kernel
- Moments, variance, and covariance on a probability space
- The Axiom of Choice
- Composition of probability kernels
- A prior and model kernel define a joint law
- Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system
- Multivariate normal law, including singular covariance
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Art B. Owen, Monte Carlo Theory, Methods and Examples, Chapter 12 (standard reference, not scraped)
- Gareth O. Roberts and Jeffrey S. Rosenthal, General State Space Markov Chains and MCMC Algorithms (standard reference, not scraped)