Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-01
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.

Transverse fibre products are embedded submanifolds

Statement

Let F:M→N and G:P→N be smooth and transverse. Then the fibre product

M×NP:={(p,q)∈M×P:F(p)=G(q)}

is an embedded submanifold of M×P.

Facts & Assumptions

Given: Smooth maps F:M→N and G:P→N with F⋔G.

[F1]

Two smooth maps are transverse when their differential images span the target tangent space at every coincidence point (Transverse smooth maps).

[L1]

The diagonal ΔN⊆N×N is an embedded submanifold (The diagonal is an embedded submanifold).

[L2]

Products of smooth maps are smooth, and the transverse preimage theorem applies to a map transverse to an embedded submanifold (Restrictions, corestrictions, and products of smooth maps are smooth, The transverse preimage theorem).

Proof

technique · direct
1.1L1L2given

Define H:M×P→N×N by H(p,q)=(F(p),G(q)). By [L2], H is smooth, and H−1(ΔN)={(p,q):F(p)=G(q)}=M×NP.

2.1F1step 1.1algebra

At a point (p,q) with F(p)=G(q)=y, the tangent space to ΔN is {(u,u):u∈TyN}. Therefore transversality of H to ΔN means that every pair (a,b)∈TyN×TyN can be written as (a,b)=(dFpu,dGqv)+(w,w). This is equivalent to a−b∈dFp(TpM)+dGq(TqP), which is exactly [F1].

3.1L1L2step 2.1∎

Hence H⋔ΔN, so [L2] applied with [L1] shows that M×NP is an embedded submanifold of M×P.

Depends on

Used by

Dependency tree · two levels

17 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