Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge 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.

Intervals on the real line have VC dimension two

Example

Equip R with its Borel sigma-algebra. Let Hint be the class of indicator functions of closed bounded intervals [a,b]⊂R, where a≤b. Then VCdim⁡(Hint)=2. On any m distinct ordered sample points, its growth function has value ΠHint(m)=1+m(m+1)/2: the traces are the empty trace and all contiguous nonempty blocks of sample indices.

The sketch shows why the endpoint labeling (1,0,1) cannot be produced: an interval containing x1 and x3 also contains x2. The verification proves this for every ordered triple and counts all traces.

x1x2x3middlepointisincluded

Example references

Mohri et al., Example 3.11: two points are shattered by intervals, while three ordered points cannot realize the pattern (+,−,+).

Facts & Assumptions

Given: The class Hint of closed bounded intervals described in the Example.

[F1]

Shattering means that every binary labeling of an indexed tuple occurs in the trace. Indexed shattering and VC dimension of a binary class

[F2]

The growth function is the supremum of trace cardinalities over indexed tuples. Growth function of a binary hypothesis class

Verification

1.1F1givenconstruct

Fix x1<x2 and put r=x2−x1>0. The patterns (0,0),(1,0),(0,1),(1,1) are realized respectively by [x1−2r,x1−r] (strictly left of both points), [x1,x1], [x2,x2], and [x1,x2]. Thus the pair is shattered and the VC dimension is at least two.

2.1F1step 1.1

For any three distinct ordered points, the labeling (1,0,1) is impossible for an interval because containing x1 and x3 forces it to contain every point between them, including x2. A repeated coordinate also prevents a tuple of length at least three from being shattered, since repeated instances receive the same label under every classifier. Hence no three-point indexed tuple is shattered and the VC dimension is exactly two.

3.1F2step 2.1algebra∎

On m distinct ordered points, a nonempty interval has as its trace one contiguous block, and every such block is realized by the interval with those two sample endpoints. There are ∑r=1m(m−r+1)=m(m+1)/2 such blocks; an interval outside the finite sample realizes the empty trace. For a tuple with r≤m distinct points there are at most 1+r(r+1)/2≤1+m(m+1)/2 traces, while a distinct tuple attains that number. At m=0 the formula gives the single empty trace. Thus ΠHint(m)=1+m(m+1)/2.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

3 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