Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-11
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.

Two plane embeddings of one connected planar graph have nonisomorphic dual multigraphs

Example

The abstract graph below has two plane embeddings whose dual multigraphs are distinguished by their degree multisets. For a finite multigraph with the endpoint map of Multigraphs, loops and directed graphs as variants distinct from the default finite simple graph, count an ordinary incident edge once and a loop twice in the degree. An isomorphism of such endpoint-map structures is a pair of vertex and edge bijections preserving endpoints, and therefore preserves the degree multiset.

Facts & Assumptions

Given: Let GG have vertices s,t,a,b,c,ws,t,a,b,c,w. Its edges form three internally disjoint ss-tt paths P1=stP_1=st, P2=satP_2=sat, and P3=sbctP_3=sbct, together with the bridge swsw.

[F1]

An endpoint-preserving multigraph isomorphism preserves the degree multiset because it bijects the incident edge-ends at every vertex, with a loop contributing two ends.

Verification

technique · constructive
1.1

Embed the three ss-tt paths in cyclic order. Write f12,f23,f31f_{12},f_{23},f_{31} for the faces between the indicated path pairs. In the dual of The plane dual multigraph, with a vertex for each face and one crossing edge for each primal edge, the path lengths 1,2,31,2,3 give respectively that many parallel dual edges between the two faces on each side of the path. Before accounting for swsw, the degrees of f12,f23,f31f_{12},f_{23},f_{31} are 3,5,43,5,4. The bridge may be drawn into any one of these face sectors at ss; it then gives a dual loop at that face.

L1construct
2.1

In one embedding draw swsw into f12f_{12}; the dual degree multiset is then {5,5,4}\{5,5,4\}. In another draw it into f31f_{31}; the dual degree multiset is {3,5,6}\{3,5,6\}. These multisets differ, since a loop contributes two to its incident degree. By [F1] the two dual multigraphs are nonisomorphic, although both arise from the same connected planar graph GG.

L1F1step 1.1discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 23 results over 10 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources