Ordinal Extensions #
Extends ℕ∞-valued complexity measures to ordinal-valued ones for universal learning theory. WithTop ℕ has a single infinity (⊤); Ordinal has ω, ω², ε₀, ... The embedding ℕ∞ ↪ Ordinal sends n ↦ n and ⊤ ↦ ω, but ordinal VC dimension can take values beyond ω.
BddAbove infrastructure for nat-to-ordinal iSup #
Ordinal has ConditionallyCompleteLinearOrderBot, not CompleteLattice,
so every ciSup/le_ciSup_of_le call needs an explicit BddAbove witness.
Key invariant: (n : ℕ) : Ordinal is always < ω, so ω bounds every
nat-cast-to-ordinal range uniformly.
Inner BddAbove: for a fixed S, the range over shattering witnesses is trivially bounded.
Outer BddAbove: the range of the full OrdinalVCDim iSup is bounded by ω. Holds for all concept classes regardless of whether VCDim is finite or infinite.
VCL tree: combines VC dimension and Littlestone dimension into a single ordinal-valued measure. Used in universal learning trichotomy.
- value : Ordinal.{0}
The ordinal value of the combined VC-Littlestone measure
- conceptClass : ConceptClass X Bool
The concept class this measures
Instances For
Ordinal VC dimension: extends VCdim to ordinal values.
Equations
- OrdinalVCDim X C = ⨆ (S : Finset X), ⨆ (_ : Shatters X C S), ↑S.card
Instances For
Ordinal Littlestone dimension.
Equations
- OrdinalLittlestoneDim X C = ⨆ (T : MistakeTree X), ⨆ (_ : MistakeTree.isShattered X C T), ↑T.depth
Instances For
Embedding: finite VCDim embeds into OrdinalVCDim.