4.5 KiB
Finite Dataset Anti-Infinity Doctrine
Purpose
This note records the modeling correction:
Infinite datasets are not physical datasets.
They are ideal limits.
If treated as directly instantiated data, they behave like NaN: undefined, non-measurable, non-addressable, and non-computable as an object.
The project should use finite prefixes, finite emission windows, finite corpora, finite samples, finite precision, and explicit limiting statements only as audit devices.
Core Statement
no actual infinite dataset
no infinite temporal cheating
no infinite active-cell reservoir
no infinite precision witness
no treating asymptotic notation as measured evidence
yes finite prefix
yes finite window
yes finite corpus
yes finite witness
yes limit theorem as a statement about a sequence of finite objects
Doctrine
An infinite set may be valid as a mathematical object, but it is not a dataset. A dataset must be:
addressable
bounded by a storage representation
sampled or generated by a finite procedure
associated with a finite witness or prefix when audited
measured with finite precision
Therefore:
infinite dataset = invalid engineering object
infinite dataset as direct evidence = NaN
infinite dataset as limit of finite receipts = allowed
Correct Use of Infinity
Allowed:
A_N = finite active set at scale N
prove a theorem about the sequence (A_N) as N -> infinity
report finite benchmark receipts for concrete N
state asymptotic behavior only with explicit limiting assumptions
Forbidden:
claiming an infinite dataset was processed
using an infinite limit as if it were a measured finite result
hiding missing density evidence inside unlimited time or unlimited sample size
treating infinite state space as an available computational resource
Relation to Sidon Density
The target
limsup_{N -> infinity} A(N) / sqrt(N) = 1
is not a dataset claim. It is a limit claim over finite prefixes.
The required evidence stack is:
for each finite N:
finite emission window T_emit(N)
finite active set I_active(N)
finite encoding A_N = { Phi(i) : i in I_active(N) }
finite pair-sum audit for A_N or theorem proving pair-sum injectivity
then:
prove the asymptotic limit over the finite sequence of receipts
Relation to Timelike Emission
Because emission is physical and timelike:
T_emit(N) must be finite
E_N must be finite
I_active(N) must be finite
all recoverable phonon events must be counted inside a finite window
The model may choose scale-dependent finite windows, but may not let time run forever for fixed N to accumulate enough active cells.
Relation to Computation
For computation and benchmarking, every claim must reduce to:
finite input
finite state
finite runtime or explicit timeout
finite output
finite measurement precision
finite receipt hash
If a construction only works by appealing to an actually infinite dataset or infinite precision, it fails the engineering gate.
Audit Rule
Use this rule in reviews:
Infinity is allowed only as a theorem-level limit operator.
Infinity is not allowed as a data source, runtime, storage object, witness, or empirical result.
Receipt Types
FinitePrefixReceipt
FiniteWindowReceipt
FiniteCorpusReceipt
FinitePrecisionReceipt
FiniteRuntimeReceipt
FiniteWitnessReceipt
AsymptoticLimitReceipt
NoInfiniteCheatingReceipt
Lean-Oriented Skeleton
structure FiniteReceipt where
N : Nat
witness : Type
finite_witness : Prop
structure PrefixFamily where
prefix : Nat -> Type
finite_prefix : forall N, Prop
structure LimitClaim where
family : PrefixFamily
asymptotic_statement : Prop
structure NoInfiniteDatasetClaim where
finite_input : Prop
finite_runtime : Prop
finite_output : Prop
finite_precision : Prop
Audit Classification
Receipt: FiniteDatasetAntiInfinityDoctrine
Status: STABILITY_CORRECTION
Gate: U_scope
Reason: this is a necessary modeling discipline rule. It does not prove the Sidon or phonon selector theorem, but it prevents treating infinite objects as empirical or computational receipts.
Boundary
This note does not reject mathematical infinity. It rejects treating infinity as a dataset or engineering object.
Correct doctrine:
An infinite set can be a theorem target.
A dataset must be finite.
A measurement must be finite.
A witness must be finite.
A limit claim must be proven from finite prefixes, not hand-waved from an infinite object.