Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

A discrepancy can test auxiliaries as well as field assumptions

Physical scope

Elementary conditional statement about a declared affine response model inside the framework's record vocabulary: the parameter pairs (s,b) and (s+δ,b−Gδ) produce identical predictions, so comparison through this model alone constrains only Gs+b and cannot separate the pairs without additional independent information that distinguishes them. Independently fixing background or source strength is sufficient. It asserts nothing about any apparatus, no historical claim, no dataset, no sampling law and no probability; it is an exact algebraic nonidentifiability of the declared model.

Example

Let the record vocabulary be that of Report-backed operational evidence with uncertainty, and adopt a declared affine response model in which the model prediction for a recorded comparison quantity is y(s,b):=G s+b, where G>0 is a declared response coefficient (with declared units [recorded]/[source]), s∈R a declared source-strength parameter and b∈R a declared background parameter in the units of the recorded quantity; the model is part of the record's analysis assumptions. Then:

(i) [Exact ambiguity] For every δ∈R, y(s+δ, b−Gδ)=G(s+δ)+(b−Gδ)=Gs+b=y(s,b), by the field arithmetic of R (The reals form a totally ordered field makes R a totally ordered field). Hence the two parameter pairs (s,b) and (s+δ,b−Gδ) produce the same predicted value at every recorded coordinate, and every recorded value or declared closed bound interval compatible with the prediction of one pair is compatible with the prediction of the other.

(ii) [Nonidentifiability] When G≠0 and δ≠0 the two pairs are distinct, yet their model predictions coincide; consequently comparison through the affine model alone constrains only the combination Gs+b. For an exact recorded equality y(s,b)=z it fixes that combination to z; for a declared bound ∣y(s,b)−z∣≤r, r≥0, it only constrains it to [z−r,z+r]. It cannot distinguish the pairs without additional independent information that distinguishes them. Independently fixing b or s is sufficient, though other independently declared constraints can also distinguish the pairs.

(iii) [Explicit instance] With G=2, s=3, b=1 and δ=1 one has y(3,1)=2⋅3+1=7 and y(4,−1)=2⋅4−1=7, so the pairs (s,b)=(3,1) and (4,−1) are indistinguishable by the recorded value 7 alone; the same holds for every declared bound interval, since the two predictions coincide exactly.

(iv) [Status] This is a deterministic algebraic nonidentifiability statement about the declared affine response model. It asserts no property of any apparatus, no historical value, no dataset and no statistical or probabilistic claim; it records that a discrepancy (or an agreement) can test the auxiliary background and calibration parameters as well as the field or source assumptions of a model, so that attributing a recorded outcome to one premise requires independent information resolving the ambiguity.

Verification

Proof technique: direct substitution in the field R and immediate consequences of the declared record vocabulary.

Given: a declared affine response model y(s,b)=Gs+b with G>0, and the record vocabulary of Report-backed operational evidence with uncertainty; a parameter displacement δ∈R.

[F1] R with its order and field operations is a totally ordered field (The reals form a totally ordered field), so distributivity, associativity, commutativity, additive inverses and the order axioms hold in R.

[F2] The vocabulary of Report-backed operational evidence with uncertainty includes a declared apparatus-and-preparation description (clause (c)), a calibration model with a declared error bound when one is available (clause (e)), an analysis-assumption list (clause (g)) and an interpretation comparing the record with a specified model prediction (clause (h)). The affine model above is such a declared analysis assumption. The vocabulary does not establish the correctness or completeness of an apparatus description, calibration correctness, a sampling law or a probability (clauses (c), (d), (e) and (i)).

1.1F1givenalgebra

For every δ∈R the predicted value of the displaced pair (s+δ, b−Gδ) is G(s+δ)+(b−Gδ)=Gs+Gδ+b−Gδ=Gs+b: distributivity gives G(s+δ)=Gs+Gδ, associativity and commutativity of addition regroup the four terms as Gs+(Gδ−Gδ)+b, and Gδ−Gδ=0 with Gs+0+b=Gs+b; hence y(s+δ,b−Gδ)=y(s,b) for every common recorded coordinate, which is clause (i).

2.1F2step 1.1

Any recorded value or declared closed bound interval compatible with the prediction of the pair (s,b) is compatible with the prediction of (s+δ,b−Gδ): a recorded value equal to the predicted value is equal to the other predicted value by step 1.1, and a declared interval of the form [y−r,y+r] with r≥0 is unchanged because its centre is unchanged; the argument applies at every recorded coordinate and to every declared calibration box of clause (e), so comparison through this affine response alone does not separate the pairs.

2.2F1step 1.1

If G≠0 and δ≠0 then the measured coordinates of the two parameter pairs differ: the source-strength coordinates s+δ and s differ because δ≠0, and the background coordinates b−Gδ and b differ because Gδ≠0; thus (s+δ,b−Gδ)≠(s,b) in R2 while their predictions coincide by step 1.1, which is clause (ii).

2.3step 1.1algebra

The explicit instance of clause (iii) is the arithmetic evaluation y(3,1)=2⋅3+1=7 and y(4,−1)=2⋅4−1=8−1=7 at G=2, s=3, b=1 and δ=1, where the displaced pair is (s+δ,b−Gδ)=(4,1−2)=(4,−1).

3.1F1step 1.1step 2.2givenalgebra

Comparison through the affine model alone constrains only Gs+b: an exact equality to z fixes this combination to z, while ∣Gs+b−z∣≤r constrains it to [z−r,z+r] and need not determine its value. Two pairs (s1,b1) and (s2,b2) have the same prediction exactly when Gs1+b1=Gs2+b2; taking δ=s2−s1 then gives b2=b1−Gδ. Thus the family {(s+δ,b−Gδ):δ∈R} is exactly the set of pairs with the same prediction. Independent information is needed to distinguish its members: fixing s fixes b through the prediction, and fixing b fixes s since G≠0. These are sufficient examples, not the only possible independent constraints.

4.1F2step 1.1step 2.1step 3.1step 2.3given∎

Clause (iv) records the status of the preceding steps: the identity is a deterministic algebraic statement about the declared affine response model, registered as the record's analysis assumption by clause (g) of [F2]; no apparatus property, historical value, dataset, sampling law or probability is asserted. Agreement or discrepancy tests the conjunction of the model with its declared auxiliary parameters; independent information of the kind described in step 3.1 is needed to resolve their ambiguity before attributing an outcome to a field or source premise.

Depends on

Dependency tree · 2 levels

Sources