Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-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.

Graph-diagonal transversality is exactly fixed-point nondegeneracy

Statement

Let M be a smooth n-manifold, f:M→M smooth, Γf its graph and ΔM the diagonal (The graph of a smooth map is an embedded submanifold, The diagonal is an embedded submanifold), and let γf(x)=(x,f(x)). For a fixed point x the following are equivalent:

(i) Γf and ΔM are transverse at γf(x) (Transverse embedded submanifolds), i.e. Tγf(x)Γf+Tγf(x)ΔM=Tγf(x)(M×M) in the canonical splitting T(x,x)(M×M)≅TxM⊕TxM of Canonical tangent and cotangent splittings for products;

(ii) I−Dfx is invertible (Invertible linear maps, linear isomorphisms, and inverse linear maps);

(iii) x is a nondegenerate fixed point (Nondegenerate fixed point).

For x∉Fix⁡(f) one has γf(x)∉ΔM and transversality at γf(x) holds automatically. Consequently the graph map γf is transverse to ΔM if and only if every fixed point of f is nondegenerate.

Facts & Assumptions

Given: A smooth n-manifold M, a smooth map f:M→M, a point x∈M, the graph Γf, the diagonal ΔM and the graph map γf=⟨idM,f⟩.

[F1]

Γf and ΔM are embedded submanifolds of M×M of dimension n; the first projection restricts to a smooth bijection with smooth inverse γf on Γf, and likewise the diagonal map δM=⟨idM,idM⟩ is a smooth bijection onto ΔM with smooth inverse the first projection (The graph of a smooth map is an embedded submanifold, The diagonal is an embedded submanifold, The diagonal ΔX⊆X×X, the diagonal map δX, and the pairing ⟨f,g⟩ of two maps).

[L1]

The map γf is smooth with components π0∘γf=idM, π1∘γf=f, and the canonical splitting identifies T(x,x)(M×M) with TxM⊕TxM through the differentials of the two projections; the chain rule computes differentials of composites (Products of smooth manifolds have a canonical product smooth structure, Canonical tangent and cotangent splittings for products, The chain rule for differentials of smooth maps, The differential of a smooth map).

[L2]

S⋔T at p means TpS+TpT=TpM (Transverse embedded submanifolds).

[L3]

An endomorphism of a finite-dimensional space is surjective if and only if it is injective, by Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T; and I−Dfx is invertible exactly when it is bijective, by Invertible linear maps, linear isomorphisms, and inverse linear maps.

Proof

1.1givenF1L1

Tangents of graph and diagonal. Since the first projection restricts to a diffeomorphism Γf→M with inverse γf by [F1], its differential identifies Tγf(x)Γf with the image of d(γf)x; by [L1] and the chain rule, the components of d(γf)x(v) are dπ0(dγx(v))=d(idM)x(v)=v and dπ1(dγx(v))=dfx(v)=Dfxv, so Tγf(x)Γf={(v,Dfxv):v∈TxM}. The same computation for δM gives T(x,x)ΔM={(v,v):v∈TxM}.

2.1step 1.1L2L3

The sum of the two tangent spaces. Writing vectors of the splitting as pairs, a pair (a,b) lies in Tγf(x)Γf+T(x,x)ΔM exactly when there are u,v∈TxM with (a,b)=(v,Dfxv)+(u,u)=(u+v,u+Dfxv), i.e. exactly when b−a=(Dfx−I)v is in the image of Dfx−I. Hence the sum is all of TxM⊕TxM if and only if Dfx−I is surjective; as an endomorphism of the finite-dimensional space TxM this holds if and only if Dfx−I is invertible by [L3], and Dfx−I is invertible if and only if I−Dfx is.

3.1step 2.1given∎

Conclusion. For a fixed point x, clause (i) holds if and only if the sum of step 2.1 is the whole tangent space, i.e. if and only if I−Dfx is invertible, which is clause (ii), and this is the definition of nondegeneracy, clause (iii). If x∉Fix⁡(f), then γf(x)=(x,f(x))∉ΔM because f(x)≠x, so there is no point of Γf∩ΔM over x and the transversality condition at γf(x) is vacuous; the equivalence for the graph map therefore reduces to the fixed points, giving the stated global criterion. No orientation of M, no metric and no choice principle is used.

Depends on

Used by

Dependency tree · two levels

45 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