Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

The diagonal and graph classes contract to the alternating trace

Statement

Assume AC (The Axiom of Choice). Let M be a closed oriented smooth n-manifold and f:M→M smooth. For a homogeneous basis αp,j of Hp(M;Q), choose the dual basis βp,j∈Hn−p(M;Q) with ⟨βp,j⌣αp,k,[M]⟩=δjk. In the cohomology-first cap convention, PD[ΔM]=∑p,j(−1)pβp,j×αp,j. Writing γf(x)=(x,f(x)) for the graph map, ⟨γf∗PD[ΔM],[M]⟩=⟨PD[Γf]⌣PD[ΔM],[M×M]⟩=L(f). The graph Poincare dual is characterized by ⟨PD[Γf]⌣φ,[M×M]⟩=⟨γf∗φ,[M]⟩ for every degree-n cohomology class φ. When n≥1 and the fixed points are nondegenerate, this value is I(f), the graph-diagonal intersection number in the local displacement convention u−v (Geometric Lefschetz number (index sum), The geometric intersection pairing on a closed oriented manifold).

Facts & Assumptions

Given: M,f, the bases, and AC as in the statement.

[F1]

The orientation-twisted diagonal realizes the Lefschetz trace supplies the normalized diagonal class, the signed dual-basis expansion, graph-pullback trace, and nondegenerate local evaluation. The chosen orientation trivializes its orientation coefficient system. Manifold components are open by local path-connectedness (Topological manifolds are locally compact and locally path connected, A connected, locally path-connected space is path-connected, because its path components are open), hence compactness gives finitely many, and homology splits over them (The singular homology of a disjoint union is the direct sum).

[F2]

Poincare duality is the inverse of cohomology-first cap with the fundamental class (The cap-duality map of an oriented manifold, Poincaré duality for oriented topological manifolds). Cup and cap satisfy the composition and naturality formulas (Cap naturality and projection formula, Kronecker evaluation pairing).

[F3]

The local displacement convention u−v identifies the graph-diagonal local signs with fixed-point indices (The local intersection sign of graph against diagonal is sign det(I-Df), The geometric intersection pairing on a closed oriented manifold).

Proof

1.1givenF1F2

For disconnected M, apply [F1] on each component: the diagonal has support only in C×C, and the product components C×D with C≠D have zero diagonal class. In component-adapted bases its expansion is the sum of the component expansions; it is independent of the basis since a basis change and its inverse dual change cancel in the tensor sum. Components mapped to a different component have zero diagonal trace block and no diagonal intersection. Thus the graph-pullback trace identity also sums over the components, including the empty case. Trivialize the orientation system by the given orientation of M. The cap-normalized diagonal class of [F1] becomes PD[ΔM] by [F2]. Its expansion is exactly the displayed formula, and [F1]'s graph pullback gives ⟨γf∗PD[ΔM],[M]⟩=L(f).

2.1F2step 1.1

Since the graph is oriented by γf, its fundamental homology class is (γf)∗[M]. For every degree-n class φ, [F2] gives ⟨PD[Γf]⌣φ,[M×M]⟩=⟨φ,PD[Γf]∩[M×M]⟩=⟨φ,(γf)∗[M]⟩=⟨γf∗φ,[M]⟩. Taking φ=PD[ΔM] proves the cup contraction identity from step 1.1.

3.1F1F3step 1.1step 2.1∎

If n≥1 and the fixed points are nondegenerate, [F1] evaluates this graph pullback as the sum of the local signs sign⁡det⁡(I−Dfx). By [F3] this is both I(f) and the stated graph-diagonal intersection number. AC is inherited from [F1] and Poincare duality.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

96 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