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.
Reflection through zero exchanges upper and lower bounds
Statement
For write . Then , and is nonempty if and only if is nonempty. Moreover, for all :
- is an upper bound of if and only if is a lower bound of ;
- is a lower bound of if and only if is an upper bound of .
Consequently is bounded above if and only if is bounded below, is bounded below if and only if is bounded above, and is bounded if and only if is bounded (Lower bound, bounded below, bounded set).
Facts & Assumptions
Given: A subset , its reflection , and elements .
is a complete ordered field, in particular an ordered field (Complete ordered field (least-upper-bound property)), and in an ordered field the order is defined by the positive cone : means exactly , and means or (Ordered field).
Upper bound, lower bound, bounded above, bounded below and bounded have their meanings from Lower bound, bounded below, bounded set: bounds above when for all , and bounds below when for all .
Field arithmetic. Additive inverses are unique (Identities and inverses in a field are unique), and by the inverse axiom, so is the additive inverse of , that is . Addition is commutative and abbreviates (Field), so for all .
Proof
For all the field identity holds, and .
The map sends onto and onto , and since it is a bijection of with whose inverse is itself; hence , and is nonempty exactly when is nonempty.
For all : holds exactly when is positive, which by 1.1 is exactly when is positive, which is exactly ; and holds exactly when ; hence if and only if .
Suppose is an upper bound of . Every element of has the form with , and gives ; hence is a lower bound of .
Conversely, suppose is a lower bound of . For we have , so , and applying 2.1 to this inequality gives ; hence is an upper bound of . This together with 3.1 proves claim 1.
Suppose is a lower bound of . For we have , hence , and every element of is such a ; hence is an upper bound of .
Conversely, suppose is an upper bound of . For we have , so , and applying 2.1 gives ; hence is a lower bound of . This together with 3.3 proves claim 2.
Claim 1 says the upper bounds of are exactly the negatives of the lower bounds of , so is bounded above exactly when is bounded below; claim 2 says likewise that is bounded below exactly when is bounded above; combining the two, is bounded exactly when is bounded, and with nonempty exactly when is nonempty.
Depends on
Used by
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 5 results over 4 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
- Infimum and supremum (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 1 (standard reference, not scraped)
- John K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)