Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

VC-subgraph classes, envelopes, and the first-unshattered index

Definition

Let (X,A) be a measurable space and let F be a class of measurable real-valued functions on it. The subgraph of f∈F is

Cf:={(x,t)∈X×R:t<f(x)}.

It is measurable in A⊗B(R): the coordinate lifts are measurable by The product sigma-algebra and its finite iterates, their difference is measurable by Arithmetic and lattice operations preserve measurability whenever they are defined, and its strict negative set is measurable by Threshold characterisations of real-valued and extended-real-valued measurability. The class F is a VC-subgraph class when the set family CF:={Cf:f∈F} has finite VC index as defined in Shattering, VC dimension, and first-unshattered index for set classes. For nonempty F, write d(F) for the greatest size of a finite shattered set (zero if none is shattered) and

V(F):=d(F)+1,

equivalently the least positive integer V for which no V-point set is shattered. If no finite such integer exists, set V=+∞. The empty class is treated separately and assigned index V=0 by convention. Thus for every nonempty finite-index class, the VC dimension is exactly V−1.

A measurable envelope of F is a nonnegative measurable function F on X such that ∣f(x)∣≤F(x) for every f∈F and x∈X. In an Lr(Q) assertion, changing F on a Q-null set does not change its norm or the distances in that assertion.

Depends on

Used by

Dependency tree · two levels

20 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