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 maximum-degree tail with an explicit logarithmic exponent
Statement
For with , put . Its maximum degree satisfies If and , this is at most .
Facts & Assumptions
Since and , , so the vertex set is nonempty. Vertex degree counts incident edges and is the maximum of those degrees (Adjacency, incidence, open and closed neighbourhoods, vertex degree, minimum degree and maximum degree). Thus a vertex degree is the sum of its independent Bernoulli edge indicators (The Erdős-Rényi finite random graph G(n,p)). Each Bernoulli indicator is with probability and with probability (Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials).
Finite product weights factor over independent edge coordinates (The finite product of finite probability spaces).
For outcome weights , expectation is (Expectation of a real random variable on a finite probability space), while an event has probability (Finite probability spaces, outcome weights, events, and event probabilities).
The exponential has series , and (The real exponential function and the number e by a power series).
The exponential satisfies its addition formula (The exponential addition formula exp(x+y)=exp(x)exp(y)).
The bound holds for every real (1+x≤exp(x) for every real x, hence (1-p)ᵐ≤exp(-mp)).
Real powers obey (Real powers for positive bases, with the zero-base positive-exponent convention).
For , is the unique real number with (The natural logarithm as the inverse of the exponential function).
The exponential is strictly increasing on the real line (The exponential function is strictly increasing).
For real with , the geometric series satisfies . At this gives (For |r| < 1, ∑_k ≥ 0 rᵏ = 1/(1-r), and for |r| ≥ 1 the series diverges).
Proof
Given: The objects and hypotheses in the Statement.
Goal: Prove its conclusions.
By [F10] at , the series gives : for , , with strict inequality for , so . For any vertex degree , independence gives . By [F9], on the random variable is at least , and by [F4]. Hence the nonnegative finite expectation sum gives .
The indicator of a union of the vertex events is at most the sum of their indicators. Sum their probabilities to get the displayed maximum-degree bound. For , [F5], [F7] and [F8] give . Since , [F8] and [F9] imply . Now gives , so [F9] yields .
Depends on
- The Erdős-Rényi finite random graph G(n,p)
- The finite product of finite probability spaces
- Expectation of a real random variable on a finite probability space
- The real exponential function and the number e by a power series
- The exponential addition formula exp(x+y)=exp(x)exp(y)
- 1+x≤exp(x) for every real x, hence (1-p)ᵐ≤exp(-mp)
- Real powers for positive bases, with the zero-base positive-exponent convention
- Adjacency, incidence, open and closed neighbourhoods, vertex degree, minimum degree and maximum degree
- Finite probability spaces, outcome weights, events, and event probabilities
- The natural logarithm as the inverse of the exponential function
- The exponential function is strictly increasing
- Bernoulli random variables and binomial random variables as sums of independent Bernoulli trials
- For |r| < 1, ∑_k ≥ 0 rᵏ = 1/(1-r), and for |r| ≥ 1 the series diverges
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.