Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passaudited 2026-09-30
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.

Connections can change a representative without changing its class

Statement

On the trivial complex line E=R2×C over R2 with coordinates x,y, use the standard Hermitian metric and compare ∇0=d with ∇1=d+ix dy. Their curvature forms are Ω0=0 and Ω1=i dx∧dy. For a line bundle, c1(∇)=−Ω/(2πi), so the Chern forms are c1(∇0)=0,c1(∇1)=−dx∧dy2π. They are unequal, but c1(∇1)−c1(∇0)=d ⁣(−x dy2π), so they define the same de Rham class. Both connections are Hermitian for the standard metric.

Facts & Assumptions

Given: The product line R2×C, its standard Hermitian metric h(z,w)=zw‾, and the two displayed connection operators.

[F1]

For a line bundle, the degree-one determinant coefficient is c1(∇)=−Ω/(2πi) (Chern, Pontryagin, and Euler characteristic forms).

[F2]

In a local frame, curvature satisfies Ω=dω+ω∧ω (Curvature two-form structure equation).

[F3]

A connection is Hermitian-compatible when it satisfies the metric derivative identity Xh(s,t)=h(∇Xs,t)+h(s,∇Xt) (Complex-linear and metric-compatible bundle connections).

[F4]

For degree one, the transgression is the invariant polynomial applied to A=∇1−∇0, and its exterior derivative is the difference of the endpoint curvature evaluations (Explicit Chern–Simons transgression between two connections).

[F5]

Two closed two-forms define the same real de Rham class precisely when their difference is exact (De rham cohomology).

[F6]

The product bundle with fibre C≅R2, regarded as a real vector space, is a smooth trivial real rank-two bundle (Smooth vector bundles, rank, fibres, and trivial bundles).

[F7]

Chern forms obtained by curvature evaluation are closed (Chern, Pontryagin, and Euler characteristic forms).

Proof

1.1F3F6givenalgebra

By [F6], E=R2×C is the product line; give its fibres the standard complex structure and h(z,w)=zw‾. In the global frame, write ∇as=ds+as, where a0=0 and a1=ix dy. Each operator is complex-linear and satisfies ∇a(fs)=df s+f∇as, so it is a connection. For either a, h(∇a,Xs,t)+h(s,∇a,Xt)=X(st‾)+(a(X)+a(X)‾)st‾. Here a0=0 and a1‾=−a1, so this equals Xh(s,t); both connections are Hermitian for the stated metric, with the compatibility convention of [F3].

1.2F2givenalgebra

The structure equation [F2] gives Ω0=0. For a1=ix dy, da1=i dx∧dy and a1∧a1=−x2 dy∧dy=0, so Ω1=i dx∧dy.

2.1F1F7step 1.2algebra

Expanding the degree-one term of the determinant in the Chern-form definition [F1] gives c1=−Ω/(2πi) for this rank-one bundle. Consequently c1(∇0)=0 and c1(∇1)=−dx∧dy/(2π). The latter is nonzero, since its value on (∂x,∂y) is −1/(2π); hence the representative forms are not equal.

3.1

Put η=−x dy/(2π). Direct differentiation gives dη=−dx∧dy/(2π)=c1(∇1)−c1(∇0). This is also the degree-one transgression in [F4]: its polynomial is P1(B)=−B/(2πi) and A=ix dy, so TP1(∇0,∇1)=P1(A)=η. Thus the endpoint forms are unequal while [F5] identifies their de Rham classes; [F7] ensures these closed forms represent classes. The example uses only the displayed product bundle and connections; it requires no choice axiom. [F1, F4, F5, F7, step 1.2, step 2.1, given, algebra] □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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