Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Smooth maps transverse to a regular foliation

Definition

Assume Countable Choice ACω (The Axiom of Countable Choice (ACω)), the standing assumption of the smooth-distribution setting (Smooth distributions on a manifold). Let F be a regular foliation of M with tangent distribution D=TF, the integrable smooth subbundle of TM supplied by Regular foliations and integrable distributions correspond (Vector subbundles). Let N be a smooth manifold and f:N→M a smooth map with differential dfx:TxN→Tf(x)M (The differential of a smooth map).

Then f is transverse to F at x∈N when

dfx(TxN)+Df(x)=Tf(x)M,

and transverse to F, written f⋔F, when this holds at every x∈N. When N⊆M and f is the inclusion of an embedded submanifold, the condition reads TxN+Dx=TxM at every x∈N: this is the pointwise sum condition of Transverse smooth maps applied with the leaf distribution D in place of the tangent space of a second submanifold, so the definition specialises the published transversality of smooth maps to the leaf distribution. The condition forces dim⁡N≥codim⁡F at every point, since dim⁡(dfx(TxN))≤dim⁡N and the sum with the (n−q)-dimensional space Df(x) fills the n-dimensional space Tf(x)M. When codim⁡F=0 the condition is automatic, because then Df(x)=Tf(x)M.

Depends on

Used by

Dependency tree · two levels

24 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