Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26
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 U-shaped prism is a finite gluing of three boxes and is not simple in every coordinate direction

Example

Let E1=[0,3]×[0,1]×[0,1],E2=[0,1]×[1,3]×[0,1],E3=[2,3]×[1,3]×[0,1], and put E=E1E2E3. Then E is a finite gluing of three elementary solid regions. It is not simple in the x direction, because for every y(1,3) its section at height y is the union of two disjoint intervals. For the field F(x,y,z)=(x,0,0), both sides of the divergence theorem on E equal 7.

Facts & Assumptions

Given: The three boxes E1,E2,E3, their union E, and the field F(x,y,z)=(x,0,0).

[F1]

In a finite gluing, each internal patch is paired with an internal patch of a different piece by an orientation-reversing regular reparametrization (Finite gluings of elementary solid regions and their outward boundary presentation).

[L1]

The closed unit box, with its six outward faces, is an elementary solid region (The closed unit box, with its six faces, is an elementary solid region).

[F2]

An elementary solid region is a compact solid equipped with one compatible finite patch presentation adapted to a simple description in each of the three coordinate directions (Elementary solid regions: one boundary presentation adapted in all three coordinate directions).

[F3]

A simple description in one direction has the form stated in Simple solid regions in a coordinate direction and their cyclic coordinate projection.

[L2]

The divergence theorem for a finite gluing is EdivF=EF,n (The divergence theorem for finite gluings of elementary solid regions).

[L3]

In a finite gluing, the sum of the piece fluxes is the flux over the outer presentation, and the sum of the piece integrals is the integral over the union (Internal faces cancel and volume integrals add when elementary solid regions are glued).

[F4]

The divergence of a field is the sum of its coordinate partial derivatives (Divergence and curl of a C1 vector field).

[L4]

Jordan Fubini computes a multiple integral by iterated section integrals (Fubini over a bounded Jordan set when all but a content-zero family of sections are integrable).

[L5]

If a<b, G is differentiable on [a,b], and G=f is integrable there, then abf=G(b)G(a) (The second fundamental theorem: if G is differentiable on [a,b] with G=f and f is integrable, then abf=G(b)G(a)).

[F5]

In a finite patch presentation, total flux is the sum of the patch fluxes (Finitely patched regular surfaces, their area, scalar integrals, and flux).

[F6]

Flux is computed against the oriented area vector of a patch (Unit normal fields, orientations, and flux through a regular surface patch).

[F7]

A surface reparametrization is orientation-reversing exactly when its parameter Jacobian determinant is negative (Surface reparametrizations and their orientation sign).

Verification

technique · direct
1.1

Each Ei is the image of the unit-box construction [L1] under an invertible affine coordinate scaling followed by a translation. Applying the same affine map to its three simple descriptions and six face parametrizations preserves the graph equations, nonzero oriented-area coordinates, projected disjointness, and content-zero parameter boundaries; hence [F2] makes all three pieces elementary solid regions. Their interiors are pairwise disjoint because E1 lies below the plane y=1 while E2 and E3 lie above it, and E2 and E3 are separated by the strip 1<x<2.

L1F2given
2.1

The face of E1 in the plane y=1 is larger than either matching face of E2 or E3, so it must be subdivided into three rectangles cut at x=1 and x=2; that refinement preserves the adapted presentation, because it only subdivides one existing graph face into three graph faces with disjoint projections.

step 1.1F2F3F5
2.2

For each y(1,3) and each z(0,1), the section of E in the x direction is [0,1][2,3], a union of two disjoint intervals. Therefore E is not simple in the x direction, and the gluing clause is genuinely stronger than a single simple description.

step 1.1F3
3.1

Two of the three new rectangles on the face y=1 pair with the matching faces of E2 and E3; each pairing is a translation composed with a parameter swap, so its parameter Jacobian determinant is negative and [F1] and [F7] make it orientation-reversing.

step 2.1F1F7
4.1

Every other face of every piece is declared outer, so the three boxes with this subdivision and pairing data form a finite gluing whose outer presentation is exactly the boundary of E.

step 3.1F1F5
5.1

The divergence of F is the constant 1 by [F4], so [L2], [L3], [L4], and [L5] give EdivF=cont(E)=3+2+2=7 and the outward flux through the boundary presentation is the same number.

step 4.1L2L3F4L4L5F6

Remarks

  • The subdivision in step 1.2 is not optional. Without it, the larger face of E1 on y=1 could not be paired patch-for-patch with the smaller faces of E2 and E3.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

55 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