## reference request – Closed manifolds of nonnegative curvature operator are symmetric spaces

In an online webinar, I heard (not directly) the statement that (closed) manifolds of nonnegative curvature operator $$mathcal{R}geq 0$$ are symmetric spaces. Is this a valid theorem? Any reference that contains its proof? I am not sure that in the above statement whether “positive curvature” is a part of assumptions or not.

So by the above claim, it seems that $$mathcal{R}geq 0iff$$ $$M$$ is symmetric space!

## complexity theory – Classes of Functions Closed Under Polynomial Composition – Papadimitriou Exercise 7.4.4

I am studying Computation complexity using Papadimitrious’s book: “Computational Complexity”.

I am trying to do Problem 7.4.4:

“Let $$C$$ be a class of functions from nonnegative integers to nonnegative integers. We say that $$C$$ is closed under left polynomial composition if $$f(n) in C$$ implies $$p(f(n))=O(g(n))$$ for some $$g(n) in C$$, for all polynomials $$p(n)$$. We say that $$C$$ is closed under right polynomial composition if $$f(n) in C$$ implies $$f(p(n))=O(g(n))$$ for some $$g(n) in C$$, for all polynomials $$p(n)$$.

Intuitively, the first closure property implies that the corresponding complexity class is “computational model-independent”, that is, it is robust under reasonable changes in the underlying model of computation (from RAM’s to Turing machines, to multistring Turing machines, etc.) while closure under right polynomial composition suggests closure under reductions (see the next chapter).”

Which of the following classes of functions are closed under left polynomial composition, and which under right polynomial composition?

(a) – $${n^k: k > 0 }$$

(b) – $${k cdot n: k > 0 }$$

(c) – $${k^n : k > 0 }$$

(d) – $${2^{n^k} : k > 0 }$$

(e) – $${log^k n: k > 0 }$$

(f) – $${log n}$$

After understanding the definition of closed under left/right polynomial composition, I think I was able to solve items (a), (b), (c) and (f). However, I was not able to solve items (d) and (e).

My solution for item (a):

Closed Under Left Polynomial Composition: consider an arbitrary $$f(n) in C$$ and an arbitrary polynomial $$p(n)$$. Then, $$f(n)$$ is of the form $$n^{k’}$$, for some $$k’ > 0$$ and therefore $$p(f(n))$$ is a polynomial. Let $$k”$$ be the degree of the polynomial $$p(f(n))$$. Take $$g(n) = n^{k”} in C$$ and we have $$p(f(n)) = O(g(n))$$.

Closed Under Right Polynomial Composition: same reasoning.

My solution for item (b):

Not Closed Under Left Polynomial Composition: consider as a counterexample $$f(n) = n in C$$ and $$p(n) = n^2$$. Then, $$p(f(n)) = n^2$$. For every $$g(n) = k n in C$$ we have $$O(g(n)) = O(n)$$. Since $$n^2 neq O(n)$$ we conclude.

Not Closed Under Right Polynomial Composition: the previous counterexample applies.

My solution for item (c):

Closed Under Left Polynomial Composition: Consider an arbitrary $$f(n) = k_1^n$$ and a polynomial $$p(n)$$. Notice that $$p(f(n))$$ is a polynomial in $$k_1^n$$. For sufficiently large $$n$$, there exists some $$k_2$$ such that $$p(n) leq n^{k_2}$$ and therefore $$p(f(n)) leq (f(n))^{k_2} = (k_1^{n})^{k_2} = (k_1^{k_2})^n$$. Therefore, taking $$g(n) = (k_1^{k_2})^n in C$$ we obtain that $$p(f(n)) = O(g(n))$$.

Not Closed Under Right Polynomial Composition: Consider as a counterexample $$f(n) = 2^n$$ and $$p(n) = n^2$$. Then, $$f(p(n)) = 2^{n^2}$$, which is greater than $$g(n) = k^n$$, for every fixed value of $$k$$, if $$n$$ is sufficiently large. Therefore, $$f(p(n)) not in O(g(n))$$.

My solution for (f):

Not Closed Under Left Polynomial Composition: Consider as a counterexample $$f(n) = log n$$ and $$p(n) = n^2$$. Then, $$p(f(n)) = log^2 n$$. Also, $$g(n) in C$$ implies that $$g(n) = O(log n)$$. We have $$log^2 n not in O(log n)$$.

Closed Under Right Polynomial Composition: If $$f(n) in C$$ then $$f(n) = log n$$. Given an arbitrary polynomial $$p(n)$$, we have that there exists some $$k’$$ such that, for sufficiently large $$n$$, $$p(n) < n^{k’}$$. Then, for sufficiently large $$n$$:
$$f(p(n)) leq f(n^{k’}) = log n^{k’} = k’ log n = O(log n) = O(g(n)).$$

Can anyone help me with items (d) and (e)?

Thanks in advance. Of course, corrections/comments on the other items are also welcomed.

## fa.functional analysis – When is a linear subspace to be closed in all compatible topologies

Let $$V$$ be a real vectors space, and $$W$$ be a linear subspace.

Say $$W$$ is obviously closed if, for every topology on $$V$$ that makes $$V$$ a Hausdorff locally convex topological vector space, the subspace $$W$$ is closed in $$V$$.

We know $$V$$ is obviously closed, and any finite-dimensional subspace of $$V$$ is obviously closed. Is there a known characterization of which subspaces are obviously closed? Are there other sufficient conditions for a subspace to be obviously closed? Are there other known examples?

## Download is paused on Play Store when closed in the background

Downloading apps on my new Vivo Y30, whenever I try to download to an app, I have to keep Play Store running on the background. When I try to close, my download pauses. It only resumes when I open the app again. I just want to close background process to avoid having slow performance when using my phone. Any answers will be accepted.

## Integral of an analytic complex function inside a closed disk

I am trying to solve an exercise from `Busam, Freitag Complex Analysis 2nd ed.` which also has a provided solution but I guess I did not understand it.

Here is the problem:

and the provided solution:

Why does $$f_r$$ converges to $$f$$ uniformly and how it proves that the integral vanishes?

## Detecting and understanding malware/spyware [closed]

Recently, stumbled upon the new FB 500m+ leak and decided to satisfy my curiosity and poke around.

Basically just wanted to see how 500m+ user records were kept and what info was released( it was pretty much all publicly scrapable data with ocassional email address.)

Curiosity satisfied, I guess.
BUT.. what is this! Slowed response, unusually high resource usage, ridiculous boot times, amongst other things this laptop just got a lot worse! Could it be… has BonziBuddy finally returned? No seemingly just another piece of malware…

Well to be expected I guess when you download dodgy shit, but I’d love to know what is happening in the background of my computer right now.

So my hopefully decipherable question is this:

1 Ignore anti-virus programs.

2 Using the simple tools we have at our disposal(taskmanager/monitoring active net connections/sniffing packets with wireshark.)
Is it possible for a layman to figure out exactly what is going on in the background of their computer?

I can open wireshark but I cannot figure out what is what, going where, or for what purpose(admittedly I know nothing about this software)

I can run netstat, which is like the simple-mans wireshark without the packets displayed, look at active connections and corresponding local address and foreign address, along with PID, trace that to an executable, but do I know what is actually happening?

Is it impossible to see exactly what processes are doing what because without the original code we end up with undecipherable compiled jargon?

I can see files behaving strangely(unprecedented resource hog) but that alone is meaningless, what is it actually doing and can I find out?

To those people understand my ramblings and this field of computing a bit more and are impartial enough to want to shed light, what do YOU do when you have had an infection slip under the radar? Restore/Reformat? Do you use virtual machines on suspect files? What are your red flags? Dont you ever have a desire to pirate software you cant allow yourself to buy, because its for a short period of time or the use is not for commercial gain but simply out of good old primate curiosity?

## nginx – Why is my websocket connection gets closed in 60 seconds?

I have an Angular web application proxied by nginx. There is a websocet functionality in the application and the relevant section looks as follows:

``````  location /ws {
proxy_http_version 1.1;
proxy_pass http://websocket.server:9090/ws;
}
``````

nginx is dockerized and is run on my machine by `docker-compose` in a custom built image:

``````FROM node:alpine as node-build
WORKDIR /app
RUN npm install
RUN npm run build --prod

FROM nginx:alpine
COPY --from=node-build /app/... /usr/share/nginx/html
``````
``````version: "3"
services:
frontend:
build:
context: .
ports:
- 4200:80
volumes:
- ./nginx.conf:/etc/nginx/conf.d/default.conf
``````

There is nothing else in nginx.conf except few other locations:

``````server {
listen 80;
server_name frontend;
location / {...}
location /ws {...}
location /api {...}
}
``````

I use Docker Desktop for Mac, v.3.2.1.

It works fine except that any connection to `/ws` gets closed in exactly 60 seconds, which looks like a timeout set somewhere. What should I check in order to fix it?

## What does this annoying message mean in Google search engine? [closed]

Every time you search in Google search engine, you come across this annoying and meaningless message.

What does this message mean?

## Is there any way to access iCloud Drive folders from the terminal? [closed]

I was wondering if there is any way to access the folders in iCloud Drive through the Terminal, using commands to navigate in the filesystem?

## algebraic geometry – Construction of Quot schemes and construction of certain closed subschemes

I am again studying Nitsure’s Construction of Hilbert and Quot schemes, and I am yet again stuck, this time on page 25. I understand what lemma 5.4 says, but I do not get its proof. Let me sketch the outline:

$$Xlongrightarrow S$$ is a projective morphism where $$S$$ is Noetherian, and $$psi:Elongrightarrow F$$ a surjective morphism between coherent $$X$$-sheaves. They construct a closed subscheme $$T’subseteq T$$ as follows:

(…) This is satisfied by taking $$T’$$ to be the vanishing scheme for the composite homomorphism $$ker(phi)hookrightarrow Elongrightarrow F$$ of coherent sheaves over $$X_{T}$$.

To me, the $$T’$$ thus constructed is a subset of $$X_{T}$$, not of $$T$$.

EDIT: Also, why exactly does this lemma prove that the representability of $$mathfrak{Quot}^{phi,L}_{G/X/S}$$ implies the representability of $$mathfrak{Quot}^{phi,L}_{E/X/S}$$?