Vanishing of atomic mass on a coordinate fibre
Provedtsum_subtype_eq_zero_of_forall_mem_starAlgebra_adjoin_coord_tsum_mul_eq_of_noAtomLet be a type and a compact subset of with the product topology. Let be complex numbers with summable, let be points of , let be a continuous -linear functional, let be a finite subset of and let . Two hypotheses are imposed. First, carries no mass on cylinders at around : for every there is a family of sets with open and for all , such that for every satisfying for all and whenever has for some . Second, is computed by the atomic sum on the coordinate algebra: for every in the unital -subalgebra of generated by the coordinate functions and , . The conclusion is that the sum of over the subtype of indices with for all equals .
This is a separation statement for atomic measures: a functional with no mass near on the finitely many coordinates in forces the atoms lying in the level- fibre of to cancel, the coordinate -algebra being uniformly dense by Stone–Weierstrass. It is used in the analytic input to the comparison of fibre sums for automorphic forms, via AutomorphicForm.forall_finset_fibreSum_sub_const_mul_fibreSum_add_eq_zero_of_forall_places_exists_noAtomicMass_wordSum_eq.
import Mathlib set_option maxHeartbeats 4000000 set_option synthInstance.maxHeartbeats 400000 set_option backward.isDefEq.respectTransparency.types false set_option autoImplicit false open scoped ComplexConjugate
theorem tsum_subtype_eq_zero_of_forall_mem_starAlgebra_adjoin_coord_tsum_mul_eq_of_noAtom
{ι : Type*} (X : Set (ι → ℂ × ℂ)) (hX : IsCompact X)
(a : ℕ → ℂ) (ha : Summable fun i => ‖a i‖) (x : ℕ → X)
(Λ : C(X, ℂ) →L[ℂ] ℂ) (F : Finset ι) (τ : ι → ℂ × ℂ)
(hcyl : ∀ ε > (0 : ℝ), ∃ U : ι → Set (ℂ × ℂ), (∀ k ∈ F, IsOpen (U k) ∧ τ k ∈ U k) ∧
∀ g : C(X, ℂ), (∀ y : X, (∃ k ∈ F, (y : ι → ℂ × ℂ) k ∉ U k) → g y = 0) →
(∀ y, ‖g y‖ ≤ 1) → ‖Λ g‖ < ε)
(hid : ∀ g ∈ StarAlgebra.adjoin ℂ
((Set.range fun k : F => (⟨fun y : X => ((y : ι → ℂ × ℂ) k).1,
((continuous_apply (k : ι)).comp continuous_subtype_val).fst⟩ : C(X, ℂ))) ∪
Set.range fun k : F => (⟨fun y : X => ((y : ι → ℂ × ℂ) k).2,
((continuous_apply (k : ι)).comp continuous_subtype_val).snd⟩ : C(X, ℂ))),
∑' i, a i * g (x i) = Λ g) :
∑' i : {i : ℕ // ∀ k ∈ F, ((x i : X) : ι → ℂ × ℂ) k = τ k}, a i = 0 := by sorry