Kyprianou.ProofPreparation.finite_nonzero_indices_of_finite_count_sum
ProvedKyprianou.ProofPreparation.finite_nonzero_indices_of_finite_count_sumcandidate-decomposition
Automatically extracted helper theorem Kyprianou.ProofPreparation.finite_nonzero_indices_of_finite_count_sum from oversized parent candidate 81a258adc97c4344f640c13016c61161d02554f5de4b4ab7ab8267bce3298d43.
Preamble
import Mathlib import Definitions.Def_LeanLevy_Processes_LevyProcess import Definitions.Def_Kyprianou_Ch01_LevyTripletExponent import Definitions.Def_KLSModular_LevyStochCalc_Poisson_RandomMeasure import Definitions.Def_Kyprianou_Ch02_CompletedPoissonFiltration set_option pp.explicit true set_option pp.fullNames true set_option pp.universes true open MeasureTheory ProbabilityTheory Filter Complex open scoped NNReal ENNReal Nat Topology set_option autoImplicit false
Formal statement
namespace Kyprianou.ProofPreparation
theorem finite_nonzero_indices_of_finite_count_sum
(N : ℕ → ℕ)
(hfin : (∑' k, (N k : ENNReal)) < ⊤) :
Set.Finite {k : ℕ | N k ≠ 0} := by sorry
end Kyprianou.ProofPreparation
Source
candidate-decomposition:2004a3aa-1f5c-4edd-8bf7-f67523bab94c:81a258adc97c4344f640c13016c61161d02554f5de4b4ab7ab8267bce3298d43