Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Checking the subreciprocal condition for the quadratic log bound

Example

For (x)=2 on (0,1/2), the subreciprocal inequalities are 1<2<1/x and log2(x)=1. At x=1/16 the classical density fraction with symbolic constant C>0 is 216C.

Facts & Assumptions

Given: (x)=2, 0<x<1/2, and C>0 symbolic.

[F1]

From Subreciprocal function and ell divisibility: A function :(0,1/2)(0,) is subreciprocal when it is nonincreasing and satisfies 1<(x)1/x throughout its domain.

[F2]

From Fox sudakov quantitative induced density bound: δ=2CH(log2(1/x))2

Verification

1.1

The constant function is positive and nonincreasing. For 0<x<1/2, reciprocation gives 1/x>2>1, so it meets [F1]. Also 21=2, hence log2(x)=1.

F1given
2.1

The value 1/16 lies in that interval, and log2(1/(1/16))=log216=4. Substitution into [F2] with CH=C yields exponent C42=16C and fraction 216C. Here C is a symbolic admissible constant, not a numerically certified constant for arbitrary H.

F2step 1.1algebra

Source notes

Proof/convention locator: Bucic, Nguyen, Scott and Seymour, Induced subgraph density I, Section 5, ell=2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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