set seq = seq_logn ;
let e be Real; :: thesis: for g being Real_Sequence st e < 1 & ( for n being Element of NAT st n > 1 holds
g . n = (n to_power 2) / (log (2,n)) ) holds
ex s being eventually-positive Real_Sequence st
( s = g & Big_Oh (seq_n^ (1 + e)) c= Big_Oh s & not Big_Oh (seq_n^ (1 + e)) = Big_Oh s )
let g be Real_Sequence; :: thesis: ( e < 1 & ( for n being Element of NAT st n > 1 holds
g . n = (n to_power 2) / (log (2,n)) ) implies ex s being eventually-positive Real_Sequence st
( s = g & Big_Oh (seq_n^ (1 + e)) c= Big_Oh s & not Big_Oh (seq_n^ (1 + e)) = Big_Oh s ) )
assume that
A1: e < 1 and
A2: for n being Element of NAT st n > 1 holds
g . n = (n to_power 2) / (log (2,n)) ; :: thesis: ex s being eventually-positive Real_Sequence st
( s = g & Big_Oh (seq_n^ (1 + e)) c= Big_Oh s & not Big_Oh (seq_n^ (1 + e)) = Big_Oh s )
set seq1 = seq_n^ (1 - e);
set p = seq_logn /" (seq_n^ (1 - e));
set f = seq_n^ (1 + e);
set h = (seq_n^ (1 + e)) /" g;
g is eventually-positive

proof

take 2 ; :: according to ASYMPT_0:def 4 :: thesis: for b₁ being set holds
( not 2 <= b₁ or not g . b₁ <= 0 )
let n be Nat; :: thesis: ( not 2 <= n or not g . n <= 0 )
A3: n in NAT by ORDINAL1:def 12;
assume A4: n >= 2 ; :: thesis: not g . n <= 0
then log (2,n) >= log (2,2) by PRE_FF:10;
then A5: log (2,n) >= 1 by POWER:52;
n > 1 by A4, XXREAL_0:2;
then A6: g . n = (n to_power 2) / (log (2,n)) by A2, A3
.= (n to_power 2) * ((log (2,n)) ") ;
n to_power 2 > 0 by A4, POWER:34;
then (n to_power 2) * ((log (2,n)) ") > (n to_power 2) * 0 by A5, XREAL_1:68;
hence not g . n <= 0 by A6; :: thesis: verum

end;

then reconsider g = g as eventually-positive Real_Sequence ;
A7: (1 + e) - 2 = e - 1 ;
A8: for n being Element of NAT st n >= 2 holds
((seq_n^ (1 + e)) /" g) . n = (seq_logn /" (seq_n^ (1 - e))) . n

proof

let n be Element of NAT ; :: thesis: ( n >= 2 implies ((seq_n^ (1 + e)) /" g) . n = (seq_logn /" (seq_n^ (1 - e))) . n )
assume A9: n >= 2 ; :: thesis: ((seq_n^ (1 + e)) /" g) . n = (seq_logn /" (seq_n^ (1 - e))) . n
then A10: n > 1 by XXREAL_0:2;
((seq_n^ (1 + e)) /" g) . n = ((seq_n^ (1 + e)) . n) / (g . n) by Lm4
.= (n to_power (1 + e)) / (g . n) by A9, Def3
.= (n to_power (1 + e)) / ((n to_power 2) / (log (2,n))) by A2, A10
.= (n to_power (1 + e)) * (((n to_power 2) / (log (2,n))) ")
.= (n to_power (1 + e)) * ((log (2,n)) / (n to_power 2)) by XCMPLX_1:213
.= (n to_power (1 + e)) * ((log (2,n)) * ((n to_power 2) "))
.= ((n to_power (1 + e)) * ((n to_power 2) ")) * (log (2,n))
.= ((n to_power (1 + e)) / (n to_power 2)) * (log (2,n))
.= (n to_power (- (1 - e))) * (log (2,n)) by A7, A9, POWER:29
.= (log (2,n)) * (1 / (n to_power (1 - e))) by A9, POWER:28
.= (log (2,n)) / (n to_power (1 - e))
.= (seq_logn . n) / (n to_power (1 - e)) by A9, Def2
.= (seq_logn . n) / ((seq_n^ (1 - e)) . n) by A9, Def3
.= (seq_logn /" (seq_n^ (1 - e))) . n by Lm4 ;
hence ((seq_n^ (1 + e)) /" g) . n = (seq_logn /" (seq_n^ (1 - e))) . n ; :: thesis: verum

end;

take g ; :: thesis: ( g = g & Big_Oh (seq_n^ (1 + e)) c= Big_Oh g & not Big_Oh (seq_n^ (1 + e)) = Big_Oh g )
0 + e < 1 by A1;
then A11: 0 < 1 - e by XREAL_1:20;
then A12: seq_logn /" (seq_n^ (1 - e)) is convergent by Lm11;
A13: lim (seq_logn /" (seq_n^ (1 - e))) = 0 by A11, Lm11;
then A14: lim ((seq_n^ (1 + e)) /" g) = 0 by A12, A8, Lm22;
A15: (seq_n^ (1 + e)) /" g is convergent by A12, A13, A8, Lm22;
then not g in Big_Oh (seq_n^ (1 + e)) by A14, ASYMPT_0:16;
then A16: not seq_n^ (1 + e) in Big_Omega g by ASYMPT_0:19;
seq_n^ (1 + e) in Big_Oh g by A15, A14, ASYMPT_0:16;
hence ( g = g & Big_Oh (seq_n^ (1 + e)) c= Big_Oh g & not Big_Oh (seq_n^ (1 + e)) = Big_Oh g ) by A16, Th4; :: thesis: verum