Paper I · Lean source
GeneralFiniteCompletion.lean
1 claims linked to this Lean module
These links follow the claim index. They do not extend the recorded proof or Lean coverage.
Declared contract recorded Coverage and evidence
The cited release explicitly reports completion of its registered formal contract, under its exact hypotheses.
This viewer reads the retained source; it does not run Lean or assign new claim mappings.
Local imports (1)
PaperIRelease/GeneralFiniteCompletion.lean81 lines
Original source path
formal/current/PaperIRelease/GeneralFiniteCompletion.leanSkip declarations and read code
1 import PaperIRelease.GeneralNormedPackets
2
3 /-! # The unique finite packet split on a dense completion -/
4
5 noncomputable section
6 open scoped BigOperators
7 open Set Function
8
9 namespace Komorebi.PaperIRelease.GeneralFiniteCompletion
10
11 open Komorebi.PaperIRelease.GeneralNormedPackets
12
13 variable {𝕜 X ι : Type*} [NormedField 𝕜]
14 variable [NormedAddCommGroup X] [NormedSpace 𝕜 X] [Fintype ι]
15
16 /-- Bounded operators whose restrictions form a packet system on a dense
17 submodule form the same packet system on the ambient normed space. -/
18 def extendPacketFamily
19 (M : Submodule 𝕜 X) (hM : M.topologicalClosure = ⊤)
20 (P : ι → X →L[𝕜] X) (Q : ContinuousProjectorFamily 𝕜 M ι)
21 (hext : ∀ i (x : M), P i x = (Q.proj i x : X)) :
22 ContinuousProjectorFamily 𝕜 X ι where
23 proj := P
24 idempotent i x := by
25 have hd : DenseRange (fun y : M ↦ (y : X)) := by
26 exact (Submodule.dense_iff_topologicalClosure_eq_top.mpr hM).denseRange_val
27 have he : (fun y : X ↦ P i (P i y)) = (fun y : X ↦ P i y) := by
28 apply hd.equalizer (by fun_prop) (by fun_prop)
29 funext y
30 change P i (P i (y : X)) = P i (y : X)
31 rw [hext i y, hext i (Q.proj i y), Q.idempotent i y]
32 exact congrFun he x
33 annihilate := by
34 intro i j hij x
35 have hd : DenseRange (fun y : M ↦ (y : X)) := by
36 exact (Submodule.dense_iff_topologicalClosure_eq_top.mpr hM).denseRange_val
37 have he : (fun y : X ↦ P i (P j y)) = (fun _ : X ↦ (0 : X)) := by
38 apply hd.equalizer (by fun_prop) continuous_const
39 funext y
40 change P i (P j (y : X)) = 0
41 rw [hext j y, hext i (Q.proj j y), Q.annihilate hij y]
42 rfl
43 exact congrFun he x
44 complete x := by
45 have hd : DenseRange (fun y : M ↦ (y : X)) := by
46 exact (Submodule.dense_iff_topologicalClosure_eq_top.mpr hM).denseRange_val
47 have he : (fun y : X ↦ ∑ i, P i y) = (fun y : X ↦ y) := by
48 apply hd.equalizer (by fun_prop) continuous_id
49 funext y
50 change (∑ i, P i (y : X)) = (y : X)
51 simp_rw [hext]
52 exact_mod_cast Q.complete y
53 exact congrFun he x
54
55 /-- Each extended packet is exactly the closure of its dense-subspace
56 packet. No closedness or completeness of the dense subspace is required. -/
57 theorem extended_packet_range
58 (M : Submodule 𝕜 X) (hM : M.topologicalClosure = ⊤)
59 (P : ι → X →L[𝕜] X) (Q : ContinuousProjectorFamily 𝕜 M ι)
60 (hext : ∀ i (x : M), P i x = (Q.proj i x : X)) (i : ι) :
61 (M.map (P i).toLinearMap).topologicalClosure = (P i).range :=
62 ContinuousProjectorFamily.idempotentRange_eq_closure_map (P i)
63 ((extendPacketFamily M hM P Q hext).idempotent i) M hM
64
65 /-- There is at most one continuous ambient extension of every projector
66 in the dense packet system. This is uniqueness of the whole split, rather
67 than merely uniqueness of one extracted range. -/
68 theorem extension_unique
69 (M : Submodule 𝕜 X) (hM : M.topologicalClosure = ⊤)
70 (P R : ι → X →L[𝕜] X) (Q : ContinuousProjectorFamily 𝕜 M ι)
71 (hP : ∀ i (x : M), P i x = (Q.proj i x : X))
72 (hR : ∀ i (x : M), R i x = (Q.proj i x : X)) : P = R := by
73 have hd : DenseRange (fun y : M ↦ (y : X)) := by
74 exact (Submodule.dense_iff_topologicalClosure_eq_top.mpr hM).denseRange_val
75 funext i
76 apply DFunLike.coe_injective
77 apply hd.equalizer (P i).continuous (R i).continuous
78 funext x
79 exact (hP i x).trans (hR i x).symm
80
81 end Komorebi.PaperIRelease.GeneralFiniteCompletion
Original file and source record
This copy matches the recorded source file. Its publication here does not change the work’s review status.
SHA-256: b6d68deea3362098681b1706612c838de66156b167afe97a4a0312338b8fdc40
Back to Paper I: Typed Operator Systems, Seed Rank, and Exact Packet Coordinates