Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

The observed law need not identify the latent-error variance split

Statement

Within the class of centered, square-integrable classical additive error models with U independent of X, the observed law of W=X+U need not identify the target ψ(θ)=(Var⁡θ(Xθ),Var⁡θ(Uθ))∈[0,+∞)2. In particular, there is a two-point parametric model whose two parameter values give the same law of W but different latent-error variance pairs.

Facts & Assumptions

Given: A classical additive error model has W=X+U, and variances and independence have their probability-space meanings.

[F1]

Classical additive error is the equation W=X+U with centered U independent of X (Additive measurement error and categorical misclassification models).

[F2]

Independence of random variables means independence of their generated sigma-algebras (Independent random elements).

[F3]

For independent integrable random variables, products are integrable and their expectations factor (Expectation factors over a finite product of mutually independent random variables).

[F4]

Variance and covariance are centered expectations, and covariance is bilinear on finite sums (Moments, variance, and covariance on a probability space, Covariance is symmetric and bilinear in finite linear combinations).

[F5]

A parametric statistical model is a parameter-indexed family of sampling laws on a fixed measurable sample space (Parametric statistical models).

[F6]

An estimand is a function from the parameter set to a target space (Estimands on a statistical model).

[F7]

An estimand is identifiable only if equal sampling laws always give equal target values (Identifiability of an estimand).

Proof

1.1givenF2F3F4algebra

Let Ω={−1,1}4 with its full power set and uniform probability, and label its coordinate variables A,B,C,D. For any subsets Si⊆{−1,1} on k distinct coordinates, counting gives P(Ai∈Si for all selected i)=∏i∣Si∣2, where (A1,A2,A3,A4)=(A,B,C,D). Thus the coordinate sigma-algebras are mutually independent in the sense of [F2]. Each coordinate has mean 0 and variance 1; [F3] gives zero expectation for products of distinct coordinates, so [F4] gives their zero covariances.

2.1givenF1F2step 1.1

Define (X0,U0,W0)=(A+B,C+D,A+B+C+D) and (X1,U1,W1)=(A+B+C,D,A+B+C+D). Thus W0=W1 pointwise. For any Borel B0,B1⊆R, the event X0∈B0 is determined by (A,B) and U0∈B1 by (C,D); their preimage sets E,F⊆{−1,1}2 satisfy P((A,B)∈E,(C,D)∈F)=∣E∣∣F∣/16=(∣E∣/4)(∣F∣/4). The same count for the three-coordinate block and the last coordinate proves Xi independent of Ui for i=0,1. Both errors are centered.

2.2F3F4step 1.1algebra

Bilinearity and the zero covariances from step 1.1 give Var⁡(X0)=Var⁡(A+B)=1+1+2(0)=2, Var⁡(U0)=Var⁡(C+D)=1+1+2(0)=2, Var⁡(X1)=Var⁡(A+B+C)=1+1+1+2(0+0+0)=3, and Var⁡(U1)=Var⁡(D)=1. The variance pairs (2,2) and (3,1) are different.

3.1F5F6F7step 2.1step 2.2algebra∎

Let Θ={0,1}, take sample space (R,B(R)), and define Pi to be the law of Wi. Then P:i↦Pi is a parametric model [F5], and ψ(i)=(Var⁡(Xi),Var⁡(Ui)) is an estimand [F6]. Since W0=W1, P0=P1, but step 2.2 gives ψ(0)≠ψ(1). This violates the defining implication for identifiability [F7], so the split is not identifiable from the observed law of W alone.

Depends on

Used by

Dependency tree · two levels

19 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