Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: Literature-sourcedPipeline-generatedjudge pass (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Real projective space shows coefficient-dependent perfectness

Example

Assume ACω. Regard RPn as the quotient of Sn by the antipodal map and let f([x]):=∑i=0n(i+1)xi2, which is well defined because the squared coordinates are antipodally invariant. Its critical points are the n+1 coordinate axes [e0],…,[en], of indices 0,1,…,n, so Mf(t)=1+t+⋯+tn. By the cellular homology of real projective space, bk(RPn;F2)=1 for 0≤k≤n (all boundary maps vanish mod two), so f is F2-perfect; over any field of characteristic different from two, b0=1, bk=0 for 0<k<n and bn=1 exactly when n is odd, so for n≥2 we get b1=0<1=m1 and f is not perfect. For every field the Euler identity holds: ∑k(−1)k=1 for even n and 0 for odd n, which equals χ(RPn).

Facts & Assumptions

Given: An integer n≥1, the quotient RPn=Sn/(x∼−x) of the unit sphere, and the function f([x])=∑i=0n(i+1)xi2.

[F1]
[F2]

The Morse numbers and Morse polynomial are mk(f)=#{p:ind⁡(p)=k} and Mf(t)=∑kmk(f)tk; the Poincare polynomial is PX,F(t)=∑kdim⁡FHk(X;F)tk; f is F-perfect when mk(f)=bk(RPn;F) for all k (Morse numbers and the Morse polynomial, Poincare polynomial of a space and of a pair over a field, Perfect Morse function over a field).

[F3]

RPm has a CW structure with one cell in each dimension 0,…,m whose integral cellular complex has Cj=Z, dj=2 for positive even j and dj=0 for odd j (Real projective space cellular homology and the pinch map).

[F4]

Cellular homology computes singular homology for every coefficient group (Cellular homology computes singular homology).

[F5]

In the situation of the Morse polynomial identity, mk(f)≥bk(M;F) for every k, so a strict inequality mk(f)>bk(M;F) excludes perfectness (Weak Morse inequalities).

[L1]

The Euler characteristic of a finite CW complex is χ(X)=∑n(−1)ncn(X) (Euler characteristic of a finite CW complex).

Verification

technique · direct-computation
1.1givenconstruct

The formula f([x])=∑i(i+1)xi2 is well defined on the quotient because replacing x by −x leaves every squared coordinate unchanged; the quotient RPn is the familiar closed smooth n-manifold with the standard charts uj=xj/xi around the axis [ei].

2.1F1F2step 1.1algebra

Write λj=j+1. A tangent vector v to the unit sphere at x satisfies x⋅v=0, and the differential of the lifted function is 2∑jλjxjvj. It vanishes on all such v exactly when (λjxj)j is a scalar multiple of x. Since the λj are distinct, at most one coordinate of a critical point is nonzero. Thus the critical classes are exactly the axes [ei]. In the chart uj=xj/xi for j≠i, f(u)=λi+∑j≠iλjuj21+∑j≠iuj2. Expanding at zero gives f(u)=λi+∑j≠i(λj−λi)uj2+O(∣u∣4), so the Hessian is diag⁡(2(j−i))j≠i, with exactly i negative entries. Every critical point is nondegenerate of index i, and Mf(t)=1+t+⋯+tn.

3.1F3F4F2step 2.1

Over F2 the cellular complex of [F3] reads Cj=F2 with dj=2=0 for all j, so Hj(RPn;F2)=F2 for 0≤j≤n and zero otherwise, by [F4]; hence bk=1=mk for all k and f is F2-perfect with correction polynomial Q=0.

3.2F3F4F5step 2.1

Over a field F of characteristic different from two the same complex reads Cj=F with dj=2 invertible for positive even j and dj=0 for odd j; taking kernels modulo images gives H0=F, Hj=0 for 0<j<n, and Hn=F if n is odd and Hn=0 if n is even. Thus for n≥2 we have b1(RPn;F)=0<1=m1(f), and f is not F-perfect by [F5].

4.1L1F3step 2.1∎

Finally, for every field the Euler identity holds: ∑k=0n(−1)kmk(f)=∑k=0n(−1)k equals 1 for even n and 0 for odd n, while χ(RPn)=1 for even n and 0 for odd n by [L1] applied to the cell counts of [F3] (one cell in each dimension 0,…,n). The alternating sums of the Betti numbers agree with the same value in both characteristics, consistent with the Euler identity.

Remarks

  • The case n=1. Here RP1≅S1: over any field b0=b1=1 and m0=m1=1, so f is perfect over every field; the coefficient dependence begins in dimension n≥2.
  • What the example shows. A function can be perfect over F2 and imperfect over fields of characteristic different from two, so perfectness is a field-relative notion, exactly as the coefficient-field remark records; the Euler identity, by contrast, holds in every characteristic.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

62 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources