Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-05
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.

Local sections of a distribution are freely generated by a local frame

Statement

Let D be a rank-k smooth distribution on M.

  1. Γ(D) is a C(M)-submodule of the module of smooth vector fields on M.
  2. If UM carries a local frame X1,,Xk of D, then every YΓ(DU) has a unique expression Y=i=1kfiXi with smooth functions fi on U.

Facts & Assumptions

Given: A rank-k smooth distribution D on M.

[A1]

Fix an open set U on which D has a local frame X1,,Xk.

Proof

technique · direct
1.1

If Y,ZΓ(D) and f,gC(M), then [given] (fY+gZ)p=f(p)Yp+g(p)Zp lies in the linear subspace Dp for every p. Hence Γ(D) is closed under addition and smooth scalar multiplication.

given
1.2

On U, the vectors X1(q),,Xk(q) form a basis of Dq, [given] so each YqDq has unique coefficients fi(q) with Yq=ifi(q)Xi(q). Because Y and the frame fields are smooth, those coefficients are smooth on U.

given
1.3

Therefore the assignment UΓ(DU) is locally free [given] of rank k: on every frame domain its section module is freely generated by that frame. This is a statement about the sheaf of local sections; it does not assert that the global module Γ(D) is free over C(M).

given

Depends on

Used by

Dependency tree · two levels

11 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