Timeline for A Theorem of Mihklin-Hörmander for $n=1$

13 events

when toggle format	what		by	license	comment
Feb 2 at 10:26	history	edited	Kadmos	CC BY-SA 4.0	added 9 characters in body
Jan 20 at 11:16	vote	accept	Kadmos
Jan 20 at 11:16	answer	added	Kadmos		timeline score: 2
Jan 17 at 18:17	review	Close votes
Jan 19 at 2:58
Jan 15 at 10:14	history	edited	Kadmos	CC BY-SA 4.0	never ending typos
Jan 15 at 8:43	history	edited	Kadmos	CC BY-SA 4.0	edited body
S Jan 15 at 6:41	history	suggested	Indecisive	CC BY-SA 4.0	Fixed grammar, spelling, parentheses
Jan 15 at 5:18	review	Suggested edits
S Jan 15 at 6:41
Jan 14 at 19:50	comment	added	user408858		Appreciate the effort, but the post seems a bit long
Jan 14 at 19:44	history	edited	Kadmos	CC BY-SA 4.0	added 120 characters in body
Jan 14 at 19:42	comment	added	Kadmos		@Aruralreader, thank you. I have edited the title. the proof is mostly irrelevant for what I am asking, it is just that I claimed that I solved it for $n\geq 2$, so I added the proof... My trouble is for $n=1$ and for that one doesn't need to read what I have done: my argument does not generalize nicely.
Jan 14 at 18:42	history	edited	Kadmos	CC BY-SA 4.0	added 47 characters in body
Jan 14 at 18:14	history	asked	Kadmos	CC BY-SA 4.0