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.
, give
Statement refuted
That the submultiplicativity of For bounded nonnegative sequences, can be improved to an equality: that for all bounded nonnegative sequences , of reals,
Facts & Assumptions
Given: The alternating sequence of The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and and the index maps ; the sequences and , which are the families usually written and ; and the tail ranges of Limit superior and limit inferior of a real sequence as and in .
The alternating sequence: for every , and , and , are strictly increasing with (The even and odd index maps and the alternating sequence: strictly increasing with their disjoint union, and the unique with , , which satisfies , and , A strictly increasing index map satisfies ).
Limit superior in : existence for every sequence, and the least-upper-bound and greatest-lower-bound descriptions of the tail bounds (Limit superior and limit inferior of a real sequence as and in , The tail suprema of any real sequence are nonincreasing in , so the limit superior exists for every sequence, Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in , Upper bound, least upper bound, and strict upper bound, Partial order and partially ordered set, The extended real line , its order, and the arithmetic that is left undefined, Sequences of reals: bounded, eventually, frequently, tails, subsequences).
Absolute value: forces or (Basic properties of the absolute value, Absolute value in an ordered field).
Order and field arithmetic: , so and ; , , and ; a product with a zero factor is (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field, Complete ordered field (least-upper-bound property)).
Submultiplicativity: for bounded nonnegative sequences, , all three quantities being real (For bounded nonnegative sequences, ).
Counterexample
Each is or . When the pair is , and when it is . In either case and , so both sequences are bounded and nonnegative, and because one of the two factors is .
For every both cases occur at an index : with and with .
Hence and for every , each with least upper bound in , since bounds both elements and belongs to the set; so . The product sequence is constantly , so and .
The hypotheses of [L5] are met by step 1.1, and the inequality it gives reads . Since , it is strict, so the equality asserted above fails for this pair and the refuted claim is false.
Remarks
-
The two sequences vanish at complementary indices. Wherever attains its maximum , its partner is , so the product is everywhere and the two limit superiors are attained along disjoint sets of indices. This is the multiplicative form of the phase mismatch behind , give .
-
Nonnegativity and boundedness are satisfied, so the failure is not degenerate. Both hypotheses of For bounded nonnegative sequences, hold, and the right-hand side is an honest product of real numbers; the inequality simply cannot be reversed.
-
The gap can be made total. Here the product sequence is identically zero while the bound is , so no fraction of the bound is achieved. Equality does hold when one of the two sequences converges, for the same reason as in the additive case.
Depends on
- For bounded nonnegative sequences, $\limsup(x_k y_k) \le (\limsup x_k)(\limsup y_k)$
- Limit superior and limit inferior of a real sequence as $\inf_n \sup_{k \ge n} x_k$ and $\sup_n \inf_{k \ge n} x_k$ in $\overline{\mathbb{R}}$
- The even and odd index maps and the alternating sequence: strictly increasing $e, o$ with $\mathbb{N}$ their disjoint union, and the unique $(s_k)$ with $s_0 = 1$, $s_{\sigma(k)} = -s_k$, which satisfies $|s_k| = 1$, $s \circ e \equiv 1$ and $s \circ o \equiv -1$
- A strictly increasing index map satisfies $n_k \ge k$
- The tail suprema of any real sequence are nonincreasing in $\overline{\mathbb{R}}$, so the limit superior exists for every sequence
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
- Upper bound, least upper bound, and strict upper bound
- Partial order and partially ordered set
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Sequences of reals: bounded, eventually, frequently, tails, subsequences
- Basic properties of the absolute value
- Absolute value in an ordered field
- The multiplicative identity is positive
- Order is preserved by adding a constant and by adding inequalities
- Sign rules for products and monotonicity of multiplication
- Ordered field
- Complete ordered field (least-upper-bound property)
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 70 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.
Sources
- Limit superior and limit inferior (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)