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.
Property (*) and Comb Outcomes — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Blockades, Combs and Pattern Graphs
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Generalized Niceness and Reduction Outcomes
- Graph Colouring
- Graphs, Walks and Connectivity
- Inclusion–Exclusion, the Pigeonhole Principle and Double Counting
- Induced Subgraphs and Hereditary Graph Classes
- Iterative Restriction and Comb-Extraction Lemmas
- Iterative Sparsification and the Five-Vertex Path
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Metric Spaces
- Modules, Substitution and Prime Graphs
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rödl, Virality and Erdős–Hajnal Equivalence
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Property (*) and Comb Outcomes
- Regular Pairs and Induced Counting
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sparse Restricted Subgraphs and the Rödl–Nikiforov Theorems
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Erdős–Hajnal Property and Homogeneous Sets
- The Exponential Function
- The Five-Cycle and the Erdős-Hajnal Property
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Trees, Forests and Spanning Trees
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
These examples check the finite configurations and exponent substitutions that the A page uses repeatedly: the basic comb trigger for property (*), the pure blockade width in the third branch, the square-root rescaling in the Rödl step, and the substitution in the final generalized-nice deduction.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A four-tooth comb with a special vertex realizes the trigger configuration for property (*)
Example
Let have vertices
with edges exactly and for . Put
for each .
Facts & Assumptions
Given: The graph and the blocks displayed in the Example.
The item Combs in a graph characterizes an -comb by the blockade conditions and the adjacency pattern of the teeth.
If a finite family has property and is -free, then an -comb with together with a vertex outside the comb that is complete to the blocks and anticomplete to the teeth is the antecedent of the three-outcome implication in Property (*) for a finite graph family.
Verification
The four sets are pairwise disjoint and each has vertices, so is a -blockade.
Each tooth is adjacent to every vertex of and to no vertex of for , and the teeth are distinct and lie outside the blocks. Hence is a -comb by [L1].
The vertex lies outside the comb, is adjacent to every vertex in , and is nonadjacent to every . Since this comb has , the pair consisting of the comb and realizes the geometric trigger configuration occurring in [L2]. No assertion that an unspecified family has property is being made.
The third outcome of property (*) gives a pure four-blockade
Example
Assume the trigger hypothesis of property holds for a comb of length and width . If the third outcome of property occurs, the resulting blockade is pure with width .
Facts & Assumptions
Given: A special-vertex comb with and width .
The third branch in Property (*) for a finite graph family gives a pure -blockade.
Verification
Applying [L1] with yields a pure blockade whose width is
Since [L1] names the blockade pure rather than complete or anticomplete, this branch keeps exactly the distinction used later on the A page: every pair of blocks is pure, but no stronger global uniformity is asserted.
A numerical square-root rescaling identity
Example
As a standalone numerical illustration, take
and assume .
Facts & Assumptions
Given: The numerical choices in the Example.
The sample values satisfy the numerical relation . They are not asserted to be the existential constants supplied by the source lemma.
Verification
Since , one has
Therefore using the assumption .
This standalone calculation isolates the square-root renormalization: after replacing by , the width bound takes exactly the target form when the numerical relation holds.
The epsilon^(5d) substitution in Claim 4.5.1 and Lemma 4.5
Example
Take
Then the four exponent comparisons in the final property-(*) reduction become explicit.
Facts & Assumptions
Given: The displayed values of , , , and .
Since , the powers of decrease as their exponents increase.
Verification
The defining substitution gives Together with , this verifies the two parameter inequalities required before applying the Rödl-initialized theorem; its separate graph-order hypothesis must also be checked in any application.
For the restricted-set branch, because when .
For the clique-or-stable-set branch, because .
If , then so This is exactly the comparison used to turn the complete-or-anticomplete blockade branch into the generalized-nice blockade outcome.
These computations are the concrete numerical version of the four exponent transfers behind the local blockade claim and the final proof of generalized niceness.