Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 formula for a bundle connection

Statement

In a local frame e, write s=eu with coefficient column u. Then Xs=e(X(u)+ω(X)u),s=e(du+ωu). Here the last expression means an E-valued one-form, and X(u) and du act entrywise.

Facts & Assumptions

Given: A connection restricted to an open frame domain, a local section s=jujej, and a local vector field X.

[F1]

The connection matrix is defined by the derivatives of the frame sections (Connection one form in a local frame).

[F2]

Directional differentiation is real-linear and obeys the section Leibniz rule (Connection laws in directional form).

Proof

1.1

Apply the Leibniz rule to each of the finitely many summands: Xs=jX(uj)ej+jujXej. Inserting the frame derivatives yields i(X(ui)+jωij(X)uj)ei.

F1F2
2.1

This is exactly the first matrix formula. At each point, every tangent vector is the value of a local coordinate vector-field combination; equality upon all such evaluations therefore gives the one-form formula. The calculation is valid on an empty frame domain, with an empty sum in rank zero, and with one summand in rank one. On a zero-dimensional base both differentiated functions and one-forms vanish. No choice of a global frame is used.

step 1.1

Depends on

Used by

Dependency tree · two levels

9 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