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.

Connection laws in directional form

Statement

The directional operator of a connection obeys fX+gYs=fXs+gYs,X(as+bt)=aXs+bXt, X(fs)=X(f)s+fXs for smooth functions f,g, real numbers a,b, vector fields X,Y and sections s,t. Conversely, a map D:Γ(TM)×Γ(E)Γ(E) with these three laws comes from a unique connection by evaluation. This includes manifolds with boundary.

Facts & Assumptions

Given: The displayed objects; for the converse a smooth-section-valued map D satisfying the three displayed laws.

[F1]

A connection is a real-linear Hom-bundle-section-valued operator satisfying the one-form Leibniz identity (Connection on a smooth vector bundle).

[F2]

The directional derivative evaluates that Hom section on X (Covariant derivative of a section in a vector field direction).

[F3]

Chart bumps with support in a prescribed open neighbourhood exist (A chart bump at a point with prescribed support).

[F4]

A compact subset of a Euclidean open set admits a smooth bump equal to one on that subset (A Euclidean bump for a compact set inside an open set).

Proof

1.1

Fibrewise linearity of (s)p gives the first identity by evaluating at f(p)X(p)+g(p)Y(p). Real linearity of gives the second. Evaluating (fs)=dfs+fs on X gives the third because df(X)=X(f).

F1F2
1.2

We will use a cutoff χ supported in a prescribed neighbourhood and equal to one on a smaller neighbourhood of a chosen point. On an interior chart this is precisely the construction in the proof of [F3]: apply [F4] to two nested balls about the coordinate point and extend by zero. For a boundary chart with image relatively open in a closed half-space H, choose radii 0<r<R such that BR(a)H lies in the chart image. Restrict a Euclidean bump equal to one on Br(a) and supported in BR(a) to H, then pull back and extend by zero. Its support lies in the compact chart preimage of BR(a)H, hence is closed in the Hausdorff manifold and contained in the chart; zero extension is smooth. In dimension zero use the indicator of the open-and-closed singleton. Each construction is at a fixed point, requiring only finitely many choices.

F3F4construct
2.1

Fix s and write L(X)=DXs. If X vanishes near p, take a cutoff supported there with χ(p)=1. Then χX=0 and 0=L(χX)(p)=L(X)(p). Thus L(X)(p) depends only on the germ of X. Local fields may now be multiplied by a cutoff equal to one near p and extended by zero; applying L and evaluating at p is independent of that extension. On a neighbourhood where one fixed cutoff is one, the result is the restriction of a smooth global output, so these local values are smooth.

givenstep 1.2
3.1

In a coordinate neighbourhood write X=iXii. The extended local operator satisfies L(X)(p)=iXi(p)L(i)(p): extend all fields and coefficient functions using a common cutoff equal to one near p and apply global function-linearity, then use step 2.1. Hence L(X)(p) depends only on X(p). Define ηs(p)(v)=iviL(i)(p). Germ independence shows this definition is independent of coordinates, and the smoothness in step 2.1 shows ηs is a smooth Hom section. Every vector at p has a local constant-coordinate extension and then a cutoff global extension, so its value is uniquely forced by D.

givenstep 1.2step 2.1
4.1

Real linearity in s gives real linearity of sηs. Testing on a tangent vector using a global field with that value, the third law gives ηfs(p)(v)=dfp(v)s(p)+f(p)ηs(p)(v). Thus s=ηs is the unique connection inducing D. If M is empty there are no pointwise tests and both operators are unique zero maps; if dimM=0 the coordinate sum is empty. Rank zero gives zero outputs, while in rank one the same finite calculation has one output component. No simultaneous family of cutoff choices was made: uniqueness defines the global section from locally proved values.

F1givenstep 3.1

Depends on

Used by

Dependency tree · two levels

26 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