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

Conflicting labels, a soft-margin optimum, and the meaning of its score

Example

Take X=R, H=R, ϕ(x)=x, and k(x,z)=xz. For C>0 and the ordered sample (−1,−1),(1,+1),(1,−1), the soft-margin SVM has the optimum w=0, b=−1, ξ=(0,2,0) with objective 2C; dual multipliers are α=(0,C,C) and μ=(C,0,0). Its score is −1 at x=1, where the sample has one positive and one negative label. Applying the separately specified logistic map σ(t)=(1+e−t)−1 to that score gives 1/(1+e), not the empirical positive-label frequency 1/2. These are finite-sample quantities; the SVM score is not a probability supplied by the SVM optimization.

Facts & Assumptions

Given: The feature map, the ordered sample, C>0, and the soft-margin definition.

[F1]

The soft-margin constraints and objective are those in the hard- and soft-margin SVM definition (Hard- and soft-margin support-vector machines with an unpenalized bias).

[F2]

The SVM KKT equations include w=∑iαiyiϕ(xi), ∑iαiyi=0, C−αi−μi=0, and complementarity for both inequality families (Soft-margin SVM duality and KKT conditions).

[F3]

The feature map ϕ(x)=x realizes the positive semidefinite linear kernel k(x,z)=xz (Linear and polynomial kernels as finite feature inner products).

Verification

1.1givenF1F3constructalgebra

The feature map in [F3] realizes the stated linear kernel. At w=0, b=−1, the scores at all three observations equal −1. Their signed margins are respectively 1,−1,1, so ξ=(0,2,0) satisfies every soft-margin constraint, with objective 2C.

2.1step 1.1F1algebra

For any feasible tuple, let t=w+b, the score at x=1. The two observations at x=1 require ξ2≥max⁡(0,1−t) and ξ3≥max⁡(0,1+t). If −1≤t≤1 these lower bounds sum to 2; if t>1, the second is 1+t>2; and if t<−1, the first is 1−t>2. Thus ξ2+ξ3≥2 for every feasible tuple, and its objective is at least C(ξ2+ξ3)≥2C.

3.1step 1.1step 2.1F1F2algebra

The candidate in [step 1.1] is therefore globally optimal. For α=(0,C,C) and μ=(C,0,0), ∑iαiyiϕ(xi)=C−C=0=w, ∑iαiyi=C−C=0, and C−αi−μi=0 for all three indices. Each margin constraint is active, so αigi(m)=0; also μiξi=0 for each i. These are the KKT conditions in [F2].

4.1step 1.1step 3.1F2algebra∎

The dual objective is ∑iαi−12∥∑iαiyiϕ(xi)∥2=2C, equal to the primal value. The score at x=1 is −1, while the empirical positive-label frequency among the two observations at x=1 is 1/2. The logistic transform of the score is (1+e)−1≠1/2; the SVM optimization does not assert that this transformed value is a probability.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

13 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