Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

A redundant Bernoulli parameterization has a nonidentifiable coordinate

Statement refuted

For every parametric statistical model with parameter (u,v)∈Θ⊆[0,1]2, the first-coordinate target ψ(u,v)=u is identifiable.

Facts & Assumptions

Given: The parameter set Θ, finite sample space, law family and target stated above.

[F1]

Sigma-algebras: a sigma-algebra contains the whole space and is closed under complements and countable unions; the full power set satisfies these conditions.

[F2]

Measurable spaces and measurable sets: a measurable space is a set together with a sigma-algebra on it.

[F3]

Probability measures and probability spaces: a probability measure has total mass 1 and is countably additive on measurable sets.

[F4]

Statistical experiments: an experiment is a parameter-indexed family of probability measures on the sample measurable space.

[F5]

Parametric statistical models: each parameter is sent to its sampling law Pu,v.

[F6]

Estimands on a statistical model: the first coordinate ψ(u,v)=u is a function to [0,1].

[F7]

Identifiability of an estimand: an estimand is identifiable only if equal sampling laws imply equal target values.

[F8]

Identifiability is constancy on observational classes: identifiability is equivalent to a unique factorization of the target through the set of model laws.

Counterexample

Take X={0,1} with A=2X and

Θ:={(u,v)∈[0,1]2:u+v≤1}.

For each (u,v)∈Θ, define

Pu,v(A):=(u+v) 1{1∈A}+(1−u−v) 1{0∈A}(A∈A),

and set ψ(u,v)=u. The law depends only on the sum, while the target is the first coordinate.

Given: The redundant two-parameter Bernoulli family and first-coordinate target stated above.

1.1givenF1F2F3F4algebra

The full power set contains X and is closed under finite unions and complements, so it is an algebra of subsets. Every countable union of its members is still a subset of X, so it is a sigma-algebra by [F1] and gives a measurable space by [F2]. For every (u,v)∈Θ, both masses u+v and 1−u−v are nonnegative and sum to 1. In a pairwise disjoint sequence of events, each singleton {0} and {1} appears at most once, so the displayed formula is countably additive. Thus Pu,v is a probability measure by [F3], and the family is an experiment by [F4].

2.1givenF5F6F7F8algebra∎

The points (u,v)=(1/5,1/2) and (u′,v′)=(3/10,2/5) have coordinates in [0,1], and their sums are 1/5+1/2=2/10+5/10=7/10 and 3/10+2/5=3/10+4/10=7/10≤1, so both belong to Θ. Both measures assign 7/10 to {1} and 3/10 to {0}; the four events ∅,{0},{1},X consequently have probabilities 0,3/10,7/10,1 under both laws, so Pu,v=Pu′,v′. But ψ(u,v)=1/5≠3/10=ψ(u′,v′). By [F7], ψ is not identifiable; by [F8], it cannot factor through the model-law set.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

14 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.