Alphabeta Math
Pipeline-generated
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.

Cm Math Evidence — Examples

1 · Prerequisites

2 · Summary

Worked finite verifications of the measurement, propagation and inference definitions of cm-math-evidence. The two propagation computations are symbolic and quantitative: Symbolic two-input propagation of a period–length model differentiates the formal two-input model h(T,l)=4π2l/T2 and expands Dh(μ)ΣDh(μ)T into 64π4l02T06σT2−64π4l0T05σTl+16π4T04σl2, and supplies an explicit Hessian bound on a box, mean and mean-square remainder bounds and the scalar variance correction, asserting no measured period, length or uncertainty; Exact variance against propagated variance for a nonlinear observation map compares the propagated value 6=244 with the exact variance 574 for h(y)=y2 on a three-point weighted set, exhibiting equality in both remainder bounds. Finite check of the IID sample-mean variance and Chebyshev bound enumerates two independent Rademacher variables, verifying E∣X‾∣2=σ22 and the Chebyshev bound at a=1 (attained) and a=12 (strict), and Equality and strictness in the uniform second-order remainder bound shows the second-order remainder bound can be an equality for a quadratic and strict for a cubic.

Two counterexamples mark the boundaries of the same results. The propagated covariance is not the exact covariance of a nonlinear observation map shows that under the full C2 and Hessian-bound hypotheses the propagated value 272 still differs from the exact variance 2672 of h(Y)=Y3, so the hypotheses control the remainder rather than forcing equality, and Coverage level is not the posterior probability of the realized confidence set refutes the posterior reading of a confidence level: a confidence set of level 34 can, for an explicitly declared finite prior and a datum consistent with a single parameter value, have conditional probability 1 of containing the parameter. Every computation on this page is finite or symbolic; none reports a measurement.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

None yet.

5 · Examples, experiments and counterexamples

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Symbolic two-input propagation of a period–length model

Example

Consider the model function h:R2⊇U⟶R,h(T,l):=4π2lT2,U:={(T,l)∈R2:T>0}, where T represents a duration and l a length in an adopted unit convention; the definition here is purely formal and no physical model, period, length or measurement is asserted. The set U is open and convex in R2, and h is C∞ there. Fix a nominal input μ=(T0,l0)∈U with T0>0, and let (T,l):Ω→U be a square-integrable random vector with E[(T,l)]=(T0,l0),Cov⁡(T,l)=(σT2σTlσTlσl2). Then the linearization of h at μ has slope Dh(μ)=(−8π2l0T03, 4π2T02), and the propagated covariance of the linearization is the 1×1 matrix Dh(μ)Cov⁡(T,l)Dh(μ)T=64π4l02T06 σT2−64π4l0T05 σTl+16π4T04 σl2. This is a symbolic computation in a declared model; it neither supplies values for T0,l0,σT2,σTl,σl2 nor asserts that any apparatus realizes the model. A physical reading in which T is a period and l a length, and in which a pendulum protocol with a small-angle model is used to estimate a gravitational parameter, belongs to a separate physical item that states the protocol, the small-angle idealization and its remaining error; no such reading is made here.

Explicit bounded nonlinearity correction. In addition suppose X=(T,l) takes values in the open convex box UB=(T0−ρT,T0+ρT)×(l0−ρl,l0+ρl), where 0<ρT<T0 and ρl>0. The coordinates are fixed numerical coordinates (no addition of physical durations and lengths is intended). Write t−=T0−ρT, l+=∣l0∣+ρl, and Hh(T,l)=(24π2l/T4−8π2/T3−8π2/T30),B=(24π2l+/t−4)2+2(8π2/t−3)2. Then ∥Hh∥≤B on UB. For R=h(X)−h(μ)−Dh(μ)(X−μ), Mk=E∣X−μ∣k and the propagated variance s2=Dh(μ)Cov⁡(X)Dh(μ)T computed above, ∣R∣≤B2∣X−μ∣2,∣E[R]∣≤B2M2,E[R2]≤B24M4,∣Var⁡(h(X))−s2∣≤Bs2M4+B24M4.

The box makes M4≤(ρT2+ρl2)2<∞. This correction is mathematical; physical small-angle and apparatus discrepancies are additional inputs of a physical consumer.

Facts & Assumptions

Given: The function h(T,l)=4π2lT−2 on the open convex set U={T>0}, a nominal input μ=(T0,l0)∈U, and a square-integrable random vector (T,l):Ω→U with mean μ and covariance matrix as displayed.

[L1]

If h:U→R is Borel measurable and totally differentiable at μ and (T,l) is square-integrable with mean μ and covariance matrix Σ, then the linearization x↦h(μ)+Dh(μ)(x−μ) has mean h(μ) and covariance matrix Dh(μ)ΣDh(μ)T. (The covariance of the linearization is AΣAT)

[L2]

The covariance matrix of a square-integrable random vector is Σij=E[(Xi−μi)(Xj−μj)] with Σ11=σT2, Σ22=σl2 and Σ12=Σ21=σTl. (Mean vector and covariance matrix of a square-integrable random vector)

[L4]

The Jacobian matrix of a totally differentiable map is the matrix of its total derivative in the standard bases, and matrix multiplication in the 1×2 and 2×2 case gives the displayed quadratic form. (The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn)

[L5]

On an open convex domain with ∥Hh∥≤B, the Taylor remainder has ∣R∣≤B∣X−μ∣2/2; its mean and mean-square obey the stated bounds, and its variance differs from the linearized variance by at most Bs2M4+B2M4/4 when M4<∞. (A uniform Hessian bound controls the second-order Taylor remainder, Mean, mean-square and covariance bounds for second-order linearization error)

[L6]

The matrix action Hv and operator norm ∥H∥ are those of A uniform Hessian bound controls the second-order Taylor remainder. For a 2×2 matrix H and vector v, applying Euclidean Cauchy–Schwarz to each row gives ∣Hv∣2≤(∑0≤i,j<2Hij2)∣v∣2, so its operator norm is at most the square root of the sum of squared entries. (The Hessian matrix and critical points of a scalar field, Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs)

[L7]

If h is continuous, it has Borel preimages of Borel sets; if every first partial derivative exists on a neighbourhood of μ and is continuous at μ, then h is totally differentiable there with Jacobian derivative. The Ck convention is continuity of the iterated coordinate derivatives through order k. (A continuous map has Borel preimages of Borel sets, If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, Ck Euclidean maps and diffeomorphisms)

Verification

technique · direct computation
1.1givenL3L4L7

The formula h(T,l)=4π2lT−2 is continuous on U={T>0}, and its first partial derivatives in [L3] are continuous there. Thus h is Borel measurable by [L7], and [L7] gives total differentiability at μ with Jacobian matrix Dh(μ)=(−8π2l0T0−3, 4π2T0−2); its entries agree with the partial derivatives of [L3] by [L4].

1.2givenL3L6L8algebra

Differentiating [L3] once more gives hTT=24π2l/T4, hTl=hlT=−8π2/T3 and hll=0, hence the displayed Hessian by [L6]. On UB, T>t−>0 and ∣l∣<l+; the sum of squared entries is at most (24π2l+/t−4)2+2(8π2/t−3)2, so [L6] gives ∥Hh∥≤B. The formulas of [L8] verify continuity of every iterated partial derivative on U, as asserted in the Example.

2.1step 1.1L1L2algebra

By [L1] and [L2] the propagated covariance is the single entry ∑k,l=12a1ka1lΣkl with a11=−8π2l0T0−3, a12=4π2T0−2, Σ11=σT2, Σ22=σl2 and Σ12=Σ21=σTl: a112σT2+2a11a12σTl+a122σl2=64π4l02T06σT2−64π4l0T05σTl+16π4T04σl2.

2.2givenstep 1.2L5algebra

Under the additional box hypothesis, ∣X−μ∣2<ρT2+ρl2 pointwise, so M4≤(ρT2+ρl2)2<∞. The box is open and convex and contains μ and all values of X, so [L5] with step 1.2 gives the pointwise, mean, mean-square and scalar covariance-error bounds displayed in the Example.

3.1step 2.1algebra

The three coefficients computed in step 2.1 are exactly those displayed in the Example: a112=64π4l02T0−6, 2a11a12=−64π4l0T0−5 and a122=16π4T0−4.

4.1step 2.1step 3.1step 1.2step 2.2∎

Steps 2.1 and 3.1 establish the exact propagated covariance of the linearization for the initial square-integrable model; steps 1.2 and 2.2 establish its explicit Hessian correction under the additional box hypothesis.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Exact variance against propagated variance for a nonlinear observation map

Example

Let Ω={ω0,ω1,ω2} carry the weights w(ω0)=1/2, w(ω1)=w(ω2)=1/4, let Y:Ω⟶R,Y(ω0)=0,Y(ω1)=1,Y(ω2)=3, and let h(y):=y2 on the open convex set U=(−1,4), which contains the three values of Y. Then h is C2 with constant Hessian Hh(x)=(2) and operator norm B=2, the mean is μ=E[Y]=1∈U, and E[Y2]=52,Var⁡(Y)=32,E[Y4]=412,Var⁡(h(Y))=412−(52)2=574. The linearization T(y)=h(1)+h′(1)(y−1)=1+2(y−1) has variance h′(1)2Var⁡(Y)=4⋅32=6=244≠574=Var⁡(h(Y)), so the propagated variance is not the exact variance of h(Y). The linearization error R=h(Y)−T(Y)=(Y−1)2 satisfies E[R]=32=B2E[(Y−1)2],E[R2]=92=B24E[(Y−1)4], so both displayed bounds of Mean, mean-square and covariance bounds for second-order linearization error are attained in this example. The example contains no measured quantity and asserts no physical model.

Facts & Assumptions

Given: The finite weighted set (Ω,w) and the random variable Y displayed in the Example; the function h(y)=y2 on U=(−1,4).

[L1]

The finite probability space (Ω,w) determines a probability measure P on (Ω,P(Ω)) with P(A)=∑ω∈Aw(ω), and expectations of finite-valued random variables computed by the finite weighted sum agree with their expectations as random variables on that probability space. (Finite probability spaces are exactly finite full-power-set probability spaces, Expectation of a real random variable on a finite probability space, Finite probability spaces, outcome weights, events, and event probabilities)

[L2]

If h:U→R is C2 on the open convex set U, ∥Hh(x)∥≤B on U, X takes values in U with E[X]=μ∈U and E∣X−μ∣2<+∞, then the linearization error R=h(X)−h(μ)−h′(μ)(X−μ) satisfies ∣E[R]∣≤E∣R∣≤B2E∣X−μ∣2, and E[R2]≤B24E∣X−μ∣4 when the fourth moment is finite. (Mean, mean-square and covariance bounds for second-order linearization error)

[L3]

For a square-integrable random variable X with mean μ, the covariance matrix of the one-dimensional random vector (X) is the 1×1 matrix (Var⁡(X)), and the linearization x↦h(μ)+h′(μ)(x−μ) has covariance matrix h′(μ)2Var⁡(X). (Mean vector and covariance matrix of a square-integrable random vector, The covariance of the linearization is AΣAT)

Verification

technique · direct computation on a finite probability space
1.1givenL1algebra

By [L1] the weights make (Ω,w) a probability space and the expectations below are the finite weighted sums of Expectation of a real random variable on a finite probability space: E[Y]=12⋅0+14⋅1+14⋅3=1,E[Y2]=14⋅1+14⋅9=52, E[Y4]=14⋅1+14⋅81=824=412,E[(Y−1)2]=12⋅1+14⋅0+14⋅4=32, and E[(Y−1)4]=12⋅1+14⋅0+14⋅16=12+4=92.

1.2givenL3L4algebra

The function h(y)=y2 is C2 on the open convex set U=(−1,4), with h′(y)=2y, so h(1)=1 and h′(1)=2; its Hessian is the constant matrix (2), of operator norm B=2 by [L3] and [L4], and the values 0,1,3 of Y and the mean μ=1 all lie in U.

2.1step 1.1L4algebra

By [L4], Var⁡(Y)=E[Y2]−E[Y]2=52−1=32 and Var⁡(h(Y))=E[Y4]−E[Y2]2=412−254=82−254=574.

2.2step 1.2algebra

The linearization error is R=h(Y)−1−2(Y−1)=Y2−2Y+1=(Y−1)2.

3.1step 1.2step 2.1L3algebra

By [L3] the propagated covariance is h′(1)2Var⁡(Y)=4⋅32=6=244, while step 2.1 gives Var⁡(h(Y))=574; these differ, so the propagated covariance is not the exact variance of h(Y) in this model.

4.1step 1.1step 2.2L2algebra∎

With B=2 and the moments of step 1.1, the bounds of [L2] read B2E[(Y−1)2]=1⋅32=32 and B24E[(Y−1)4]=1⋅92=92; since R2=(Y−1)4 by step 2.2, one has E[R]=32 and E[R2]=92, so both bounds are attained.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Finite check of the IID sample-mean variance and Chebyshev bound

Example

Let Ω={(σ1,σ2):σ1,σ2∈{−1,1}} be the uniform finite probability space with four outcomes of weight 1/4, and let X1(σ1,σ2):=σ1,X2(σ1,σ2):=σ2. Then (X1,X2) is an IID family with μ=E[X1]=0 and σ2=Var⁡(X1)=1; the sample mean X‾=(X1+X2)/2 takes the values −1,0,1 with probabilities 1/4,1/2,1/4 respectively. The exact second moment and the Chebyshev bound computed directly below read E∣X‾∣2=12=σ22,P(∣X‾∣≥1)=12=σ22⋅12, so the bound is attained at a=1, while P(∣X‾∣≥12)=12≤2=σ22⋅(1/2)2 is strict. This is a finite check inside the stated model; it evaluates no measurement and estimates no physical quantity.

Facts & Assumptions

Given: The uniform finite probability space on {−1,1}2 and the coordinate maps X1,X2 of the Example.

[L3]

On a finite probability space, expectations are the finite weighted sums of Expectation of a real random variable on a finite probability space, and the finite model agrees with the probability measure P(A)=∑ω∈Aw(ω), whose expectations coincide with those integral expectations. (Finite probability spaces are exactly finite full-power-set probability spaces, Finite probability spaces, outcome weights, events, and event probabilities)

[L4]

A finite family of finite-valued random variables is mutually independent exactly when P(Xj=xj for all j∈J)=∏j∈JP(Xj=xj) for every nonempty J and every choice of values; it is identically distributed when the individual distributions agree. (Pairwise and mutual independence of finite-valued random variables, Identical distribution and IID families)

Verification

technique · direct enumeration of four outcomes
1.1givenL3L4algebra

The four outcomes have weight 1/4 each, so P(X1=−1)=P(X1=1)=1/2 and the same for X2; for every pair (a,b)∈{−1,1}2 one has P(X1=a,X2=b)=1/4=P(X1=a)P(X2=b). By [L4] the family is independent, the two distributions agree, and E[X1]=12(−1)+12(1)=0, E[X12]=12(1)+12(1)=1 by [L3].

1.2givenL3algebra

Enumerating X‾=(X1+X2)/2 on the four outcomes gives the values 1,0,0,−1, each with weight 1/4; hence P(∣X‾∣≥1)=24=12,P(∣X‾∣≥12)=24=12.

2.1step 1.1step 1.2L3algebra

By the enumeration in step 1.2 and the expectation formula [L3], E[X‾]=0 and E∣X‾∣2=14+14=12=σ2/2. For any a>0, the pointwise inequality a21{∣X‾∣≥a}≤∣X‾∣2 and summation with nonnegative weights give P(∣X‾∣≥a)≤E∣X‾∣2/a2=σ2/(2a2).

3.1step 1.2step 2.1algebra∎

At a=1 the bound of step 2.1 is 1/2, equal to the exact probability from step 1.2; at a=1/2 it is 2, strictly larger than the exact probability 1/2. These establish the displayed finite-sample identity and bounds without requiring an infinite IID extension.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Equality and strictness in the uniform second-order remainder bound

Example

Two explicit one-variable cases of A uniform Hessian bound controls the second-order Taylor remainder.

A quadratic on an interval. Let h(y):=y2 on the open convex set U=(−1,3) and fix μ=1. Then h is C2 with constant Hessian (2), so ∥Hh(y)∥=2 for every y∈U and B=2 is the sharp constant. For every y∈U, h(y)−h(1)−h′(1)(y−1)=y2−1−2(y−1)=(y−1)2=B2∣y−1∣2, so the inequality of the lemma is an equality for every y∈U.

A cubic on an interval. Let g(y):=y3 on the open convex set V=(−1,2) and fix μ=1/2. Then g is C2 with Hessian (6y), and ∥Hg(y)∥=∣6y∣≤12 on V, so B=12 is an admissible constant. At y=1, g(1)−g(12)−g′(12)(1−12)=1−18−34⋅12=12≤122(12)2=32, so the bound holds strictly at this point. Both computations are formal and assert nothing beyond the stated intervals.

Facts & Assumptions

Given: The functions h(y)=y2 on U=(−1,3) and g(y)=y3 on V=(−1,2) with the points indicated.

[L1]

If U is open and convex, h:U→R is C2, and ∥Hh(x)∥≤B on U, then ∣h(y)−h(μ)−h′(μ)(y−μ)∣≤B2∣y−μ∣2 for all μ,y∈U. (A uniform Hessian bound controls the second-order Taylor remainder)

[L3]

For a 1×1 matrix (a) the operator norm is ∣a∣. (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||)

[L4]

The intervals (−1,3) and (−1,2) are open and convex subsets of R. (A convex subset of Rm contains every line segment between two of its points)

Verification

technique · direct computation
1.1givenL2L3L4

On U=(−1,3) the second derivative of h is the constant 2, so Hh=(2) and ∥Hh∥=2 by [L2] and [L3]; U is open and convex by [L4].

1.2givenL2L3L4algebra

On V=(−1,2) the second derivative of g is 6y, so Hg(y)=(6y) and ∥Hg(y)∥=∣6y∣≤12 for ∣y∣<2; V is open and convex by [L4].

2.1step 1.1givenL1algebra

For h with μ=1 and B=2, the difference in the Example equals (y−1)2 by expansion, and the bound of [L1] is 22(y−1)2, so equality holds for every y∈U.

2.2step 1.2givenL1algebra

For g with μ=1/2 and B=12, the difference at y=1 is 1−18−38=12, while the bound of [L1] is 122⋅14=32, and 12<32.

3.1step 2.1step 2.2∎

Step 2.1 exhibits equality in the bound, and step 2.2 exhibits strict inequality, so both alternatives occur under the lemma's hypotheses.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Coverage level is not the posterior probability of the realized confidence set

Statement refuted

Statement refuted: "if C is a confidence set of level 1−α for a family (Pθ)θ∈Θ and π is any probability distribution on Θ for which the conditional law of θ given the datum s exists, then the conditional probability that θ∈C(s) given s equals 1−α" (Confidence sets and their coverage level).

Facts & Assumptions

Given: The parameter set Θ={14,16,18}, the data space S=R2 with the full power-set sigma-algebra, and, for each θ∈Θ, the four-point set Dθ:={(θ−1,θ−1),(θ−1,θ+1),(θ+1,θ−1),(θ+1,θ+1)}.

[L1]

For each θ∈Θ, A↦∣A∩Dθ∣/4 is a probability measure on (S,S), where S=2S is the full power set, a sigma-algebra. (Measures on sigma-algebras, Probability measures and probability spaces, Sigma-algebras)

[L2]

A confidence set is a map C:S→2Θ with each {θ∈C} measurable, its coverage at θ is Pθ(θ∈C), and its level is 1−α when the infimum of the coverages is at least 1−α. (Confidence sets and their coverage level)

[L3]

On a finite probability space with P(B)>0, the conditional probability of A given B is P(A∣B)=P(A∩B)/P(B); a finite weighted set (W,w) determines such a probability measure and finite weighted sums give its probabilities. (Conditional probability P(A∣B) for P(B)>0, Finite probability spaces, outcome weights, events, and event probabilities, Finite probability spaces are exactly finite full-power-set probability spaces)

Counterexample

1.1givenL1L2

By [L1] each θ∈Θ determines a probability measure Pθ on (S,S) with Pθ({s})=1/4 for s∈Dθ and Pθ({s})=0 otherwise. Define C(s):={{s1−1}∩Θ,s1=s2,{s1+s22}∩Θ,s1≠s2. Each C(s) is a subset of Θ, and each set {θ∈C} is a subset of S and therefore an element of the full power set S=2S, so C is a confidence set by [L2].

2.1step 1.1L1L2algebra

For fixed θ the four points of Dθ evaluate under C as follows: (θ+1,θ+1) gives C={(θ+1)−1}={θ}, which contains θ; (θ−1,θ−1) gives C={θ−2}∩Θ, which is empty for θ=14 and equals {θ−2} for θ=16,18; in every case it does not contain θ; and the two points with distinct coordinates, (θ+1,θ−1) and (θ−1,θ+1), both give C={θ}. Hence Pθ(θ∈C)=3/4 for every θ∈Θ, and the coverage level of C is 3/4 by [L2].

2.2step 1.1L1algebra

Let s∗:=(15,17). Since s∗ has distinct coordinates, step 1.1 gives C(s∗)={(15+17)/2}={16}. Moreover, s∗∈Dθ holds exactly for θ=16, so Pθ({s∗}) equals 1/4 for θ=16 and 0 for θ∈{14,18}.

3.1step 2.2givenL3

Fix weights π(14),π(16),π(18)≥0 summing to 1 with π(16)>0, and put W:={(θ,s):θ∈Θ, s∈Dθ}, a twelve-element set, and give (θ,s)∈W weight π(θ)/4. These nonnegative weights sum to 1, so [L3] defines a probability measure Q on the finite space W. In events below, θ and s denote the two coordinate maps on W. The event {s=s∗} has Q-probability π(16)⋅14>0, so the conditional probability given s∗ is defined by [L3].

4.1step 2.2step 3.1L3algebra

The event {θ∈C(s), s=s∗} equals {θ=16, s=s∗}, because C(s∗)={16} by step 2.2; its Q-probability is π(16)⋅14, the same as Q({s=s∗}) by step 2.2. Hence Q(θ∈C(s) ∣ s=s∗)=π(16)/4π(16)/4=1.

5.1step 2.1step 4.1algebra∎

The confidence set C has level 3/4 by step 2.1, while for the prior π and the datum s∗ the conditional probability that θ∈C(s) is 1 by step 4.1; since 1≠3/4, the refuted statement is false.

Remarks

The parameter is treated as random only through the explicitly specified weights π; the computation uses the finite weighted model and the conditional-probability identity of [L3]. The witness shows that the coverage level 3/4 carries no data-conditional posterior content: the data can be consistent with exactly one parameter value while the level remains 3/4.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

The propagated covariance is not the exact covariance of a nonlinear observation map

Statement refuted

Statement refuted: "if U⊆R is open and convex, h:U→R is C2, X:Ω→U is square-integrable with E[X]=μ∈U, and Σ is its covariance matrix, then Cov⁡(h(X))=Dh(μ)ΣDh(μ)T, that is, Var⁡(h(X))=h′(μ)2Var⁡(X)."

This is an unsupported nonlinear extension of The covariance of the linearization is AΣAT, which states the covariance formula for the affine linearization T(X) and does not assert equality with Cov⁡(h(X)).

Facts & Assumptions

Given: The finite weighted set Ω={ω0,ω1,ω2} with w(ω0)=1/2, w(ω1)=w(ω2)=1/4; the random variable Y with Y(ω0)=0, Y(ω1)=1, Y(ω2)=3; and the function h(y)=y3 on the open convex set U=(−1,4).

[L1]

On a finite probability space, expectations are the finite weighted sums of Expectation of a real random variable on a finite probability space, and the finite model determines the probability measure P(A)=∑ω∈Aw(ω) whose integral expectations agree with those sums. (Finite probability spaces, outcome weights, events, and event probabilities, Finite probability spaces are exactly finite full-power-set probability spaces)

[L3]

If h:U→R is C2 on open convex U, ∥Hh(x)∥≤B on U, X takes values in U with E[X]=μ∈U and finite second moment, then the linearization error satisfies ∣E[R]∣≤E∣R∣≤B2E∣X−μ∣2 and E[R2]≤B24E∣X−μ∣4 when the fourth moment is finite. (Mean, mean-square and covariance bounds for second-order linearization error)

Counterexample

1.1givenL1L2algebra

By [L1] the finite weighted set is a probability space and the expectations below are its finite weighted sums: E[Y]=12⋅0+14⋅1+14⋅3=1, E[Y2]=14+94=52, and hence Var⁡(Y)=52−1=32 by [L2].

2.1step 1.1givenL2algebra

The function h(y)=y3 is C2 on U=(−1,4), with h′(y)=3y2, so h′(1)=3 and the propagated variance is h′(1)2Var⁡(Y)=9⋅32=272.

2.2step 1.1givenL1L2algebra

The exact moments of h(Y)=Y3 are E[Y3]=14⋅1+14⋅27=7 and E[Y6]=14⋅1+14⋅729=7304=3652, so Var⁡(h(Y))=3652−72=3652−982=2672.

3.1step 2.1step 2.2algebra

Steps 2.1 and 2.2 give propagated value 272 and exact variance 2672; these are unequal, so the refuted identity fails under the stated hypotheses.

4.1step 1.1step 3.1givenL3algebra

The comparison does not contradict [L3]: on U=(−1,4) the second derivative of h is 6y, of absolute value at most 24, so B=24 is admissible, and the linearization error R=Y3−1−3(Y−1)=Y3−3Y+2 satisfies R=2,0,20 at Y=0,1,3, giving E[R]=6≤242⋅32=18 and E[R2]=102≤2424⋅92=648, both bounds of [L3] holding strictly.

5.1step 3.1step 4.1∎

The hypotheses of the refuted statement hold, the propagated covariance 272 differs from the exact variance 2672, and the remainder bounds of [L3] remain satisfied; hence the propagated covariance controls the actual covariance only through those bounds.

Remarks

This witness is a genuine failure of equality, not of the domination bounds of Mean, mean-square and covariance bounds for second-order linearization error: the bounds hold strictly here. A consumer that reports the propagated covariance as an uncertainty of h(Y) must carry the remainder qualification with it.

Sources