Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

The frame bundle of a smooth manifold

Definition

Assume ACω (The Axiom of Countable Choice (ACω)), inherited from the smooth tangent-bundle theorem. Let M be a smooth m-manifold with m≥1. Its tangent bundle TM=⨆x∈MTxM carries the canonical smooth 2m-manifold structure of Assuming countable choice, the tangent bundle has a canonical smooth 2n-manifold structure (The tangent bundle as a disjoint union, Smooth manifolds and their smooth charts). The frame bundle of M is the frame bundle of the tangent bundle in the sense of Frame bundles and associated vector bundles, B(M):=Fr⁡(TM)={(x,b):x∈M, b:Rm→TxM a linear isomorphism}, the total space of the principal GLm(R)-bundle of Invertible matrices and the general linear group GL⁡n(F) associated with TM. It carries the smooth structure induced by the linear bundle charts of TM (locally U×GLm(R), the second factor an open subset of the matrix space), the smooth projection π:B(M)→M, π(x,b)=x, and the free smooth right action (x,b)⋅A=(x,b∘A) of GLm(R), whose orbits are exactly the fibres B(M)x; each fibre is therefore a GLm(R)-torsor. A framing of the point x∈M is an element (x,b) of the fibre B(M)x, equivalently a linear isomorphism b:Rm→TxM.

The fibre B(M)x has exactly two path components, the two orientation classes of bases of TxM (Orientation of a finite-dimensional real vector space). Indeed the determinant det⁡:GLm(R)→R× is a surjective continuous group homomorphism (Determinant is a group homomorphism GL⁡(V)→F×, and det⁡(T−1)=det⁡(T)−1), so its sign separates GLm(R) into the nonempty open sets of positive and negative determinant, and the torsor action identifies these with B(M)x; left multiplication by diag⁡(−1,1,…,1) identifies the negative-determinant matrices with the positive-determinant matrices, which are path-connected by Positively oriented bases of an oriented vector space are path-connected, so these are exactly the two path components. When M is oriented, a chart of M whose coordinate frame is positive at a point gives the identification of B(M)x with the positive and negative bases used here (Oriented smooth manifolds and oriented charts).

A framing of a closed 0-dimensional submanifold N⊆M is a framing of N in M in the sense of the normal-quotient convention: since dim⁡N=0, the normal bundle ν(N⊆M)=∐x∈NTxM/TxN is ∐x∈NTxM over the discrete set N (Normal and conormal bundles of an embedded submanifold), so a framing of N is exactly a family (bx)x∈N of linear isomorphisms bx:Rm→TxM, that is, a family of framings of the individual points x∈N. If N is compact it is finite: its singleton subsets form an open cover and admit a finite subcover.

Finally, if M is oriented, the sign of a framing (x,b) is ε(b)=+1 when the isomorphism b carries the standard orientation of Rm (the one for which the standard basis is positive) to the given orientation of TxM, and ε(b)=−1 otherwise. Two framings of the same point have the same sign exactly when they lie in the same component of B(M)x: the sign is constant on a component because it is a continuous function with values in {±1}, and the two components are the positive and the negative bases for the given orientation. No orientation of M is needed for the definition of B(M) or of a framing, and this definition selects nothing beyond the supplied chart data of M.

Depends on

Used by

Dependency tree · two levels

55 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