Alphabeta Math
PropositionStatement: 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.

Local coordinate expression for a differential form

Statement

On a chart (U,x1,,xn), every smooth differential k-form ω has a unique expression

ω=1i1<<iknωi1ikdxi1dxik

with smooth coefficient functions ωi1ik on U.

Facts & Assumptions

Given: A smooth k-form ω on a chart domain U with coordinates x1,,xn.

[F1]

A smooth k-form is a smooth section of kTM (A smooth differential k-form).

[L1]

The coordinate differentials dx1,,dxn form the dual basis of the cotangent fibres, and their increasing wedges form a basis of the alternating k-covectors (Coordinate differentials form the dual cotangent basis, Wedge monomials in a dual basis form a basis).

[L2]

Smoothness of a section is equivalent to smoothness of its local components (Smoothness of a section is equivalent to smooth local components).

Proof

technique · direct
1.1

At each point pU, [L1] gives a basis of kTpM, so ωp has a unique expansion ωp=IωI(p)dxpI over increasing multi-indices I.

F1L1given
2.1

The coefficient functions pωI(p) are exactly the local components of the section ω in the bundle frame from [L1]. Therefore [L2] makes them smooth on U.

L1L2step 1.1
3.1

This gives the unique local coordinate expression for ω.

step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

14 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