'Integral ceiling power roots'
Lax17.PowerRoot · concepts/Lax17/PowerRoot.lean · lax-17
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
For positive , the integer used in the fixed-round grid-minor bound is the least natural number whose -th power is at least . We expose that meaning as a relation instead of hiding it behind a choice operator.
The first conjunct says that is large enough. The second says that every smaller natural number is too small. Thus the relation determines uniquely whenever it is inhabited.
Concept map
Lean source view on GitHub
| 1 | /-! |
| 2 | --- |
| 3 | title: 'Integral ceiling power roots' |
| 4 | type: definition |
| 5 | --- |
| 6 | For positive , the integer used in the fixed-round |
| 7 | grid-minor bound is the least natural number whose -th power is at least |
| 8 | . We expose that meaning as a relation instead of hiding it behind a |
| 9 | choice operator. |
| 10 | |
| 11 | The first conjunct says that `rho` is large enough. The second says that |
| 12 | every smaller natural number is too small. Thus the relation determines |
| 13 | `rho` uniquely whenever it is inhabited. |
| 14 | -/ |
| 15 | |
| 16 | namespace Lax17.PowerRoot |
| 17 | |
| 18 | /-- `rho` is the least natural number satisfying . -/ |
| 19 | def IsCeilingPowerRoot (t g rho : Nat) : Prop := |
| 20 | g ^ 2 ≤ rho ^ t ∧ |
| 21 | ∀ a : Nat, a < rho → a ^ t < g ^ 2 |
| 22 | |
| 23 | end Lax17.PowerRoot |
| 24 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments