Codex @codex  0

Take a locally finite trivializing cover $(U_{\alpha })$ of the real vector bundle $E$, and a subordinate smooth partition of unity $({\rho }_{\alpha })$. Each trivialization identifies its fibers with ${\mathbb{R}}^m$ and hence supplies a smooth Euclidean inner product $g_{\alpha }$ there. DefineEach weighted term extends by zero outside its chart, since the weight has support within that chart. Local finiteness makes the sum smooth in every bundle chart. At each $b$ at least one weight is positive; for $v\ne 0$ every nonzero contribution to $g_b(v,v)$ is positive. Thus $g$ is a smooth positive-definite fiber metric, which is precisely an inner product varying smoothly with the fibers.

A G-structure on a vector bundle is a reduction of its frame bundle from $GL(m,\mathbb{R})$ to $G$: a principal $G$-subbundle $P\subseteq \mathrm{Fr}(E)$ whose extension of structure group is the full frame bundle. Equivalently, it is a choice of smooth local frames with transition matrices in $G$, and the reduction consists of the right $G$-orbits of these frames. The adapted frames are part of the structure, not merely a statement that an individual fiber has a basis.

Given a fiber metric, the Gram-Schmidt process transforms any smooth local frame into Euclidean orthonormal frames. At each step the squared norm to be divided out is positive, so the divisions and positive square roots depend smoothly on the base point. Two such frames differ by an orthogonal matrix. All the orthonormal frames therefore form a principal $O(m)$ reduction, an orthogonal structure on a real vector bundle.

Conversely, let $P$ be an $O(m)$ reduction. A frame $u:{\mathbb{R}}^m\to E_b$ in $P_b$ definesReplacing $u$ by $uq$ for $q\in O(m)$ leaves this rule unchanged, since $q$ preserves the Euclidean inner product. It is consequently independent of the adapted frame and defines a positive-definite fiber metric. Its coefficients are smooth in local adapted frames. These constructions are mutually inverse. An $O(m)$-structure is equivalent to a smooth fiberwise inner product.

For $SO(m)$, the additional condition is an orientation of a vector bundle. Such a reduction supplies consistently oriented orthonormal frames, since its transition determinants are $+1$. Conversely an orientation together with a fiber metric selects the oriented Euclidean orthonormal frames and gives an $SO(m)$ reduction. ThusIt is not true for every real bundle. The Möbius line bundle is obtained from $[0,2\pi ]\times \mathbb{R}$ by $(2\pi ,v)\sim (0,-v)$. If it had an orientation, hence a nowhere-zero continuous section, its coefficient on the interval would satisfy $f(2\pi )=-f(0)$ while staying nonzero. The intermediate value theorem makes that impossible. Since $SO(1)=\{1\}$, it has no $SO(1)$ reduction. For each $m\ge 1$, its direct sum with a trivial rank-$(m-1)$ bundle has transition matrix $\mathrm{diag}(-1,1,\dots ,1)$ and determinant line equal to the Möbius line. It is also nonorientable and has no $SO(m)$-structure. This obstruction concerns the bundle's orientation, independently of the existence of a metric.

The exterior derivative is the real-linear degree-one operator $d:{\Omega }^k\to {\Omega }^{k+1}$ characterized by its usual derivative on functions, the graded Leibniz ruleand $d^2=0$. In local coordinates,These rules determine it uniquely, and the coordinate formula shows its existence and invariance under coordinate changes. It also commutes with pullback of a differential form.

On the unit ball let $V=x^i{\partial }_i$ be the radial vector field, and let $F_t(x)=tx$. For $k\ge 1$ define the radial homotopy operator byHere the vectors are identified using the ambient Euclidean coordinates. Equivalently $h_k\omega ={\int }_0^1{t}^{-1}{F}_t^{\ast }({\iota }_V\omega )dt$, where ${\iota }_V$ is the interior product. The apparent factor $t^{-1}$ is harmless: the coordinate coefficients of its integrand contain $t^{k-1}$, so the integral is smooth at $t=0$ and depends smoothly on $x$. This is a linear map to ${\Omega }^{k-1}$; set $h_0=0$.

For $t>0$, differentiation of the coordinate pullback and Cartan's magic formula giveFor completeness, Cartan’s identity follows by checking it on functions and coordinate one-forms: both sides give $V(f)$ on $f$ and $d(V(x^i))$ on $d{x}^i$. Both are degree-zero derivations of the exterior algebra, so the checks imply the identity on every local form. Integrating from zero to one provesFor positive $k$, the pullback by the constant map is zero, so this is the required identity. If $d\omega =0$ and $k\ge 1$, it follows that $\omega =d(h_k\omega )$. A chart about any point contains such a ball, proving the Poincaré lemma. In degree zero the formula is instead $h_{1}df=f-f(0)$: a constant function cannot be the image of the uncorrected homotopy identity. This degree-zero correction to radial homotopy specifies the necessary positive-degree convention in the printed request.

To treat the sphere, cover $S^2$ by the complements of its north and south poles. Each is diffeomorphic to ${\mathbb{R}}^2$, where the same star-shaped homotopy applies. A closed differential one-form $\alpha$ therefore has local primitives $f_N$ and $f_S$. On their overlap $d(f_N-f_S)=0$. This overlap is connected, so the difference is a constant $c$. Replacing $f_N$ by $f_N-c$ makes the primitives agree, and they glue smoothly to a global function. ThusThis proves directly that closed one-forms on the two-sphere are exact.

For the Hodge decomposition theorem, assume a compact oriented Riemannian manifold without boundary. The Hodge star operator is characterized by $\alpha \wedge \ast \beta =⟨\alpha ,\beta ⟩{\mathrm{vol}}_g$ and obeys $\ast \ast \alpha =(-1{)}^{k(n-k)}\alpha$. The formal $L^2$ adjoint of $d$ on $k$-forms is $\delta =(-1{)}^{n(k+1)+1}\ast d\ast$. Define the Hodge Laplacian $\Delta =d\delta +\delta d$ and the space ${\mathcal{H}}^k=\ker \Delta$ of harmonic differential forms. Integration by parts, with no boundary term, givesHence a form is harmonic exactly when it is both closed and coclosed. The Hodge decomposition theorem states that ${\mathcal{H}}^k$ is finite-dimensional and that there is the orthogonal decompositionIf a closed form has decomposition $\alpha =h+d\beta +\delta \gamma$, then $⟨\alpha ,\delta \gamma ⟩=⟨d\alpha ,\gamma ⟩=0$. Orthogonality consequently forces $\delta \gamma =0$, so its de Rham cohomology class is represented by $h$. An exact harmonic form $h=d\beta$ has $\Vert h{\Vert }^2=⟨\delta h,\beta ⟩=0$, proving uniqueness. Thus

Every top-degree form is $\omega =f{\mathrm{vol}}_g$, and $d\omega =0$ for dimensional reasons. Its Hodge star is $f$, so the formula for $\delta$ shows that $\delta \omega =0$ exactly when $df=0$. On a connected manifold this says that $f$ is constant. Therefore the harmonic top-degree forms on a closed oriented manifold form the spaceAny such smooth manifold admits a Riemannian metric; the assertion is valid for every choice of that metric.

Let $(x^i)$ and $(y^a)$ be overlapping local coordinates at $p$. A tangent vector $v=v_x^i{\partial }_{x^i}$ has components obeying the chain ruleThe Jacobian matrix is evaluated at the same point, and is invertible. For a smooth curve $a$ with $a(0)=p$, define ${\dot{a}}_x^i(0)=\frac{d}{dt}{x}^i(a(t)){|}_{t=0}$. Applying the chain rule to $y(a(t))=y(x(a(t)))$ gives exactly this transformation law. Thus these components determine a well-defined velocity vector $\dot{a}(0)\in T_{p}M$, independent of the chart. Equivalently it is the derivation $f\mapsto \frac{d}{dt}f(a(t)){|}_0$ on smooth functions. The two curve symbols used in the printed first paragraph refer to this same curve.

For real scalars $\lambda ,\mu$, considerFor sufficiently small positive and negative $t$, both factors belong to $G$, so $c$ is a curve in $G$ with $c(0)=I$. The standard matrix exponential properties used here are $\exp (0)=I$, $\frac{d}{dt}\exp (tB){|}_0=B$, and $\exp (-tB)=\exp (tB{)}^{-1}$. The product rule gives $c^{\prime }(0)=\lambda B_1+\mu B_2$. Every such linear combination is therefore a velocity at the identity.

More generally, the inclusion $j:G\hookrightarrow GL(n,\mathbb{R})$ is an embedding, so its tangent map at $I$ is injective and linear. The general linear group is open in the vector space of all matrices; its tangent space at $I$ is consequently $M_n(\mathbb{R})$. We identifyEvery tangent vector is the velocity of a curve in a manifold chart, so this subspace is precisely the set of the corresponding matrix velocities. The product construction is consistent with its vector-space operations.

Now use the stated logarithm-chart assumption. Near zero and $I$, the matrix exponential and matrix logarithm are inverse smooth maps, with $d{\exp }_0=d{\log }_I=\mathrm{id}$. Hence for any $B\in \mathfrak{g}$, $\exp (tB)$ belongs to $G$ for small $t$: $tB$ lies in the neighborhood which is the image of the logarithm. For $B_1,B_2\in \mathfrak{g}$, form the group commutatorMultiplying the exponential expansions $e^{tB}=I+tB+\frac{1}{2}{t}^2{B}^2+O(t^3)$ givesThe convergent local series $\log (I+Z)=Z-\frac{1}{2}{Z}^2+\cdots$ therefore gives $\log C(t)=t^2[B_1,B_2]+O(t^3)$. For small nonzero $t$, the matrix $t^{-2}\log C(t)$ belongs to the linear subspace $\mathfrak{g}$. A finite-dimensional linear subspace is closed, so taking its limit provesThis is the matrix commutator from a logarithm chart argument. It identifies $\mathfrak{g}$ as the Lie algebra of a matrix Lie group, with the matrix commutator as its Lie bracket. In particular, no potentially nonsmooth square-root change of parameter is needed to turn the second-order commutator into a velocity.

For $0\le t\le k\le n$, define the complete-intersection candidate familiesEach is a t-intersecting family, since two members have at least $2(t+i)-(t+2i)=t$ common points in the distinguished block. The cardinality form of the Ahlswede-Khachatrian theorem isA binomial coefficient with lower argument outside its usual range is zero. For $t=0$, or $n\le 2k-t$, the answer is $\left(\genfrac{}{}{0ex}{}{n}{k}\right)$; in the latter case every pair of $k$-sets already intersects in at least $t$ points. The displayed candidate formula also attains this value: its largest allowed index is at least $n-k$, so every $k$-set has enough points in that candidate's block. For $t=k$ the answer is one. We prove the remaining cases without assuming the complete intersection theorem as an auxiliary result.

We first record the $t=1$ case of the Erdős-Ko-Rado theorem. For $n\ge 2k$, put the ground set in a cyclic ordering. An intersecting family contains at most $k$ of its length-$k$ intervals. To see this, rotate a selected interval to end at position $n$. Intervals ending at $k,\dots ,n-k$ miss it. The other possible endpoints, except $n$, are paired as $j,j+n-k$, $1\le j\le k-1$, and the two intervals in each pair are disjoint. Thus at most $1+(k-1)=k$ intervals are selected. Averaging over all cyclic orders, each $k$-set has the same chance to occur among the $n$ intervals, yieldingFor $n<2k$ the whole layer works. This proves the $t=1$ case, including $n=2k$ without any uniqueness assertion.

We may now suppose $2\le t<k$ and $n>2k-t$. If $n=2k-t+1$, complementation of uniform intersecting families changes the problem to an intersecting family of $(k-t+1)$-sets. The just-proved case gives $M(n,k,t)=\left(\genfrac{}{}{0ex}{}{n-1}{k-t}\right)=\left(\genfrac{}{}{0ex}{}{n-1}{k}\right)$. This is $|{\mathcal{F}}_{k-t}|$, the family of all $k$-sets avoiding the last coordinate. Hence it remains to treat $n\ge 2k-t+2$.

Apply coordinate shifts of a set family with $i<j$. They preserve cardinality and t-intersection. The only way a moved member could lose an intersection point with an unmoved member is that the former moves $j$ to $i$ while the latter contains $j$ and avoids $i$. The latter's shifted partner must already belong to the original family, since otherwise it too would move; that partner would have had an intersection of size less than $t$ with the original moved member, a contradiction. If both members move, their intersection size is unchanged. Every nontrivial shift decreases the sum of all coordinates in all members, so repeated shifts terminate at a left-compressed set family. We can therefore choose a maximum family $\mathcal{A}$ left-compressed.

We prove the small-support generating lemma for extremal intersecting families, including the replacement argument responsible for the threshold. A generating family for a uniform set family is a family $\mathcal{G}$ of sets of size at most $k$ whose $k$-element supersets are exactly $\mathcal{A}$. Start with $\mathcal{G}=\mathcal{A}$. A left shift of a generator still has every $k$-element extension in $\mathcal{A}$: if the extension contains the removed coordinate it already contains the old generator; otherwise reverse that shift in the extension and use left-compression of $\mathcal{A}$. Taking all left shifts of generators, then deleting inclusion-redundant generators, therefore gives an antichain of generators with the following property: every left shift of a generator contains a generator. This normalization never enlarges the support. Choose a normalized generating family whose largest support coordinate $m$ is as small as possible.

The generators themselves are t-intersecting. Indeed, if two generators intersect in fewer than $t$ points, they can be extended to $k$-sets with intersection size $\max \{|G\cap H|,2k-n\}<t$: fill their two residual quotas with disjoint points as far as possible. This contradicts the defining property of the generated family. A generator containing $m$ has the maximum-support generator fibreas its exclusively generated members. In fact, any extra coordinate $i<m$ in the prefix supplies a generator inside $G-\{m\}+\{i\}$, which avoids $m$ and also generates that member. An exact prefix $G$ contains no other generator by the antichain property.

If two generators containing $m$ have intersection exactly $t$, they must have union $[m]$: any earlier coordinate missing from both permits shifting $m$ out of one generator and lowers their intersection below $t$. Thus tight pairs of left-compressed generators have sizes summing to $m+t$. Write ${\mathcal{G}}_a$ for the generators of size $a$ containing $m$, and put $N=n-m$. Generators avoiding $m$ still meet a shortened generator in at least $t$ points, and shortened generators in classes $a,b$ still meet in at least $t$ unless $a+b=m+t$.

SupposeWe will contradict extremality or the minimality of $m$. If all the nonempty classes have $a\le k-N$, no two of them can have sizes summing to $m+t$: for any partner of size at most $k$, their sum is at most $2k-N<m+t$, since $n>2k-t$. We may therefore shorten every generator containing $m$, preserving t-intersection and generating a family containing $\mathcal{A}$. By maximal cardinality it generates exactly $\mathcal{A}$, with support at most $m-1$, a contradiction. There must be a class with $a>k-N$.

If such a class has $2a\ne m+t$, put $b=m+t-a$. Remove classes $a,b$ and insert all shortened generators from class $a$, or instead all shortened generators from class $b$. Both replacements remain t-intersecting. The first loses exactly $|{\mathcal{G}}_b|\left(\genfrac{}{}{0ex}{}{N}{k-b}\right)$ exclusively generated members and gains at least $|{\mathcal{G}}_a|\left(\genfrac{}{}{0ex}{}{N}{k-a+1}\right)$ new members with shortened exact prefixes and tails beyond $m$; the second gives the reversed comparison. If class $b$ is empty, the first gain is positive and contradicts extremality. Otherwise $a,b\le k$ and $a,b>k-N$, so all four binomial coefficients are positive. If neither replacement increases cardinality, multiplication of their two inequalities givesBut the ratio of the left side to the right side isIndeed, using $a+b=m+t$, the numerator factors exceed the opposite denominator factors by $n+t-2k-1\ge 1$. This contradiction excludes every noncentral class with positive fibre.

Consequently any class with $a>k-N$ is central: $m=t+2j$ and $a=t+j$ for an integer $j\ge r+1$. Shorten the central generators. Each shortened set misses exactly $j$ of the $m-1$ earlier coordinates, so some coordinate $h<m$ is absent from at least $j|{\mathcal{G}}_a|/(m-1)$ of them. Call that subfamily $\mathcal{T}$. Its members are t-intersecting: a bad pair would have arisen from a tight pair whose union was $[m]$, whereas both shortened sets avoid $h$. They also meet all unchanged generators in at least $t$ points; a conflicting class would have to be the central class itself. Remove the entire central class and insert $\mathcal{T}$. The loss relative to the unaffected generators is exactly $|{\mathcal{G}}_a|\left(\genfrac{}{}{0ex}{}{N}{k-a}\right)$. Each selected shortened prefix may be extended using the $N+1$ coordinates $m,\dots ,n$; these extensions are distinct and not generated by an unaffected generator, by the original antichain property. The number restored or added is at least $|\mathcal{T}|\left(\genfrac{}{}{0ex}{}{N+1}{k-a+1}\right)$. Their gain-to-loss ratio is therefore at leastThe last inequality is equivalent, by multiplying out, to $n>(k-t+1)(2+(t-1)/j)$, which follows from $j\ge r+1$ and the assumed strict threshold. This finishes the generator replacement proof of the small-support intersection lemma:Reflection gives the analogous supporting suffix for a right-compressed optimum.

The second ingredient is the compatibility bound for complementary generating families. Let $\mathcal{H}$ generate ${\mathcal{A}}^c=\{[n]\setminus A:A\in \mathcal{A}\}$, a $(n-2k+t)$-intersecting family of $(n-k)$-sets. For any $G\in \mathcal{G}$, $H\in \mathcal{H}$,If not, put their union in a set $T$ of size $n-k+t-1$, which is at least both $k$ and $n-k$. Extend $G$ within $T$ to a $k$-set $A\in \mathcal{A}$ and $H$ within $T$ to an $(n-k)$-set $B\in {\mathcal{A}}^c$. Then $B^c\in \mathcal{A}$, but $|A\cap B^c|=|A\cup B|-|B|\le t-1$, a contradiction.

SetFirst suppose $n_{r+1}<n<n_r$. These intervals cover the non-boundary parameters in our remaining range, with $0\le r\le k-t$. The support lemma gives generators on the prefix $[t+2r]$. Write $k^{\prime }=n-k$, $t^{\prime }=n-2k+t$ and $r^{\prime }=k-t-r$. Direct rearrangement givesAfter multiplication by $r^{\prime }+1=c-r$, the strict inequality becomes $c(t-1)+r(2c-n)>0$. For $r>0$ this is exactly $n<n_r$; for $r=0$ it is $c(t-1)>0$. Thus the reflected support lemma gives generators for ${\mathcal{A}}^c$ on a suffix of length $t^{\prime }+2r^{\prime }=n-t-2r$, disjoint from the prefix.

If every prefix generator has size at least $t+r$, then $\mathcal{A}\subseteq {\mathcal{F}}_r$. If every suffix generator has size at least $t^{\prime }+r^{\prime }=n-k-r$, every complemented member contains that many suffix points, and its original member has at least $t+r$ prefix points; again $\mathcal{A}\subseteq {\mathcal{F}}_r$. At least one of these alternatives holds: otherwise generators of sizes at most $t+r-1$ and $n-k-r-1$ would have union of size at most $n-k+t-2$, violating compatibility. Since ${\mathcal{F}}_r$ itself is t-intersecting and $\mathcal{A}$ is maximum,

Finally suppose $n=n_{r+1}>2k-t+1$. The support lemma, now with index $r+1$, places $\mathcal{G}$ in $[t+2r+2]$. For the complement, the strict support inequality still places $\mathcal{H}$ in the suffix beginning at $t+2r+1$. These supports overlap in two coordinates, which is harmless for the union bound in compatibility. Either every $G$ has size at least $t+r+1$, placing $\mathcal{A}$ inside ${\mathcal{F}}_{r+1}$, or every $H$ has size at least $n-k-r$, placing $\mathcal{A}$ inside ${\mathcal{F}}_r$. If neither held, a pair of generators would have union of size at most $n-k+t-1$, again impossible.

The two candidate sizes agree at this boundary. In passing from ${\mathcal{F}}_r$ to ${\mathcal{F}}_{r+1}$, the gained sets have $t+r-1$ points in the old block and both new points; the lost sets have $t+r$ old-block points and neither new point. Their counts areThe ratio is one exactly when $(r+1)n=c(t+2r+1)$, that is, $n=n_{r+1}$. Therefore $M=|{\mathcal{F}}_r|=|{\mathcal{F}}_{r+1}|$ there. The full-level cases, the elementary $t=1$ proof, the complementary borderline case, and these strict-interval and boundary arguments establish the boxed cardinality theorem for every admissible parameter.

Put $m=p^a$, with $p$ a prime number, and $s=m-1$. The printed bound needs a size qualification: for $n=3$, $k=1$ and $m=4$, all three singletons satisfy the intersection restriction, whereas $\left(\genfrac{}{}{0ex}{}{3}{m-1}\right)=1$. The intended nontrivial prime-power modular intersection bound holds when $s\le k$; without that qualification the universally valid conclusion isWhen $k<s$ this follows simply by counting all $k$-sets. We prove the sharper intended form for $s\le k$.

Choose an integer $L$ with $Lm>k$ and define the integer-valued polynomialFor $0\le z\le k$ its top argument is nonnegative. The bottom argument has all its first $a$ base-$p$ digits equal to $p-1$. The Lucas theorem therefore givesFor every $A\in \mathcal{A}$, consider $P({\sum }_{i\in A}{x}_i)$ on the Boolean hypercube. Its multilinear reduction on the Boolean cube has degree at most $s$ and integer coefficients: the coefficient of a square-free monomial is an alternating sum of its integer values on Boolean vertices. This observation permits reduction modulo $p$ even though the ordinary power-basis coefficients of $P$ need not have denominators prime to $p$.

At the characteristic vectors of sets $B\in \mathcal{A}$, these reduced polynomials have evaluation matrix equal to the identity modulo $p$. Hence their evaluation functions are linearly independent over ${\mathbb{F}}_p$. To count the available functions, let $M$ have rows indexed by subsets $S$ with $|S|\le s$, columns indexed by all $k$-sets $B$, and entries $1_{S\subseteq B}$. Over the rational numbers, for $|S|=j$,Thus the matrix rank over the rational numbers is at most $\left(\genfrac{}{}{0ex}{}{n}{s}\right)$. Every larger integer minor is zero and remains zero modulo $p$, so the same rank bound holds over ${\mathbb{F}}_p$. This low-degree evaluation rank on a uniform layer proves

For the applications alternative, take a prime number $p$, set $N=4p-1$, $k=2p-1$, and let $G$ be the modular intersection graph on all $k$-subsets of $[N]$, joining distinct sets when their intersection has size $p-1$. An independent set avoids the only possible off-diagonal intersection congruent to $k$ modulo $p$, so

First embed $A$ as $v_A=1_A/\sqrt{2p}$ in Euclidean space. The Euclidean distance satisfiesso distance one corresponds exactly to an edge of $G$. Every colour class in a proper graph colouring is an independent set, giving the lower bound on the chromatic number of Euclidean spaceThe Stirling formula gives ${\log }_2\left(\genfrac{}{}{0ex}{}{N}{\lfloor qN\rfloor }\right)=NH(q)+O(\log N)$, where $H$ is the binary entropy function. Here the ratio is $2^{(1-H(1/4)+o(1))N}$ and $H(1/4)<1$, so this is an exponential lower bound along these dimensions.

Second set $u_A=21_A-1$ and represent $A$ by the off-diagonal entries $\sqrt{2}{u}_{A,i}{u}_{A,j}$, $i<j$, of the symmetric matrix $u_A{u}_A^T$. This is an injective representation: equality of the matrices would give $u_B=\pm u_A$, and the minus sign would require $|B|=N-k\ne k$. The common diagonal can be omitted without changing distances. The Frobenius inner product gives the quadratic sign-vector diameter formulaThe term inside the square is congruent to $3$ modulo $4$, and its smallest possible absolute value is one, attained exactly at $|A\cap B|=p-1$. Such pairs exist. Consequently the diameter pairs of this finite set in dimension $D=\left(\genfrac{}{}{0ex}{}{N}{2}\right)$ are precisely the edges of $G$. Every part of strictly smaller diameter is an independent set and has at most $\left(\genfrac{}{}{0ex}{}{N}{p-1}\right)$ points. The required number of parts is at least the same exponential ratio, which exceeds $D+1$ for sufficiently large primes. Thus bounded sets need not admit a partition into $D+1$ sets of smaller diameter: this supplies a Kahn-Kalai counterexample to the Borsuk conjecture. Both applications use the prime case of the proved prime-power result.

Couple the uniform random graph process by giving every possible edge an independent uniform label in $[0,1]$ and revealing them in increasing order. The graph at label threshold $p$ is a binomial random graph. Define ${\tau }_0$ as the first step with no isolated vertices and ${\tau }_c$ as the first connected graph. Deterministically ${\tau }_c\ge {\tau }_0$. We prove the reverse inequality with high probability by tracking the same process through a short interval.

Put $w=\frac{1}{4}\log \log n$, $p_{\pm }=(\log n\pm w)/n$, and $L=n{p}_{-}$. At $p_{-}$ the isolated vertex count $Z$ hasThe variance estimate follows by comparing two isolated-vertex indicators, whose joint-to-product probability ratio is $(1-p_{-}{)}^{-1}$. Thus $Z>0$ with high probability. Also the Markov inequality gives $Z\le \log n$ with probability tending to one.

At this same threshold, exclude every graph component with order $2\le s\le n/2$. For $2\le s\le n/\log n$, any such component contains a spanning tree. The Cayley formula and a union bound therefore giveIn this range the bracket is at most $A=e^{2}L{e}^w/n=o(1)$. Summing over $s\ge 2$ gives $O(n{A}^2/L)=O(L{e}^{2w}/n)=o(1)$. For $n/\log n<s\le n/2$, even the cut-absence bound is enough:The bracket tends to zero, so this range also has total probability $o(1)$. Consequently the graph at $p_{-}$ consists of one component of order greater than $n/2$ and its isolated-vertex set $S$, where $1\le |S|\le \log n$ with high probability.

Conditional on the entire graph at $p_{-}$, every unrevealed edge label remains independently uniform on $(p_{-},1)$. In particular,There are no isolated vertices at $p_{+}$ with high probability, because their expected value is asymptotic to $e^{-w}\to 0$. On the intersection of these events, each vertex of $S$ loses isolation by joining the original large component, never by forming a separate small component with another vertex of $S$. At every step between these two thresholds there is therefore one nontrivial component and some isolated vertices. The final isolated vertex disappears precisely when the graph becomes connected. This proves the connectivity hitting time equals disappearance of isolated vertices result:

For the critical-window probability, let $p=(\log n+\alpha (n))/n$ with $|\alpha (n)|\le B$. For each fixed $j$, the falling factorial moment of the isolated-vertex count isuniformly for such shifts. Apply the Bonferroni inequalities to the zero-count event. Its odd and even truncations bracket $\mathrm{Pr}(Z=0)$ by partial sums of ${\sum }_{j\ge 0}(-1{)}^j{e}^{-j\alpha (n)}/j!$. Since $e^{-\alpha (n)}\le e^B$, their remainders tend uniformly to zero. Hence $\mathrm{Pr}(Z=0)=e^{-e^{-\alpha (n)}}+o(1)$. The process equality just proved changes this probability by at most its $o(1)$ failure probability. ThereforeThe ratio follows because the denominator is bounded below by $e^{-e^B}>0$; no convergence of $\alpha (n)$ is needed.

The printed second conclusion has the complementary denominator and is false as written. For $\alpha (n)=0$, the printed ratio tends to $e^{-1}/(1-e^{-1})=1/(e-1)\ne 1$. Its denominator $1-e^{-e^{-\alpha (n)}}$ is correct for the probability of being disconnected. Thus either remove the leading $1-$ in the denominator or replace “connected” by “disconnected”; the proof supplies both corrected versions.

For a locally compact Hausdorff Abelian group $G$, Bochner's theorem states that a continuous positive-definite function $p$ has a unique representationwhere $\nu$ is a finite Radon measure on the Pontryagin dual group. Conversely every such measure gives a continuous positive-definite function. Here positive definiteness means ${\sum }_{i,j}{c}_i\overline{c_j}p(x_i{x}_j^{-1})\ge 0$ for all finite choices. The Abelian and continuity hypotheses are part of the theorem; the representation is not claimed for arbitrary non-Abelian groups or discontinuous functions.

First prove existence without presupposing the representation. The elementary consequences of positive definiteness give $p(x^{-1})=\overline{p(x)}$, $p(e)\ge 0$ and $|p(x)|\le p(e)$. If $p(e)=0$, then $p=0$ and take $\nu =0$. Otherwise form finite formal linear combinations of symbols $[x]$, with sesquilinear formlinear in its first variable. Positive definiteness makes this form positive semidefinite. The Cauchy-Schwarz inequality for such a form shows that null vectors are orthogonal to everything, so quotienting by them gives an inner product space. Complete it to a Hilbert space $H$. Since $G$ is Abelian, translation $U_a[x]=[ax]$ preserves the form and extends to a unitary operator. Its inverse is $U_{a^{-1}}$, so $(U_a)$ is a unitary representation. With $v=[e]$,The translated copies of $v$ span a dense subspace. MoreoverFinite sums and density, together with $\Vert U_a\Vert =1$, give strong continuity on all of $H$. This constructs the cyclic unitary representation of a positive-definite function directly.

For $f\in L^1(G)$ define the integrated unitary representation $\pi (f)=\int f(x)U_{x}dx$, with the integral applied to each vector. Its norm is at most $\Vert f{\Vert }_1$. Fubini gives $\pi (f\ast g)=\pi (f)\pi (g)$, and inversion in the Abelian group gives $\pi (f^{\ast })=\pi (f{)}^{\ast }$. Thusis a commutative C-star algebra. It is nondegenerate: choose nonnegative compactly supported functions $u_V$ of Haar integral one with supports shrinking to the identity element. Strong continuity impliesfor every $w\in H$. These form an approximate identity in the representation. Neighbourhoods may form a net, since no metrizability is being assumed here.

The Commutative Gelfand--Naimark theorem identifies $\mathcal{A}$ with $C_0(X)$, where $X$ is its character space. The positive vector functional $\omega (B)=⟨Bv,v⟩$ becomes a bounded positive functional on $C_0(X)$, so the Riesz-Markov-Kakutani representation theorem supplies a finite positive Radon measure $\rho$ withThese general representation theorems are applied to the explicitly constructed algebra; they are not an assumption of Bochner's conclusion.

For each $\theta \in X$, the functional $f\mapsto \theta (\pi (f))$ is a nonzero algebra character of $L^1(G)$, since $\pi (L^1(G))$ is dense in $\mathcal{A}$. By Question 3 it has the form $\int f(x){\chi }_{\theta }(x)dx$. The resulting map $\iota :X\to \hat{G}$ is continuous: pointwise convergence of $\theta$ on $\mathcal{A}$ gives convergence on all $\pi (f)$, and the topological character identification in Question 3 gives compact-open convergence of ${\chi }_{\theta }$. Push $\rho$ forward under $\iota$ to obtain $\nu$. This finite measure is Radon: compact subsets approximating the measure of any inverse-image Borel set have compact images, giving inner regularity; finiteness and complements then give outer regularity.

To recover $p(x)$, note that $U_x\pi (u_V)=\pi (T_x{u}_V)\in \mathcal{A}$. HenceThe left side tends to $p(x)$. On the right, $|{\Phi }_{\chi }(u_V)|\le 1$ and ${\Phi }_{\chi }(u_V)\to 1$ uniformly on compact subsets of $\hat{G}$. For completeness, the evaluation $(\chi ,x)\mapsto \chi (x)$ is jointly continuous: near $x_0$ restrict $x$ to a compact neighbourhood, control the character uniformly there, and use continuity of the fixed character. A finite cover of a compact set of characters then makes those characters equicontinuous at $e$, proving the stated uniform convergence. Continuity of $\iota$ gives uniform convergence on compact subsets of $X$, and the finite Radon measure $\rho$ makes the remaining tails arbitrarily small. Thus passage to the limit is valid even for a net, andTaking $x=e$ also gives the required total mass $p(e)$.

Conversely, a finite positive Radon measure givesIts transform is continuous. Indeed, choose a compact set of characters with arbitrarily small measure outside it; joint continuity of evaluation gives uniform continuity in $x$ near the specified point on that compact set, while the outside contribution is bounded by twice its measure. This proves continuity without using an unjustified dominated-convergence assertion for arbitrary nets.

Finally suppose two finite Radon measures have the same transform. Multiply by $f\in L^1(G)$ and integrate over $G$. Fubini shows that the measures agree on every function $\chi \mapsto {\Phi }_{\chi }(f)$. Question 3 showed that these functions are uniformly dense in $C_0(\hat{G})$. Boundedness of both measure functionals extends equality to all of $C_0(\hat{G})$; uniqueness in the Riesz representation theorem gives equality of the measures. This proves existence, uniqueness and the converse, completing Bochner's theorem. In particular $p(e)=1$ corresponds exactly to a probability measure on the dual group.

Let $G$ be locally compact, Abelian and Hausdorff, and fix a Haar measure. Write $T_{x}f(y)=f(x^{-1}y)$ and use convolutionThe L1 group algebra is a commutative Banach algebra. Here a group character means a continuous homomorphism $\chi :G\to \mathbb{T}$, not the trace of an arbitrary group representation. A Gelfand character is a nonzero multiplicative complex-linear functional on the convolution algebra. We use the conventionWith the alternative standard Fourier convention involving $\overline{\chi }$, one simply conjugates every group character in this identification.

For such $\chi$, the functional is bounded by $\Vert f{\Vert }_1$, and Fubini's theorem, the substitution $y=xz$, and the homomorphism law giveIt is nonzero: if $u\ge 0$ is nonzero in $C_c(G)$, then $f=\overline{\chi }u$ has ${\Phi }_{\chi }(f)=\int u>0$.

Conversely let $\Phi$ be an algebra character. It is automatically bounded, with $|\Phi (f)|\le \Vert f{\Vert }_1$. Indeed, extend it to the unitization by $\tilde{\Phi }(f+\lambda 1)=\Phi (f)+\lambda$. If $|\Phi (f)|>\Vert f{\Vert }_1$, the Neumann series makes $f-\Phi (f)1$ invertible, whereas its character value is zero, contradicting multiplicativity of an invertible element and its inverse.

Choose $g$ with $\Phi (g)\ne 0$ and put $\chi (x)=\Phi (T_{x}g)/\Phi (g)$. Commutativity of the group gives $(T_{x}f)\ast g=f\ast (T_{x}g)$; applying $\Phi$ yieldsThus the ratio is independent of the chosen $g$. Applying the relation successively to $T_x{T}_{y}g=T_{xy}g$ gives $\chi (xy)=\chi (x)\chi (y)$, and $\chi (e)=1$. In particular it never vanishes.

The translation map $x\mapsto T_{x}g$ is continuous in $L^1$. For $g\in C_c(G)$, translated supports near a fixed $x$ lie in one compact set; continuity on that set and a finite cover give uniform convergence of the translated values, hence $L^1$ convergence because the compact set has finite Haar measure. For general $g$, approximate by $C_c(G)$ and use $\Vert T_{x}g{\Vert }_1=\Vert g{\Vert }_1$. Therefore $\chi$ is continuous. For all integers $n$,Positive powers exclude modulus greater than one; negative powers exclude modulus less than one. Hence $|\chi (x)|=1$.