Probabilistic Schubert Calculus

Abstract

We initiate the study of average intersection theory in real Grassmannians. We define the expected degree edeg G(k,n) of the real Grassmannian G(k,n) as the average number of real k-planes meeting nontrivially k(n-k) random subspaces of Rn, all of dimension n-k, where these subspaces are sampled uniformly and independently from G(n-k,n). We express edeg G(k,n) in terms of the volume of an invariant convex body in the tangent space to the Grassmanian, and prove that for fixed k 2 and n∞, edeg G(k,n) = deg GC(k,n)12 εk + o(1), where deg GC(k,n) denotes the degree of the corresponding complex Grassmannian and εk is monotonically decreasing with k∞ εk = 1. In the case of the Grassmannian of lines, we prove the finer asymptotic equation* edeg G(2,n+1) = 83π5/2n\, (π24 )n (1+O(n-1)). equation* The expected degree turns out to be the key quantity governing questions of the random enumerative geometry of flats. We associate with a semialgebraic set X⊂eqRPn-1 of dimension n-k-1 its Chow hypersurface Z(X)⊂eq G(k,n), consisting of the k-planes A in Rn whose projectivization intersects X. Denoting N:=k(n-k), we show that E\#(g1Z(X1)·s gN Z(XN)) = edeg G(k,n) · Πi=1N |Xi||RPm|, where each Xi is of dimension m=n-k-1, the expectation is taken with respect to independent uniformly distributed g1,…,gm∈ O(n) and |Xi| denotes the m-dimensional volume of Xi.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…