Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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.

Linear realisations preserve induced pieces

Statement

Let H=(V,E) be a finite linear hypergraph, let Je=(e,Ee) be a finite simple graph for each e∈E, and let R=(V,⋃e∈EEe) be their hyperedge-indexed graph realisation. Then R[e]=Je for every e∈E.

In particular, let T=(W,F) be a finite simple graph and, for each e∈E, choose a bijection fe:W→e and put Ee={{fe(x),fe(y)}:{x,y}∈F}. Then each fe is an induced embedding of T in R, and R[e] is an induced copy of T.

Facts & Assumptions

[F1]

In the Graph realisations with possibly different hyperedge pieces, each Ee consists of two-element subsets of e, and the edge set of R is the union of the Ee.

[F2]

By Berge cycles, incidence graphs and girth, linearity means that distinct hyperedges have at most one common vertex.

[F3]

By Subgraphs, induced subgraphs and spanning subgraphs, R[e] has vertex set e and exactly the edges of R whose endpoints lie in e.

[F4]

A bijection is injective and surjective by Injection, surjection, bijection. An induced embedding preserves and reflects adjacency on distinct vertices, and its image induces a copy, by Induced embeddings and induced copies of a graph.

[F5]

By A finite simple graph is a finite vertex set together with a set of two-element vertex subsets, every edge of a finite simple graph is a two-element subset of its vertex set, so its endpoints are distinct.

Proof

Given: The hypergraph, pieces and realisation in the statement.

Goal: Prove R[e]=Je for every hyperedge and establish the stated template consequence.

1.1givenF1F3F5

Fix e∈E. Every edge of Je belongs to E(R) and has both endpoints in e; hence Ee⊆E(R[e]).

2.1givenF1F2F3F5step 1.1

Conversely, let {u,v}∈E(R[e]). The endpoints are distinct and lie in e, and the union defining E(R) supplies some h∈E with {u,v}∈Eh. Both vertices also lie in h. If h≠e, then e∩h contains the two distinct vertices u,v, contrary to linearity. Thus h=e and {u,v}∈Ee. The two graphs have the same vertex set e, so R[e]=Je.

3.1givenF1F4F5step 2.1∎

In the template construction, fix e and distinct x,y∈W. The transport formula gives the forward implication from {x,y}∈F to {fe(x),fe(y)}∈Ee. Conversely, if the image pair belongs to Ee, the formula supplies an edge {a,b}∈F with the same image pair; injectivity of fe gives {a,b}={x,y}, so {x,y}∈F. Since fe is injective, its image pairs have distinct endpoints; by the equality just proved, this equivalence is also adjacency equivalence in R. Surjectivity gives fe(W)=e, so fe is an induced embedding and R[e] is its induced copy of T.

Depends on

Used by · 1

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.