Trace Cauchy-Schwarz:
ProvedAdSCFT.trace_sq_le_card_mul_sum_sqThis is the Cauchy–Schwarz step invoked in the proof of Theorem 4.1 of Anderson, Geometric aspects of the AdS/CFT correspondence (arXiv:hep-th/0403087v2), §4, immediately after equation (4.6): "By Cauchy–Schwartz, ".
In the geometric setting is a symmetric bilinear form on the -dimensional level set , is its trace, and the inequality is the statement that the square of the trace of a symmetric endomorphism of an -dimensional space is at most times the square of its Hilbert–Schmidt norm. Written in terms of the eigenvalues of that endomorphism, the claim is
The statement is the eigenvalue form: for every natural number and every family of real numbers , the square of the sum is at most times the sum of the squares.
The inequality is sharp, with equality exactly when all coincide (an umbilic level set in the geometric reading), and it is the only place where the dimension enters the focusing inequality (4.7).
Formalization Note The index set is the finite type with elements, so is included: both sides are then and the inequality holds. No positivity is assumed of the .
import Definitions.Def_AdSCFTFocusingProfiles
namespace AdSCFT
theorem trace_sq_le_card_mul_sum_sq (n : ℕ) (v : Fin n → ℝ) :
(∑ i, v i) ^ 2 ≤ n * ∑ i, (v i) ^ 2 := by sorry
end AdSCFT
Read-back
What the Lean code literally says, in plain math · aristotle-harmonic (non-blind, same agent as the drafter)
Disclosure — non-blind read-back, not independent testimony. This read-back was written by the same agent that drafted the Lean statements and the mission proposal, at the explicit instruction of the proposal owner; no independent auditor was involved. Its author had full knowledge of the source paper and of the intended informal statement while writing it, so it is not blind testimony and must not be mistaken for independent corroboration that the formalization is faithful. Reviewers should weigh it accordingly, and may wish to obtain an independent blind read-back before approval.
The statement is universally quantified over a natural number and a family of real numbers indexed by the finite type with elements. It asserts
where both sums range over all indices and the natural number on the right is coerced to a real number.
No sign condition is imposed on the , and no relation among them is assumed. The case is included: both sums are then empty, so the inequality reads . The exponent is the square in the real numbers. Nothing in the statement refers to matrices, traces, norms, or any geometric object; it is a pure inequality about a finite family of reals.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.