Set . It may be , but cannot be because is finite. Fix and write , . Repeated use of the subadditive sequence inequality gives
where . Dividing by and letting gives . Since this holds for every , the upper limit of a sequence is at most , while every ratio is at least . If is finite these bounds agree. If , choose with below any prescribed real number; the same upper-limit bound proves convergence to . This establishes the extended-real Fekete lemma:
A finite real limit of a sequence requires a lower linear bound. For example satisfies the premise but has normalized limit of a sequence , so that qualification cannot be dropped.

Articles by others on the same topic (0)

There are currently no matching articles.