Subexponential container counts at the paper sample scale
Lax342547.ContainerAsymptotics · concepts/Lax342547/ContainerAsymptotics.lean · lax-342547
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Lemma
The logarithmic fingerprint count is bounded by a degree-three polynomial times 2^(100gN). Its ratio to 2^(1000gN) tends to zero, with an actual eventual strict exponent margin.
Concept map
Evidence
This concept declares 2 statements. Each proof establishes one of them relative to its assumptions.
1 container_exponent_little_o proven
2 eventually_container_exponent proven
Lean source view on GitHub
| 1 | import Mathlib.Analysis.SpecificLimits.Normed |
| 2 | import Mathlib.Tactic |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: Subexponential container counts at the paper sample scale |
| 7 | type: lemma |
| 8 | --- |
| 9 | The logarithmic fingerprint count is bounded by a degree-three polynomial times 2^(100gN). Its ratio to 2^(1000gN) tends to zero, with an actual eventual strict exponent margin. |
| 10 | -/ |
| 11 | |
| 12 | namespace Lax342547.ContainerAsymptotics |
| 13 | |
| 14 | open Filter Asymptotics |
| 15 | |
| 16 | def exponentBudget (A g N : ℕ) : ℕ := (2*A*N^2+1)*(4000*g*N*2^(100*g*N)+2) |
| 17 | |
| 18 | axiom container_exponent_little_o (A g : ℕ) (hg : 0 < g) : |
| 19 | (fun N : ℕ => (exponentBudget A g N : ℝ)) =o[atTop] fun N => (2 : ℝ)^(1000*g*N) |
| 20 | |
| 21 | axiom eventually_container_exponent (A g : ℕ) (hg : 0 < g) : |
| 22 | ∀ᶠ N : ℕ in atTop, exponentBudget A g N+2 < 2^(1000*g*N) |
| 23 | |
| 24 | end Lax342547.ContainerAsymptotics |
| 25 |
Builds on
none
Used by
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments