OAI/Analysis/LipschitzHilbert/Packets/PacketLatticeRestriction.lean
12 declarations, 0 contain sorry, 0 declared as axioms
Exact label restriction and finite tag partitions for the unrestricted packet family. Neither operation changes a packet or a lattice site.
- def
OAI.LipschitzHilbert.PacketLatticeData.restrictedLabelsline 16 - def
OAI.LipschitzHilbert.PacketLatticeData.restrictedOriginalLabelline 19 - theorem
OAI.LipschitzHilbert.PacketLatticeData.restrictedLabel_keptline 23 - def
OAI.LipschitzHilbert.PacketLatticeData.restrictedLabelEquivline 28 - def
OAI.LipschitzHilbert.PacketLatticeData.restrictLabelsline 35 - theorem
OAI.LipschitzHilbert.PacketLatticeData.restrictLabels_physicalPacketline 46 - theorem
OAI.LipschitzHilbert.PacketLatticeData.restrictLabels_lengthline 51 - theorem
OAI.LipschitzHilbert.PacketLatticeData.restrictedLabels_card_leline 54 - def
OAI.LipschitzHilbert.PacketLatticeData.tagLabelEquivline 60 - theorem
OAI.LipschitzHilbert.PacketLatticeData.tagLabelEquiv_applyline 66 - theorem
OAI.LipschitzHilbert.PacketLatticeData.sum_tag_restrictionsline 73Source documentation
The partition has exactly one copy of each original term, including arbitrary empty label fibers and empty spatial item types.
theorem sum_tag_restrictions {E : Type*} [AddCommMonoid E] (j : Fin N) (f : ∀ l : P.labels j, Item j l → E) : (∑ g : Tag, ∑ l : (P.restrictLabels (fun i a => tag i a=g)).labels j, ∑ u : Item j l, f (P.restrictedOriginalLabel (fun i a => tag i a=g) j l) u) = ∑ l : P.labels j, ∑ u : Item j l, f l u := by … - def
OAI.LipschitzHilbert.PacketLatticeData.withProfileline 86Source documentation
Replacing the analyzing profile keeps all physical geometry.
def withProfile (alt : ∀ j (l : P.labels j), Item j l → κ → SchwartzMap (ℝ×ℝ) ℂ) (hAlt : ∀ j l u k, planarProfileConstant (alt j l u k) (2*P.order) ≤ P.profileBound) : PacketLatticeData N κ Label Item := …Mentions: OAI.LipschitzHilbert.planarProfileConstant, OAI.LipschitzHilbert.PacketLatticeData