Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-28 rests on unproved material
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.

Rests on 1 statement not proved in this library. Every dependency marked below is recorded with a citation but is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Substituting two α-narrow graphs yields another α-narrow graph

Statement

Let α>0. If H1 and H2 are α-narrow finite graphs and the substitution G=H1[vH2] is defined, then G is α-narrow.

Facts & Assumptions

Given: A real number α>0, α-narrow finite graphs H1 and H2, and a defined substitution G=H1[vH2].

[F1]

A graph is α-narrow when every good function has α-power sum at most 1 (An α-narrow graph).

[F2]

In a substitution, every vertex of the substituted graph H2 has exactly the outside adjacencies that the vertex v had in H1 (Substituting one graph for a vertex of another).

[L1]

Substituting a perfect graph for a vertex of a perfect graph preserves perfection (Substituting perfect graphs preserves perfection ).

Proof

technique · direct
1.1

Let g be a good function on G. Let P2 be the family of perfect induced subgraphs of H2, and let K=maxPP2xV(P)g(x). If K=0, then every one-vertex induced subgraph of H2 has weight 0, so g vanishes on V(H2). Choose any vertex xV(H2), define g1 on H1 by copying g outside v and setting g1(v)=0, and note from [F2] that every perfect induced subgraph of H1 corresponds either to the same perfect induced subgraph of G or to one obtained by replacing v with x. Hence g1 is good on H1, so [F1] gives yV(H1)g1(y)α1. Because g vanishes on H2, this is exactly zV(G)g(z)α1.

F1F2choosealgebra
1.2

Assume now that K>0. Define g1 on H1 by copying g outside v and setting g1(v)=K. If Q is a perfect induced subgraph of H1 not containing v, then it appears unchanged in G and has total g1-weight at most 1. If vV(Q), choose PP2 with xV(P)g(x)=K; then [L1] makes the substitution Q[vP] a perfect induced subgraph of G, so yV(Q)g1(y)=yV(Q){v}g(y)+K=zV(Q[vP])g(z)1. Thus g1 is good on H1. Likewise g2:=g/K is good on H2 by the definition of K. Applying [F1] to g1 and g2 gives yV(H1){v}g(y)α+Kα1 and xV(H2)g(x)αKα.

F1 L1choosealgebra
2.1

In the case K>0, step 1.2 yields zV(G)g(z)α=yV(H1){v}g(y)α+xV(H2)g(x)α1. Together with step 1.1, this proves that every good function on G has α-power sum at most 1. Therefore [F1] shows that G is α-narrow.

step 1.1step 1.2F1

Depends on

Used by

Dependency tree · two levels

10 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