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.
Multimodal contrastive alignment and transfer — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Countability and Uncountability
- Feedforward networks and single-hidden-layer universality
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Multimodal contrastive alignment and transfer
- Order, Zorn's Lemma, and the Axiom of Choice
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Suprema and Infima
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
Prompt and distribution-sensitive transfer
Example
Use with , , , and scale . For one image with normalized image embedding , consider classes and two prompt templates. Under the first wording, their normalized text embeddings are , , and . Embedding-space prompt averaging gives and . The class-prototype classifier scores for and for . Define individual-text retrieval here to rank the four prompt embeddings by their dot product with ; it selects the first prompt, while the class-prototype classifier selects . If a second prompt wording gives both prompts embedding and leaves the prompts unchanged, then the classifier selects . These are possible encoder outputs, demonstrating that prompt wording and the candidate construction can change the result.
For a second fixed zero-shot classifier, let the normalized class prototypes be and , and let two distinct images both have normalized image embedding . Give them the fixed true labels and , respectively, so the classifier predicts for both. Let be class-specific descriptions: is true of and false of , while is true of and false of ; their normalized text embeddings are . The image paired with the incorrect description is semantically mismatched but has cosine similarity ; paired with its correct description , it has cosine similarity . Thus this construction shows that the embeddings need not preserve semantic compatibility. Define the finite source evaluation law by assigning mass to and to , and the target evaluation law by assigning mass to and to . The label assigned to each image is the same under both laws, while the input frequencies differ. Define 0–1 error under either law as the total mass of its misclassified labelled inputs. The errors are on the source law and on the target law, illustrating input-distribution sensitivity for this fixed classifier.
The vector geometry in the first construction is shown schematically below: the horizontal component is the similarity with the image embedding . The exact coordinates above determine the rankings; no proof relies on the drawing.
diagram failed to render:
\begin{tikzpicture}[x=2.3cm,y=2.3cm,>=stealth]
\draw[->] (-0.08,0) -- (1.18,0) node[right] {$e_1$};
\draw[->] (0,-0.08) -- (0,1.16) node[above] {$e_2$};
\draw[->,thick] (0,0) -- (1,0) node[below right] {$u=v_{A1}$};
\draw[->,dashed] (0,0) -- (0,1) node[left] {$v_{A2}$};
\draw[->,thick] (0,0) -- (0.707,0.707) node[above left] {$q_A$};
\draw[->,thick] (0,0) -- (0.8,0.6) node[above right] {$q_B$};
\end{tikzpicture}As separate empirical context, Radford et al. trained CLIP on 400 million WebImageText image/text pairs. Unless otherwise specified, their reported “CLIP” results use ViT-L/14@336px, trained for 32 epochs with one additional high-resolution epoch. On their 27-dataset suite, zero-shot CLIP outperformed a regularized logistic-regression classifier on ResNet-50 features on 16 datasets. Their default “A photo of a {label}” prompt improved ImageNet accuracy by 1.3%, and ensembling 80 prompts added a further 3.5 percentage points over that default. These are measured outcomes under the paper's data, models, training, evaluation suite, and prompt choices.
In §3.3, the authors report that zero-shot CLIP improved effective robustness relative to ImageNet models across seven natural distribution shifts, reducing the robustness gap by up to 75%. Their dataset-specific class prompts increased average effective robustness by 5%, with gains concentrated on a few datasets. They caution that these results do not isolate the cause of the robustness gap and that pretraining and evaluation distributions may share spurious correlations.
In §5, the authors report median detected overlap of 2.2% and mean overlap of 3.2% across 35 evaluation datasets; only seven datasets had an overall accuracy change above 0.1%, and the largest detected increase was 0.6% on Birdsnap. They also state that detector recall could not be checked across all 400 million training pairs and that the Overlap and Clean subsets could differ in distribution or difficulty. Section 6 notes that the benchmark suite was partly co-adapted through repeated validation-set queries and reports weak results on fine-grained, systematic, novel, and truly out-of-distribution tasks. These results and limitations supply no general guarantee of transfer, out-of-distribution accuracy, reasoning, fairness, or semantic alignment.
Example references
Facts & Assumptions
Given: The two finite embedding setups, the class descriptions with their stated meanings, the source/target evaluation laws, a positive scale , and the specified individual-text retrieval and finite 0–1 error rules. Verify the prompt-dependent classifier outputs, the retrieval/classification difference, the semantic-pair similarity contrast, and both finite error values.
Zero-shot prompt classification: For each class, normalize each prompt embedding, average and renormalize those vectors to form a prototype, score it by the scaled inner product with the normalized image embedding, and return the least-index class maximizing the score.
In the first setup, , , , and . Under the alternate wording, and the vectors remain unchanged. Retrieval ranks the four individual prompt embeddings by inner product with .
In the second setup, , , , , and the fixed labels are , . The source law places masses on , and the target law places masses on those same labeled inputs. Error is the total mass assigned to misclassified inputs.
The class-specific descriptions are true only of classes , respectively, among these two classes, and their normalized text embeddings are and .
Verification
Given: The two finite embedding setups, the class descriptions with their stated meanings, the source/target evaluation laws, a positive scale , and the specified individual-text retrieval and finite 0–1 error rules. Verify the prompt-dependent classifier outputs, the retrieval/classification difference, the semantic-pair similarity contrast, and both finite error values.
Under the first wording, the normalized mean of and is , while the two prompts average to .
Under the alternate wording, the prototype is and the prototype remains , giving scores and . Thus the same image is classified as after the prompt change.
In the second setup both image embeddings equal , so their scores against are and the classifier predicts on both images. It is correct on and incorrect on .
Their scores are and . Since both sides are positive and , , so the class-prototype classifier returns .
Since , the source law gives input mass to and the target law gives it , with the reverse masses at ; the label assigned to each image is fixed. The only error atom has source mass and target mass . Therefore the source and target errors are and , respectively, with difference .
The individual retrieval dot products are . Since , retrieval returns the first prompt, unlike the class-prototype classifier.
By [A2] and [A3], is a image and is false of , so is semantically mismatched. The stated inner-product formula gives similarity for and for the matched pair .