Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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 two-resource allocation LP and its central path

Example

Allocate one unit between two resources by minimizing x1+2x2 subject to x1+x2=1 and x1,x2≥0. The exact optimum is 1, at (1,0).

Facts & Assumptions

Given: The LP, the strict-interior logarithmic barrier objective t(x1+2x2)−log⁡x1−log⁡x2, and the exact candidate x1(1)=(5−1)/2, x2(1)=(3−5)/2 at t0=1.

[F1]

The exact central point has gap at most m/t (Exact central points have barrier gap m/t or nu/t).

[F2]

For valid inputs with positive-definite restricted barrier Hessian and finite primal value, the short-step theorem gives the stated count from a strictly feasible centered start, provided the exact Newton solver is supplied and the finite caps permit all required updates (Short-step path following takes O(νlog⁡(ν/(εt0))) Newton steps).

[F3]

The orthant log barrier −log⁡x1−log⁡x2 has parameter ν=2 (The orthant logarithmic barrier has parameter equal to its dimension).

Verification

1.1givenalgebra

Substituting x2=1−x1, stationarity of the barrier objective gives −t−1/x1+1/x2=0, or 1/x2−1/x1=t. Multiplying by x1x2>0 and using x1+x2=1 yields tx12+(2−t)x1−1=0. Its roots are (t−2±t2+4)/(2t); because t2+4>∣t−2∣, only the plus root is positive. Thus x1=(t−2+t2+4)/(2t), and rationalizing 1−x1 gives x2=2/(t+2+t2+4)>0. These coordinates sum to one and satisfy stationarity. The restricted second derivative is 1/x12+1/x22>0, so the stationary point is the unique exact central point. At t0=1 these become the values in Given, whose reciprocal difference is 1; hence the supplied start is exact and its decrement is zero.

2.1F1F2F3step 1.1algebra∎

The central inequality multipliers are λi=1/(txi)>0. Their difference is λ2−λ1=(1/t)(1/x2−1/x1)=1, so the equality multiplier y=1−λ1=2−λ2 satisfies both dual stationarity equations. Every primal feasible vector has objective x1+2x2=1+x2≥1, while (1,0) attains 1, so p∗=1 and the objective excess is x2. The primal-dual gap is x1λ1+x2λ2=2/t; hence x2≤2/t by [F1]. By [F3], ν=2. For 0<ε<3, put K=⌈log⁡(3/ε)/log⁡(1+1/(82))⌉, supply exact solves of the scalar restricted Newton equations, and choose Nout≥K and Nin≥2. Their scalar Hessian is positive by step 1.1. With the exact t0=1 start from that step and p∗=1, all hypotheses of [F2] hold, so at most K path updates suffice, with at most two corrections each.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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