Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck pendingverified 2026-10-23 (gpt-6.1-sol)
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.

Unseen input invalidates a training-law guarantee

Example

Let ds=2, D=(0,1)2, and I=[0,1]. Let X consist of the constant product-measurable fields ce1:D×I→R2, where c∈R and e1=(1,0), with norm ∥ce1∥X=∣c∣ and its Borel σ-algebra; thus X is isometric to R and is a separable real Banach space. Let Z={0,1} with its power-set σ-algebra and define S(z)=0, S~(0)=0, S~(1)=Me1 for arbitrary M>0, and J(ce1)=c, which is 1-Lipschitz. An X-valued simple map means a map with finite range and measurable fibers. A map is strongly measurable with respect to a probability law if, outside a measurable set of measure zero, it is a pointwise norm limit of a sequence of simple maps. Here S and S~ are themselves simple maps, so their constant approximating sequences establish strong measurability for either law below. For z∈Z, define the Dirac law δz by δz(E)=1 if z∈E and 0 otherwise. Take training law μ=δ0 and target law ν=δ1. Then the training-law mean-square state error is zero, while the target-law observable bias is M. Absolute continuity ν≪μ means that μ(E)=0 implies ν(E)=0 for every measurable E⊆Z. The target law is not absolutely continuous with respect to the training law, so the bounded-density hypothesis of the shift certificate fails; as M is arbitrary, training-law error alone supplies no finite uniform target-bias bound.

Facts & Assumptions

Given: The field domain D×I, the normed space X, the finite input set and its power-set σ-algebra, the maps S,S~, the observable J, the laws μ,ν, and M>0 stated in the Example.

[A1]

μ=δ0 and ν=δ1 are probability measures on Z.

[F1]

Lipschitz observable bias under bounded law shift: the stated target-bias certificate requires a target density g≤C with respect to the training law and a population mean-square training error bound.

Verification

Given: The data in [A1] and the Example.

1.1givenA1F1algebra

The norm identifies X isometrically with R, the maps have finite range and all their fibers are measurable because every subset of Z is measurable, so they are simple maps and their constant approximating sequences prove strong measurability as defined in the Example, and J is 1-Lipschitz; thus the state-space and measurability hypotheses of [F1] hold. Under μ=δ0, both S(0) and S~(0) equal zero, so Eμ∥S−S~∥X2=0; the separate state second moments are also finite because the maps have finite range.

2.1givenA1step 1.1algebra

Under ν=δ1, J(S(1))=0 and J(S~(1))=M, hence ∣EνJ(S)−EνJ(S~)∣=M. Since M is arbitrary, the target bias can be arbitrarily large while the training-law error remains zero.

3.1givenA1F1step 2.1∎

The set {1} has μ-measure zero and ν-measure one. If a target density g existed, then ν({1})=∫{1}g dμ=0, a contradiction; hence ν≪̸μ and the density hypothesis in [F1] fails.

Depends on

Dependency tree · 2 levels

Sources