Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

A compatible almost-complex structure that is not integrable

Counterexample

On R4 with coordinates (x1,y1,x2,y2) and ω=dx1dy1+dx2dy2, there is an explicit compatible almost-complex structure with nonzero Nijenhuis tensor.

Facts & Assumptions

Given: Let J0xi=yi and J0yi=xi. Put A=diag(ex2,ex2,1,1) in the displayed coordinate frame and J=AJ0A1.

[F1]

Symplectic conjugation preserves compatibility. Compatible complex structure on a symplectic vector space.

[F2]

An integrable almost-complex structure has vanishing Nijenhuis tensor NJ(X,Y)=[JX,JY]J[JX,Y]J[X,JY][X,Y]; this necessary implication is the easy direction of the Newlander--Nirenberg criterion recorded in the cited source. Compatible almost-complex structures and Kähler geometry.

Verification

technique · direct
1.1

Pointwise A preserves ω because its reciprocal scalings on (x1,y1) preserve dx1dy1 and it fixes the other pair. Thus [F1] makes J compatible. Explicitly, with a=e2x2, Jx1=ay1, Jy1=a1x1, and J is standard on the second pair.

F1givenalgebra
2.1

For X=x1 and Y=x2, all coordinate brackets vanish, while [ay1,x2]=ay1. Hence NJ(X,Y)=J(ay1)=(a/a)x1=2x10. By [F2], J is not integrable.

F2step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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