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.
The induced copies of in are counted by summing, over the induced embeddings of , the number of vertices that extend them at
Statement
Let be a finite simple graph with , let , write for the induced subgraph , and let be a finite simple graph with . For an induced embedding of into define its extension set
Then, writing for the set of induced embeddings of into ,
Facts & Assumptions
Given: A finite simple graph with , a vertex , and a finite simple graph with ; the sets of induced embeddings of into and of induced embeddings of into .
An induced embedding of in is an injection such that, for all distinct , if and only if (Induced embeddings and induced copies of a graph).
is the number of induced embeddings of into (The induced-embedding count ).
, so two vertices of are adjacent in exactly when they are adjacent in (Subgraphs, induced subgraphs and spanning subgraphs).
For finite sets and a relation with row fibres and column fibres , one has (Double counting: for a relation between finite sets, A relation between finite sets, its row fibres and its column fibres ).
For a finite index set and a constant , (The sum over a finite index set, and its product form).
For finite sets and , the set of functions is finite with (The set of functions between finite sets is finite, with ).
Every subset of a finite set is finite, and its cardinality is at most that of the set (A subset of a finite set is finite, with , and equality holds if and only if , The cardinality of a finite set).
Proof
If then its restriction to is injective, and for distinct the condition is the condition , which holds exactly when ; so , and it is the only member of that restricts to.
Let consist of the pairs whose second entry restricts to the first. Both and are sets of functions between finite sets, hence finite.
The column fibre of at has exactly one element by step 1.1, so .
The row fibre of at is carried bijectively onto by : the map is injective because is determined by together with , and its image is exactly , because a vertex arises as some precisely when extending by gives an induced embedding of , and injectivity of that extension is exactly the requirement .
Double counting therefore gives .
Every member of is a function from , a set of elements, to , so is a subset of a set of size and .
Depends on
- The induced-embedding count $\operatorname{ind}_H(G)$
- Induced embeddings and induced copies of a graph
- Double counting: $\sum_{x \in X}\lvert R_x\rvert = \lvert R\rvert = \sum_{y \in Y}\lvert R^y\rvert$ for a relation between finite sets
- A relation $R \subseteq X \times Y$ between finite sets, its row fibres $R_x$ and its column fibres $R^y$
- The sum $\sum_{i \in S} a_i$ over a finite index set, and its product form
- Subgraphs, induced subgraphs and spanning subgraphs
- The set $A^{B}$ of functions $B \to A$ between finite sets is finite, with $\lvert A^{B}\rvert = \lvert A\rvert^{\lvert B\rvert}$
- A subset of a finite set is finite, with $\lvert B\rvert \le \lvert A\rvert$, and equality holds if and only if $B = A$
- The cardinality $\lvert A\rvert$ of a finite set
Used by
- Counting the induced copies of P₃ in P₄ by extension sets Example
- An induced copy of H₂ inside the extension set of an induced embedding of H₁-v yields an induced copy of H₁ with H₂ substituted for v Lemma
- Alon–Pach–Solymosi: if H₁ and H₂ have the Erdős–Hajnal property, so does the graph obtained from H₁ by substituting H₂ for a vertex Theorem
Dependency tree · two levels
33 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
- M. Chudnovsky, The Erdős–Hajnal Conjecture: A Survey, sec. 2 (standard reference, not scraped)