Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-sol)audited 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.

Pontryagin forms from a real connection

Example

Let M be a finite-dimensional Hausdorff second-countable smooth manifold, possibly empty or with boundary, let E→M be a smooth real vector bundle of finite rank r, and let ∇ be a real connection on E with curvature Ω. Use the conventions of Chern, Pontryagin, and Euler characteristic forms for the complexified connection ∇C on EC=E⊗RC, the Chern forms cj, the Pontryagin forms pj, and the Euler form e. Then:

  1. p1(∇)=−c2(∇C).
  2. If ∇ is compatible with a Euclidean metric, then in every local orthonormal frame tr⁡Ω=0 and p1(∇)=−tr⁡(Ω∧Ω)8π2.
  3. If in addition r=2, the bundle is oriented, and Ω=(0−FF0) for a real 2-form F in a positively oriented orthonormal frame, then p1(∇)=F∧F4π2=e(∇)∧e(∇).

For every real connection the second determinant coefficient is c2(∇C)=tr⁡(Ω∧Ω)−tr⁡Ω∧tr⁡Ω8π2, so clause 2 uses metric compatibility exactly to delete the (tr⁡Ω)2 term; the trace formula without that correction is false for general real connections, as the witness below shows. No integral or topological equality is claimed. The Euler form is defined only in even rank, so clause 3 is restricted to rank two.

Facts & Assumptions

Given: The manifold, bundle, connection and curvature of the three clauses; in clause 2 a Euclidean metric compatible with ∇; in clause 3 an orientation and a positively oriented orthonormal frame in which the curvature matrix has the displayed form.

[F1]

In a real bundle the total Chern form of a complex connection is the determinant c(∇)=det⁡ ⁣(I−Ω2πi)=∑jcj(∇), with cj of degree 2j, and the complexified connection on EC=E⊗RC is the complexification of the real one (Chern, Pontryagin, and Euler characteristic forms).

[F2]

For a real connection, pj(∇)=(−1)jc2j(∇C) is a real form of degree 4j, and pj=0 whenever 2j>r (Chern, Pontryagin, and Euler characteristic forms).

[F3]

For an oriented Euclidean bundle of even rank with a metric-compatible connection, the Euler form is e(∇)=Pf⁡ ⁣(Ω2π) in an ordered oriented orthonormal frame, with the normalization Pf⁡ ⁣(0a−a0)=a (Chern, Pontryagin, and Euler characteristic forms).

[F4]

A real connection on a Euclidean vector bundle is Euclidean-compatible when it obeys the identity Xh(s,t)=h(∇Xs,t)+h(s,∇Xt) for all smooth sections s,t and vector fields X (Complex-linear and metric-compatible bundle connections).

[F5]

In a local frame the curvature matrix of a connection obeys the structure equation Ω=dω+ω∧ω (Curvature two-form structure equation).

Verification

Given: The objects and hypotheses above, and the standard coordinates on R4 in step 3.1.

1.1F1F2givenalgebra

The second determinant coefficient. In a real frame e1,…,er the complexified connection restricts to ∇ on E⊗1 and is complex-linear in the scalar factor, so it has the same connection matrix and hence the same curvature matrix Ω over C. Put A=−Ω/(2πi). Its entries are 2-forms and therefore commute, so the usual expansion det⁡(I+A)=1+e1(A)+e2(A)+⋯ in principal minors is valid, with e1(A)=tr⁡A and e2(A)=12((tr⁡A)2−tr⁡(A∧A)) by Newton's identity. Since (2πi)2=−4π2, c2(∇C)=tr⁡(Ω∧Ω)−tr⁡Ω∧tr⁡Ω8π2, and [F2] turns this into p1(∇)=−c2(∇C)=[(tr⁡Ω)2−tr⁡(Ω∧Ω)]/(8π2). For r≤1 the rank cutoff gives c2=0=p1.

2.1F4F5step 1.1algebra

Metric connections. Let ∇ be Euclidean-compatible and let e1,…,er be a local orthonormal frame, so h(ei,ej)=δij. Applying [F4] to these frame sections gives 0=Xh(ei,ej)=h(∇Xei,ej)+h(ei,∇Xej)=ωji(X)+ωij(X) for every vector field X, hence ωT=−ω. Transposing [F5] and using (ω∧ω)T=−ωT∧ωT together with the anticommutativity of one-form coefficients gives ΩT=d(ωT)−ωT∧ωT=−Ω. Thus every diagonal entry of Ω vanishes and tr⁡Ω=0. Step 1.1 then gives c2(∇C)=tr⁡(Ω∧Ω)/(8π2) and p1(∇)=−tr⁡(Ω∧Ω)/(8π2).

3.1step 1.1step 2.1givenalgebra

The correction term is genuine. On the trivial rank-two real bundle over R4 take the standard frame, let ω=diag⁡(x2 dx1, x4 dx3), and let ∇=d+ω. Then ω∧ω=0 and Ω=dω=diag⁡(dx2∧dx1, dx4∧dx3). Hence tr⁡Ω=dx2∧dx1+dx4∧dx3 is nonzero, while tr⁡(Ω∧Ω)=(dx2∧dx1)2+(dx4∧dx3)2=0. Step 1.1 gives c2(∇C)=−tr⁡Ω∧tr⁡Ω8π2=−dx1∧dx2∧dx3∧dx44π2≠0, whereas the uncorrected expression −tr⁡(Ω∧Ω)/(8π2) of step 2.1 evaluates to 0; the trace formula therefore requires metric compatibility.

3.2F3step 2.1algebra

Rank two. Let r=2, let the bundle be oriented, and let Ω=(0−FF0) in a positively oriented orthonormal frame. Then Ω∧Ω=(−F∧F00−F∧F), so tr⁡(Ω∧Ω)=−2F∧F and step 2.1 gives p1(∇)=F∧F/(4π2). By [F3] and the 2×2 normalization, e(∇)=Pf⁡(Ω/(2π))=−F/(2π), hence e(∇)∧e(∇)=F∧F/(4π2)=p1(∇).

4.1F1F2F3F4step 1.1step 2.1step 3.1step 3.2cases∎

Boundary cases. If M is empty then every form space is zero and the identities hold trivially. If r=0 or r=1, then c2=p1=0 in clause 1 by the rank cutoff; for r=1 and a Euclidean-compatible connection, step 2.1 makes the 1×1 curvature matrix skew-symmetric, hence zero, so p1=−tr⁡(Ω∧Ω)/(8π2)=0. The Euler form is defined only in even rank, so clause 3 has no rank-one case. If Ω=0, then both sides of each displayed identity in clauses 2 and 3 vanish, with F=0 there. All three clauses are pointwise local statements in frame coefficients, so they restrict to boundary charts unchanged; no choice principle, parameter, or limiting process occurs, clause 2 assumes metric compatibility while clause 1 does not, and no converse of clause 2 is asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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