A finite-horizon form of Girsanov theorem is as follows. If is predictable, almost surely, and its stochastic exponential is a true martingale of mean one, then under the probability the processis Brownian motion. The same conclusion holds on the completed natural filtration, since a strictly positive density gives equivalent probabilities.
Part (b) establishes precisely the required density martingale and integrand . ThereforeIn particular it is the requested local martingale. Equivalently, under , solves , the Brownian bridge drift coefficient toward at time one. Keeping avoids the singular endpoint in this density change.
Take and let be the first time hits . Reflect the horizontal coordinate after , leaving the vertical coordinate unchanged. The Strong Markov property and symmetry preserve the law of planar Brownian motion and leave its real-axis exit time unchanged. On paths with , the reflection swaps the two terminal events and . There is no terminal atom at . Hence the Brownian reflection principle givesHorizontal symmetry gives the same probability for . A union bound therefore yieldsAlso , whose Cauchy distribution is . Thus the maximum tail is bounded above and below by positive constants times for large . The tail integral formula for moments for positive moments givesThe large- integral is finite exactly when ; it diverges for . Near zero its upper bound by is finite.
The vertical coordinate remains nonnegative up to exit and starts at one. The strip calculation, now with upper boundary , givesThus has density on , and in factFor completeness, if the source's includes negative powers, also has all negative moments. Let be the first horizontal exit from . ThenThe first bound follows from the Gaussian reflection bound for the vertical hit of zero; the second follows by splitting time into blocks of length , each having a fixed positive chance of exiting the horizontal interval. This small-value estimate integrates against every negative power. At both moments equal one.
For , write with . The chosen power map sends this to , soAt this is the plane slit along the nonnegative real axis. For every , the map is conformal on the upper half-plane.
To check finiteness of the physical exit time, start a Brownian motion at and let be its real-axis exit. The time change of a continuous process in conformal invariance of planar Brownian motion isWe know almost surely. The Cauchy exit law from a Brownian half-plane assigns probability zero to . On such a path, throughout the compact interval , because it is in the open upper half-plane before exit and has nonzero endpoint. Its modulus therefore has a positive minimum and finite maximum. The displayed integrand is bounded on that interval, proving . The image Brownian motion exits at this finite changed time.
The endpoint printed in the source is degenerate: , so its image is the singleton , not an open domain, and the map is not conformal. If exit from that set is defined for Brownian motion started at one, its exit infimum is zero. It cannot be included in a nondegenerate conformal-domain argument.
Here is the martingale argument for maximal comparisons, including the starting-value issue. For , the Cauchy-Riemann equations and Itô's formula show thatare orthogonal continuous local martingales with the same quadratic variation. Localize before large disks and before exit. The Burkholder-Davis-Gundy inequalities then givewith a constant depending only on ; Fatou's lemma removes the localization. These are centered martingales. For the uncentered processes this impliessince .
The source normalizes at a boundary point, rather than the value of at the starting point. Consequently its displayed constant cannot be uniform in with only dependence. To see this, take and . Then and . Inside this narrow wedge,Both th moments are finite and the right one is positive; finiteness follows from the wedge radial-maximum tail of order , justified below. The source inequality would force , unbounded as . At , the immediate-exit interpretation gives the direct contradiction for the same polynomial.
For a fixed nondegenerate wedge, an uncentered inequality does hold with a constant allowed to depend on as well as . One rigorous outline for the polynomial class in this question is as follows. Separation of variables in a sector of radius gives, for exit through its circular arc, the expansionThus at the specified starting point the radial-maximum tail is comparable to . Hitting any fixed interior subarc has that same power, with positive leading coefficient. If a nonzero polynomial has degree , its real part has magnitude at least on some fixed interior subarc for sufficiently large . Therefore its maximal real-part th moment is infinite whenever . In that case the desired extended-real inequality is automatic.
The remaining polynomials have , so belong to a finite-dimensional vector space space. On that spaceis a genuine norm: if it is zero, Brownian motion's positive probability of reaching any interior neighborhood forces throughout , so analyticity makes a purely imaginary constant, and makes it zero. The corresponding imaginary-part functional is bounded on this finite-dimensional vector space normed space; its finiteness follows from and the radial tail bound. equivalence of norms in finite dimensions givesThis establishes the fixed-domain interpretation and identifies exactly why the universal centered martingale inequality cannot silently be applied to the printed uncentered boundary normalization. It is the distinction in starting-value obstruction in wedge conjugate maximal inequalities.
Write and . The three stoichiometric vectors are , and . The law of mass action gives the respective reaction propensity functionsIn particular, producing the second chemical species does not consume the first chemical species. Since the two reactants in the third chemical reaction are different chemical species, the number of possible pairs is .
For each Markov chain state, the chemical master equation adds incoming probability flux and subtracts outgoing probability flux:Here if either index is negative, and the initial condition is . These conventions also give the correct chemical master equation on the coordinate axes: for example, the third chemical reaction has zero outgoing reaction propensity function when either chemical species is absent.
Conditioning on the observed time. The native PDF defines as the first production time and then conditions on that production occurring at . If the intended information is its numerical value , the answer depends on . We first compute this conditional probability using a conditional probability density; conditioning on an exact value of a continuous random variable means a density ratio, since .
Before , no molecules of the second chemical species are present, so the joint-removal chemical reaction cannot occur. Molecules of the first chemical species arrive as a rate- Poisson process, and each independently starts a clock with a rate- exponential distribution for producing the first molecule of the second chemical species. Define the unnormalized probability mass functionThe chemical master equation before the first production, with production treated as killing, isMultiplying by and summing gives a partial differential equation for the probability generating function:Its solution, verifiable by direct differentiation, isThus , the survival function is , and the conditional distribution of given survival to is a Poisson distribution of mean .
Production in from Markov chain state has joint probability . Therefore the probability density function of isThe first production leaves unchanged. Taking the density ratio gives a size-biased distribution of the surviving count:In particular, under this reading the requested conditional probability isThe shift by one matters: an observation made exactly when production occurs preferentially selects larger counts, since their production reaction propensity function is larger.
Without observing the numerical time. If the conditioning merely repeats the definition of , the requested probability is instead the unconditional count at that stopping time. Before production, increases by one at rate , while production occurs at rate in Markov chain state . The competing exponential clocks implyThe first factor requires a second arrival before production from count one; the second requires production before a third arrival. The first arrival itself is certain. Production eventually occurs with probability one, as is also clear from . As a consistency check, averaging the time-conditioned answer against givesThese are two distinct, explicitly specified interpretations of the printed conditioning.
A product-Poisson stationary distribution is suggested by balancing the three reaction fluxes around the directed cycle of reaction complexes. If their mean counts are , this complex balance condition iswhich gives and . This suggests the joint probability mass functionIt is normalized because it is the product of two Poisson distributions. We verify it directly in the chemical master equation, rather than assuming a product-Poisson stationary distribution theorem. The three incoming terms satisfyWith negative-index values set to zero, these identities also hold on the axes. Their sum equals , precisely the outgoing probability flux. The stationary average total exit rate is , so these stationary balance equations do define an invariant distribution of a continuous-time Markov chain for the nonexplosive model verified below. This is complex balance; it does not assert pairwise detailed balance for the irreversible chemical reactions.
To identify this invariant distribution with the limiting probability distribution in the question, first check that the model is a nonexplosive continuous-time Markov chain. On any finite time interval, is bounded by its initial count plus the finite number of arrivals in a rate- Poisson process. Conditional on that bound, the rate of producing is bounded, so only finitely many such productions occur. The number of joint removals cannot exceed the available molecules. Thus only finitely many chemical reactions occur in finite time.
The continuous-time Markov chain is also an irreducible Markov chain. From a Markov chain state with both counts positive, repeated joint removals reduce both. On the axis, producing one and then removing a pair reduces by one. On the axis, adding one and then removing a pair reduces by one. Each prescribed finite sequence has positive probability, so every Markov chain state reaches . Conversely, arrivals followed by productions reach any with ; to reach , reach and remove one pair. The continuous-time Markov chain is therefore positive recurrent, and the continuous-time Markov chain convergence theorem gives from the empty initial condition.
The native PDF repeats in its list of independent noise terms, whereas its third stochastic differential equation uses . We use the intended three independent coordinate Brownian motions .
Put , and . Before the origin is reached, Itô's formula givesThe is the sum of three quadratic variation terms, each . The drift contribution is because the numerator is . The radial stochastic integral can be written using a scalar Brownian motion :Thus is a squared Bessel process of dimension until it reaches zero. If this equation is taken globally with the usual nonnegative squared Bessel process continuation, taking expected values givesThe stochastic integral has zero expected value: stopping first at large levels bounds the integrands, yields a finite first moment for , and then makes finite, so the unrestricted integral is a square-integrable martingale.
Boundary qualification. The punctured domain in the question does not itself specify that continuation. The boundary classification of a Bessel process says that the origin is inaccessible from when , equivalently . In this parameter range the original stochastic differential equation is global in the stated domain and the boxed result holds as written.
For , we have : the origin is reached in finite time with probability one. One can also see accessibility directly from the radial generator of an SDE diffusionFor , the harmonic function is the probability of reaching zero before . Finite-time access follows by using the nonnegative functionin the stopped Itô formula; it bounds the expected value of the time to reach zero or . Letting gives almost sure finite hitting of zero. The coefficients of the original vector stochastic differential equation are undefined there, so its stated punctured-domain version has no prescribed long-time evolution in this range.
The natural continuing radial squared Bessel process gives , but stopping and holding the particle at the origin would give a different answer. Indeed, with the first hit of zero, Itô's formula for the stopped process givesSince almost surely, dominated convergence applied to givesTherefore is the usual continued-radial answer; for a boundary convention is necessary. It is not a uniquely defined limit for the punctured-domain model alone.
For a radial function in three dimensions, the Laplacian is , while the imposed radial drift contributes . Thus the radial generator of an SDE diffusion isThe hitting probability for the inner sphere is harmonic for this diffusion generator in the shell, with value one on the inner sphere and zero on the outer sphere. At , the boundary value problem is thereforeIntegrating gives . The two boundary conditions determineBoth arguments of the logarithms are dimensionless. The result decreases from one to zero across the shell and lies strictly between zero and one for .
For a direct probability interpretation, stop at the first contact with either sphere. The stopped process is a bounded martingale by Itô's formula. The shell has positive inner radius, so its drift is bounded and its diffusion is nondegenerate; exit occurs almost surely. Optional stopping and dominated convergence therefore giveThe logarithm appears because the inward drift cancels one of the two geometric terms in the three-dimensional radial Laplacian, leaving the same radial diffusion generator as a planar Brownian motion with diffusion coefficient one.
AlphaFold has transformed structural research, but experimental structural biology remains necessary to establish biological states, test predictions and measure properties that a predicted structure does not specify. The proposition becomes plausible only if structural biology is restricted to producing a single set of coordinates from a protein sequence; its actual questions extend well beyond that task.
The achievement should not be minimized. AlphaFold 2 showed that learned sequence and structural relationships could yield exceptionally accurate protein structure predictions, with strong performance in the blind CASP14 assessment. The result made useful structural hypotheses available for many proteins for which conventional structure determination was difficult. Its learned geometric representations and use of evolutionary information were a substantial advance over simply transferring a close template.[ref]
Highly accurate protein structure prediction with AlphaFold by John Jumper and others. Abstract; structural accuracy assessment and the CASP14 evaluation
Such models can reveal likely protein domains, suggest candidate active sites, guide construct design and focus expensive experiments on specific uncertainties.By the examination date, the scope had already expanded. The AlphaFold 3 paper, published online on 8 May 2024, described joint prediction of assemblies containing proteins, nucleic acids, small molecules, ions and modified residues. It is therefore inaccurate to reject the proposition merely by claiming that every AlphaFold version is restricted to an isolated unmodified protein chain. Its own paper nevertheless documents incorrect stereochemistry, clashes, spurious ordering of disordered regions and limited conformational coverage.[ref]
The central distinction is between a plausible coordinate model and a measurement of a particular sample. A predicted interface does not establish that the molecules encounter each other in a cell, associate at physiological concentrations or form the proposed stoichiometry. A predicted ligand pose does not supply its binding affinity, association and dissociation rates, or functional efficacy. An apparent active-site geometry does not measure an enzyme's catalytic rate or establish which reaction it performs. Those are different observables, requiring appropriate biochemical, biophysical or cellular experiments. Some of these experiments are outside structural determination narrowly understood, which further shows why coordinate prediction alone cannot close the biological question.
Many proteins also act through a conformational ensemble. Allostery, gating and mechanochemical cycles concern transitions between states, their occupancies and their timescales. One accurate fold is not a measurement of that ensemble. Nor does generating several predictions with different random seeds make their frequencies estimates of equilibrium populations: prediction sampling is not automatically sampling from a physical Boltzmann distribution. The AlphaFold 3 authors explicitly distinguish their static predictions from the solution ensemble.[ref]
Accurate structure prediction of biomolecular interactions with AlphaFold 3 by Josh Abramson and others. Model limitations, discussion of conformational coverage and random seeds
An intrinsically disordered region may be biologically functional precisely because a single rigid structure is an inadequate description.Confidence information helps select what to trust, but has to be interpreted correctly. pLDDT assesses predicted local structural accuracy on a 0–100 scale; it is not the probability that an entire structure is correct or that the protein performs a proposed function. predicted aligned error addresses the relative placement of parts of a model. Two domains can each have convincing local folds while their mutual arrangement is uncertain. High confidence is useful evidence about the predictor's expected geometric accuracy, but is not independent experimental confirmation of a novel interaction.[ref]
Highly accurate protein structure prediction with AlphaFold by John Jumper and others. Methods and Supplementary Methods, predicted confidence measures
The different experimental methods answer complementary questions. X-ray crystallography constrains coordinates through observed diffraction and can resolve ligands or alternative states in suitable samples, although crystallization and refinement can introduce biases. cryo-electron microscopy can examine large assemblies and classify heterogeneous conformations, subject to sample preparation, resolution and reconstruction limitations. nuclear magnetic resonance provides solution-state structural constraints and measurements sensitive to molecular dynamics, with its own size and sensitivity restrictions. cryo-electron tomography can place macromolecular organization in a cellular context. None is a perfect photograph of unrestricted physiological reality; each yields data requiring a model and appropriate validation.
The practical relationship is increasingly reciprocal. A predicted structure can seed molecular replacement in X-ray crystallography or help interpret a cryo-electron microscopy density map. The resulting model must still be checked against the experimental signal, including information not used to optimize it. Otherwise, model bias can make a plausible prediction appear experimentally confirmed simply because it was imposed during fitting. Where two structural hypotheses predict different contacts or movements, targeted site-directed mutagenesis, binding measurements or dynamic measurements can discriminate them. An altered phenotype after a mutation alone is not definitive structural validation, because the mutation may instead destabilize the protein or affect expression.
Experiments also underpin evaluation of the predictor itself. Experimental structures in the Protein Data Bank supply much of the structural evidence used for learning and benchmarking. Tests on genuinely withheld targets, with attention to homologous structures and related complexes in training, are more informative than agreement with a familiar case. Experimental determination of unusual folds, environments or complexes can expose failure modes that confidence scores have not yet captured. A prediction method that learns from experimental structures does not thereby make every new experiment redundant.
The justified conclusion is a change in the allocation of effort. Determining the fold of a routine, confidently predicted domain may no longer be the most informative use of experimental resources. Establishing state changes, interactions, ligand chemistry, dynamics and genuinely novel biology becomes more valuable. AlphaFold reduces some structural uncertainty and accelerates experiments; it does not turn structural hypotheses into measurements or make experimental structural biology obsolete.
A simple model is especially valuable when it overturns a clearly stated expectation and explains why, but surprise is a means to understanding rather than a requirement that every useful model be counterintuitive. The expectation must be explicit enough to test, and the model should identify which assumptions make it fail. A surprising simulation without a mechanism or a plausible connection to observations is not sufficient.
One expectation is that a deterministic system with few variables must settle to a simple, predictable state. The logistic map,provides a compact counterexample. Its positive fixed point is , and the derivative there is . Thus the fixed point is locally stable for ; changing a single parameter can destroy that stability. At , repeated iteration approaches a two-cycle near and . For typical initial conditions at , the Lyapunov exponent is , so nearby initial states separate exponentially on average until the bounded state space limits their separation. Robert M. May's analysis made the consequences of such simple difference equations particularly influential in population modeling.[ref]
Simple mathematical models with very complicated dynamics by Robert M. May. pp. 459–467, first-order maps, stability changes and complex dynamics
The broken expectation is not that determinism is false: the rule remains deterministic. Rather, an irregular trajectory need not be caused by a complicated mechanism or external stochasticity, and exact rules need not permit long-range prediction from imperfectly measured initial conditions. This does not show that every irregular population time series is chaotic. Real populations may experience demographic noise, environmental variation or overlapping generations, and the map's parameters and state must have a defensible biological interpretation. Evidence should distinguish those alternatives. Even within the mathematical example, special initial states can be periodic; the claim about concerns typical trajectories, not every point of the interval.
A second expectation is that diffusion can only erase spatial variation. In a coupled reaction-diffusion equation,diffusion smooths each species separately, yet can destabilize their coupled uniform equilibrium. Linearizing about that equilibrium gives the mode matrix . Local stability of therefore does not by itself imply stability of every spatial mode. This is the organizing insight of the Turing instability.[ref]
The chemical basis of morphogenesis by Alan Turing. §§6–9, instabilities of homogeneous reaction-diffusion systems
For a concrete dimensionless linearization, takeThe well-mixed system has trace and determinant , so its perturbations decay. Writing , the spatial mode has trace and determinantThis determinant is negative for , creating one positive eigenvalue and a growing nonuniform mode. Equal diffusivities would instead shift both eigenvalues left and could not create this two-species instability. On a finite domain, at least one of the modes allowed by the boundary conditions must lie in the unstable band. The algebra exposes exactly why the intuition about smoothing fails: differential transport changes the balance of an interacting local system.
A Turing instability establishes a possible pattern-generating mechanism, not proof that a particular animal's markings use it. One must identify candidate interacting species, measure transport and response properties, and test perturbations that alter the predicted wavelength or stability. The linear example specifies onset only; nonlinear dynamics determine whether growth saturates into a stable pattern. Its value is to convert a vague statement about morphogenesis into discriminating questions, while leaving those experimental obligations visible.
Original mathematical illustrations of changing logistic-map dynamics, sensitivity to initial conditions and diffusion-driven instability
. Details. A third expectation is that an infection with a basic reproduction number above one must produce a major outbreak. Consider the early phase as a continuous-time branching process, with independent per-infective transmission rate and recovery rate , while susceptible depletion is negligible. If is the probability of eventual extinction starting from one infective, conditioning on the first event givesTaking the smallest solution in yields when , and when . Thus still gives an early-lineage extinction probability of . A deterministic SIR model describes mean-field growth but omits this individual realization uncertainty. In a finite closed stochastic SIR model, every epidemic eventually ends; the branching calculation concerns early extinction before substantial susceptible depletion, not that eventual end or an arbitrary peak-size cutoff.
These examples show different benefits of simplicity: a stability calculation can separate predictable from sensitive dynamics, a mode calculation can uncover a new mechanism, and a probability recursion can expose what an average trajectory hides. The same discipline also explains why the word “should” needs qualification. A simple exponential-decay model that confirms a familiar expectation can still calibrate a rate, serve as a control, or expose a faulty measurement. A useful mathematical model must earn its simplifications through the question it answers. Breaking an expectation is a powerful route to discovery when the contradiction is precise, robust to reasonable assumptions and experimentally consequential; novelty alone is not a validation criterion.
Software defects can make a scientific result wrong even when another researcher reproduces it exactly. Reducing their impact requires both a traceable computational workflow and independent checks that its implementation and scientific assumptions are appropriate.
Terminology should be stated because usage varies. Here, computational reproducibility means obtaining consistent results from the same data and recorded computational procedure; scientific replication means testing the finding with newly collected data or an independently conducted study. model verification asks whether the code implements the intended equations and rules. model validation asks whether those equations and rules are adequate for the scientific use. A result can pass the first two computational checks and still fail biological validation. Conversely, floating-point differences between platforms need not invalidate a conclusion if they lie within a justified numerical or statistical tolerance.
A software bug can enter at every stage. A sample-order mismatch may associate measurements with the wrong labels while retaining plausible matrix dimensions. An indexing or sign error can reverse a treatment contrast. Unit conversion errors can alter a kinetic rate by orders of magnitude. A mistaken stopping rule can report an optimizer's initial value as its solution. A preprocessing script can leak test-set information into training and exaggerate predictive accuracy. These failures are dangerous because an apparently reasonable plot and a successful program exit are weak tests of correctness.
Data handling provides a documented biological example. Spreadsheet defaults can coerce identifiers into dates or numbers: historical gene symbols such as SEPT2 and MARCH1 are examples of this problem. A survey found such conversions in published supplementary gene lists, demonstrating that silent changes can propagate beyond the originating analysis.[ref]
Gene name errors are widespread in the scientific literature by Mark Ziemann and others. Abstract; examples of gene-symbol conversion and manual verification of affected supplementary files
Automatic conversion may be intended spreadsheet behavior, but it becomes a defect in an analysis that requires exact textual identifiers. Specifying identifier columns as strings, preserving stable accessions, checking uniqueness and matching against an expected identifier set directly address that failure mode.A second example distinguishes coding errors from modeling errors. The AFNI 3dClustSim program had a defect in variance rescaling after smoothing, associated with boundary effects. Its maintainers documented the repair and assessed its consequences. Their analysis also showed why the broader problem of inflated cluster-inference false positives could not be attributed to that defect alone: assumptions about spatial autocorrelation and the inferential procedure mattered as well.[ref]
FMRI Clustering in AFNI: False-Positive Rates Redux by Robert W. Cox and others. Results, “The past, I: 3dClustSim, and ‘The Bug’”; Discussion, effect of the correction
Thus correcting an implementation is necessary but does not automatically validate the statistical method it implements.The first defense is a clear, inspectable specification. Write down units, array meanings, intended inputs and limiting behavior; divide a pipeline into small components with explicit interfaces. A unit test for a decay solver can compare against . An integration test should check the connection between data import, model fitting and plotting, including sample identifiers and units. regression tests preserve justified behavior after a fix, but a saved output from an unexamined older version is not an independent truth standard. Test quality matters more than the percentage of lines executed.
Exact reference answers are often unavailable, so property-based testing and metamorphic testing are valuable. A closed chemical conversion should conserve total material; a probability vector should be nonnegative and sum to one; consistently permuting independent sample rows should leave a deterministic fitted model unchanged. A valid metamorphic relation must match the problem: permuting a time series would generally destroy temporal information rather than preserve the expected result. Testing extreme inputs, empty groups and zero-rate cases often exposes bugs that ordinary examples miss. Code review and an independently written implementation can find shared blind spots that additional tests derived from the same erroneous formula cannot.[ref]
Best Practices for Scientific Computing by Greg Wilson and others. sections on modular development, testing, assertions and collaborative code review
Numerical algorithms introduce another layer. For explicit Euler integration of , the update is . The exact solution is positive and decays, but makes the discretization unstable, and even produces alternating negative values. This can be an unsuitable algorithm or step size rather than a typographical defect. Comparing step sizes, solver tolerances and alternative algorithms separates discretization error from a biological prediction. In a sensitive dynamical system, convergence of statistical summaries may be more meaningful than exact agreement of a long trajectory.
Traceability makes failures discoverable and corrections usable. version control identifies the code revision that generated a result; data provenance records raw inputs, reference annotations, filtering decisions and transformations. An executable workflow regenerates outputs from those inputs without undocumented manual edits. Dependency versions and a recorded environment, possibly a software container, reduce accidental differences between installations. A random seed should be recorded together with the generator and, where relevant, the allocation of streams to parallel workers. One seed is not an uncertainty estimate, and parallel scheduling or library changes can defeat bitwise repetition even when it is reused.
continuous integration can run focused tests whenever the analysis changes, while release notes and archived versions let readers distinguish corrected results from earlier ones. The environment archive preserves the ability to reproduce an old computation; the maintained version should also contain the scientific correction. Publishing only a container that reliably reproduces a wrong result is inadequate. When a defect is found, quantify which conclusions change, rerun affected analyses, retain a minimal reproducing example and communicate the correction through the appropriate scientific record. Reliable computational science combines reproducible execution, verified implementation, quantified numerical error and validation against evidence; none is a substitute for the others.
Past exam of the systems biology course of the University of Cambridge 2024 Paper 3 2 d Solution 2026-10-20
TODO: Complete the data-specific numerical results and diagnostics when the original
Iris_data.csv is available.Use the random-walk Metropolis algorithm with proposal , where . The proposal is symmetric, so for a nonnegative proposal the acceptance probability isNegative proposals are rejected. They are not redrawn until positive, since that would change the proposal kernel and require a different acceptance ratio. On rejection, store the current state again; keeping accepted moves alone would bias the empirical posterior distribution.
set.seed(20240528)
B <- 10000L
mu <- numeric(B + 1L)
mu[1L] <- 4
logpost <- function(u) {
if (!is.finite(u) || u < 0) return(-Inf)
loglik(u) - u/3
}
lp <- logpost(mu[1L])
accepted <- 0L
for (i in seq_len(B)) {
proposal <- rnorm(1L, mean = mu[i], sd = 1)
lp_new <- logpost(proposal)
if (log(runif(1L)) < min(0, lp_new - lp)) {
mu[i + 1L] <- proposal
lp <- lp_new
accepted <- accepted + 1L
} else {
mu[i + 1L] <- mu[i]
}
}
cat("Acceptance fraction =", accepted/B, "\n")
# A provisional discard; assess it with the trace in part (e).
burn <- 1000L
post <- mu[(burn + 2L):(B + 1L)]
m <- xbar - 1/(3*n)
s <- 1/sqrt(n)
posterior_density <- function(u) {
ans <- numeric(length(u))
ok <- u >= 0
ans[ok] <- exp(dnorm(u[ok], m, s, log = TRUE) -
pnorm(m/s, log.p = TRUE))
ans
}
png("q2-posterior.png", width = 900, height = 600)
hist(post, breaks = 40, probability = TRUE, xlab = expression(mu),
main = "Retained Metropolis draws and exact posterior")
u <- seq(0, max(post) + 3*s, length.out = 4001L)
lines(u, posterior_density(u), col = "firebrick", lwd = 2)
dev.off()The exact truncated normal distribution density overlays the histogram as a check; it does not replace the requested Markov chain Monte Carlo procedure. The 9,000 retained states exclude the initial state and the first 1,000 transitions. The particular histogram and acceptance fraction remain dependent on the missing measurements.
A good receiver operating characteristic rises toward the upper-left corner: many reference-positive loci are detected while few reference-negative loci are accepted. The area under the ROC curve summarizes this discrimination over cutoffs. Higher is better in the stated score direction; perfect separation gives one. The displayed value near 0.86 indicates substantial ranking discrimination against this reference.
The area can also be interpreted as the probability that a randomly chosen positive receives a higher score than a randomly chosen negative, with half credit for ties. It does not select a cutoff or demonstrate that most retained calls are correct: those practical questions also depend on prevalence and the relative costs of errors.
The same illustrative classifier viewed through ROC and precision–recall curves at ten percent prevalence
. Details. An ensemble of normalized quantum states with probabilities is represented by the density operatorIt determines every observable expectation value through . The ensemble decomposition need not be unique; the operator specifies the measurement statistics.
The original Von Neumann entropy depends on its eigenvalues, with defined by continuity:After rank-one dephasing, the eigenvalues are the retained diagonal populations , givingdephasing removes coherences in the specified basis, increasing the system's mixedness while preserving those measurement probabilities. It cannot be a closed-system unitary transformation, since the eigenvalues change. The subsystem entropy increase does not by itself assert an increase in the entropy of a closed system plus its environment.
A scattering phase shift measures the change of a partial wave's outgoing phase relative to the free radial solution. For a real central potential and elastic scattering, probability conservation gives a unit-modulus Partial-wave S-matrix . Indeedso the incoming amplitude is unchanged and the outgoing one acquires .
Expanding an incident plane wave in Legendre polynomials and comparing the outgoing spherical wave givesUse and to remove cross terms:This is the elastic total scattering cross-section for the one-particle central-potential problem, with no identical-particle symmetrization factor.
Let . The outgoing analytic branch of Klein-Gordon step momentum iswhere each square root is continued from the upper half-plane. It behaves as at large positive or negative real . The branch points are ; replacing this product by a principal square root of can choose the wrong sign below the lower threshold.
I. For , and both transmitted kinetic energy and group velocity are positive. Thus and ; the transmission decreases to zero on approaching the upper threshold from above.
II. For , write with . The right wave decays, has modulus one, and . There is an evanescent tail but no flux transmitted to infinity. Its reflection quantum phase changes continuously between the two thresholds.
III. For , the analytic continuation gives , where . The group velocity is again rightward, while the charge density and transmitted charge current are negative. ThereforeChoosing would describe a wavepacket arriving from the right, inconsistent with the chosen incoming channel. As the lower threshold is approached, and from above. This Klein-Gordon step amplification has a real denominator zero at when : there , and no finite stationary solution with unit incoming amplitude satisfies both matching equations. The resulting formal pole must not be described as an infinite single-particle probability. Finite switching, wavepackets and the treatment of the external source require a multiparticle analysis.[ref]
Klein Paradox for Spin-0 Particles by Douglas M. Gingrich. Equations 4.142–4.155: outgoing negative-momentum branch, boundary matching and charge currents
The negative-kinetic-energy branch is interpreted as an antiparticle channel. In the overlap , particles can escape to the left and oppositely charged antiparticles to the right. This interval exists only when . The external electrostatic source supplies the energy for pair creation; the reflected particle flux can exceed the incident one because the outgoing state need not contain only the incident particle.
The conserved quantity is signed charge current, not a positive one-particle probability in both regions. Negative denotes rightward transport of opposite charge, so it is consistent with and . A quantized charged field with particle and antiparticle creation operators gives the appropriate interpretation of this Klein paradox. This bosonic result must not be replaced by a fermionic reflection law or interpreted as a failure of charge conservation.[ref]
Klein Paradox for Spin-0 Particles by Douglas M. Gingrich. Discussion after equation 4.155: pair creation and the oppositely signed transmitted current
Use normalized instantaneous modes and expand . Differentiating at fixed givesFor , integration usesso the moving-wall derivative coupling isFor the normalization derivative and the remaining integral cancel exactly, giving zero. The moving integration endpoint contributes no boundary term because every mode vanishes there. ThereforeThe real coupling matrix is antisymmetric, as required by conservation of total probability.
For first-order excitation in a linearly expanding infinite well, retain only the ground-state amplitude on the right. For the second level, the coupling coefficient is . With ,The relative dynamical phase is plus a constant. Up to an irrelevant phase,The lower endpoint is an oscillatory improper limit: substituting gives . A physical initial state cannot occupy a zero-width well. Prepare the ground state at , integrate from , and then take the formal limit of the probability. For , endpoint asymptotics give ; the first-order expression is reliable only while total excitation remains small.




