اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA streamlined proof of Goodwillies n-excisive approximation
272
0
0.0
(
0
)
تأليف
Charles Rezk
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We give a shorter proof of Lemma 1.9 from Goodwillie, Calculus III, which is the key step in proving that the construction P_nF gives an n-excisive functor.
قيم البحث
اقرأ أيضاً
In 1947, N.E. Steenrod defined the Steenrod Squares, which are mod 2 cohomology operations, using explicit cochain formulae for cup-i products of cocycles. He later recast the construction in more general homological terms, using group homology and a
cyclic model methods, rather than explicit cochain formulae, to define mod p operations for all primes p. Steenrods student J. Adem applied the homological point of view to prove fundamental relations, known as the Adem relations, in the algebra of cohomology operations generated by the Steenrod operations. In this paper we give a proof of the mod 2 Adem relations at the cochain level. Specifically, given a mod 2 cocycle, we produce explicit cochain formulae whose coboundaries are the Adem relations among compositions of Steenrod Squares applied to the cocycle, using Steenrods original cochain definition of the Square operations.
We give describe several models for $(infty,n)$-categories, with an emphasis on models given by diagrams of sets and simplicial sets. We look most closely at the cases when $n leq 2$, then summarize methods of generalizing for all $n$.
We show that the prequantum line bundle on the moduli space of flat $SU(2)$ connections on a closed Riemann surface of positive genus has degree 1. It then follows from work of Lawton and the second author that the classifying map for this line bundl
e induces a homotopy equivalence between the stable moduli space of flat $SU(N)$ connections, in the limit as $N$ tends to infinity, and $mathbb{C}P^infty$. Applications to the stable moduli space of flat unitary connections are also discussed.
In 1730 James Stirling, building on the work of Abraham de Moivre, published what is known as Stirlings approximation of $n!$. He gave a good formula which is asymptotic to $n!$. Since then hundreds of papers have given alternative proofs of his resu
lt and improved upon it, including notably by Burside, Gosper, and Mortici. However Srinivasa Ramanujan gave a remarkably better asymptotic formula. Hirschhorn and Villarino gave a nice proof of Ramanujans result and an error estimate for the approximation. In recent years there have been several improvements of Stirlings formula including by Nemes, Windschitl, and Chen. Here it is shown (i) how all these asymptotic results can be easily verified; (ii) how Hirschhorn and Villarinos argument allows a tweaking of Ramanujans result to give a better approximation; (iii) that a new asymptotic formula can be obtained by further tweaking of Ramanujans result; (iv) that Chens asymptotic formula is better than the others mentioned here, and the new asymptotic formula is comparable with Chens.
An $n$-correct node set $mathcal{X}$ is called $GC_n$ set if the fundamental polynomial of each node is a product of $n$ linear factors. In 1982 Gasca and Maeztu conjectured that for every $GC_n$ set there is a line passing through $n+1$ of its nodes
.So far, this conjecture has been confirmed only for $nle 5.$ The case $n = 4,$ was first proved by J. R. Bush in 1990. Several other proofs have been published since then. For the case $n=5$ there is only one proof: by H. Hakopian, K. Jetter and G. Zimmermann (Numer Math $127,685-713, 2014$). Here we present a second, much shorter and easier proof.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
