Inter
ProvedComponentPrunedLimitLaws.EventuallyPeriodic.interaether-catalogapplications
Formal statement of ComponentPrunedLimitLaws.EventuallyPeriodic.inter from the Aether Catalog (Applications). The mathematical content is given by the Lean statement below; a human-readable write-up is pending.
theorem ComponentPrunedLimitLaws.EventuallyPeriodic.inter{S T : Set ℕ}
(hS : EventuallyPeriodic S) (hT : EventuallyPeriodic T) :
EventuallyPeriodic (S ∩ T) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Applications/PosetTheory/PruningSpectra.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Applications/PruningSpectra.lean
import Mathlib
import Definitions.Def_Applications_PruningSpectra
/-!
# Arithmetic spectra and component-count saturation
This file isolates two deterministic mechanisms used in limit-law arguments for
component-pruned sparse random structures.
* `EventuallyPeriodic` is the one-dimensional form of semilinearity relevant to
order spectra. We prove closure under Boolean operations.
* `CountEquivalent q` records a component multiplicity exactly below `q` and only
records "at least `q`" above it. We prove that disjoint union (addition) respects
this finite-state abstraction.
The final theorem is contrarian: an unrestricted, input-dependent pruning shift
can turn the finite spectrum `{0}` into an arbitrary prescribed tail. Thus
semilinearity of the unpruned spectrum alone cannot imply a limit law when the
cutoff is allowed to oscillate without regularity assumptions.
-/
open ComponentPrunedLimitLawsFormal statement
theorem ComponentPrunedLimitLaws.EventuallyPeriodic.inter{S T : Set ℕ}
(hS : EventuallyPeriodic S) (hT : EventuallyPeriodic T) :
EventuallyPeriodic (S ∩ T) := by sorrySource