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.
Convex Contact And Mixing
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- 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
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Hereditary and Productive Behaviour of the Separation Axioms
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Jacobi Fields, Conjugate Points, and the Cut Locus
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Nonsmooth Equilibrium
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordered Composition
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Relations, Functions, and Quotients
- Riemannian Metrics Length Distance and Volume
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Smooth Manifolds and Smooth Maps
- Smooth Vector Bundles and Sections
- Subspaces, Products, and Quotients
- Suprema and Infima
- Tangent Cotangent and the Differential
- Tensor Fields Exterior Algebra and Differential Forms
- The Analytic Hahn Banach Theorem
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Fundamental Theorems of Calculus
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This mathematics page develops forward sectors from A1–A7 and S1–S3, presents conditional results on their convex geometry, fixed-work orientation, Lipschitz boundary graph, nesting, and comparison completeness for finite scaled copies of one simple type. Thermal strips glue the local reference coordinates. The contact calibrator and arbitrary-family entropy results are explicitly conditional on the stated thermal assumptions, including join coherence C1 and universal thermal range T5. The later finite-chain cost and no-sinks offset results concern only the stated weak monotonicity across admitted transitions; no no-gap equality is claimed. These are mathematical deductions under declared hypotheses, not empirical laws.
All carriers are drafts. Their local deductions are reviewed separately from publication or workflow acceptance; the declared page prerequisites must also be resolved before page readiness.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
Forward-sector hypotheses for a simple state domain
Definition
Let be a set of primitive type labels. A formal type records a finitely supported amount function , not identically zero. Primitive generators have their unit amount function. Positive scaling, separated product, and thermal-join constructors retain distinct formal tags and obey
Separated and joined types are distinct constructors even when their amount functions agree. Permutation, reassociation, and scaled-splitting conventions preserve the amount function. Define the positive bookkeeping weight , a finite sum over support. Thus and every product or join has weight . The optional empty unit has zero amount function and weight zero; it is represented only by the empty compound, not as a simple chart. These are formal amounts, not masses in kilograms or an empirical conservation law. The functions and pointwise operations use The vector space of all functions with pointwise operations, and as the case ; their finite-support convention and finite sums are those of Tagged scalable compounds and Compound mass is well-defined and additive.
For Euclidean vectors use and . Write . Open means each point has such a ball contained in the set; convex means belongs to the set for all its and . In a subspace or subset, use intersections of these balls for the relative topology. A map is locally Lipschitz if each has a relative neighborhood and finite with for all . A set is arcwise connected here if each two distinct points are joined by a continuous injective map with those endpoints; singleton and empty sets satisfy this condition vacuously. Continuity uses the indicated Euclidean relative topology. Let index the declared family of simple types . For each simple type in that family, let and let be nonempty, open and convex, with coordinates . The notation for a type and its chart is shared, but each state has a distinct raw tag . Scaled charts are distinct tagged copies with coordinate transport ; transported raw tags remain distinct from the original raw tags. Let be the unit point mass from Tagged scalable compounds. The represented state is
Write when already carries its type tag. All state notation in this framework's compound comparisons, including a bare , denotes ; a raw unit point mass is always written . A separated pair is addition of represented states, not a unit product tag. Nonnegative multiples are pointwise and zero terms are omitted. For an encoded compound , its aggregate composition is the finite amount function
Fix the formal interpretation as the finite separated preparation whose factor at each nonzero raw tag is the amount of that typed state, using the declared coordinate scaling transport. Let be the set of these preparations, with an invariant bookkeeping mass satisfying . As additional model data choose a binary relation . Define its pullback on encoded compounds by if and only if . The transport, reversibility and A1–A7 assumptions below constrain this chosen relation; they do not construct it from coordinates. Merging or splitting repeated copies of the same preparation is reversible; permutation and reassociation preserve the preparation. Thus and are the same declared scaled preparation and yield
although their raw point masses have different tags and are not equal. This reversible transport commutes with finite composition, nested type constructors, and scaled splitting. It is part of the precise formal scaling interpretation, not a deduction about physical accessibility from coordinate multiplication. A physical use must adopt the stated preparation maps and accessibility assumptions; fixed-composition models compare only preparations with the same , while a declared channel model may additionally compare different compositions of equal .
This Definition restricts comparisons to ; the coefficient-map supplier defines the mass, not the comparison relation. Write when both directions hold, and when only the forward direction holds. On any fixed simple type, dividing every represented state by the same positive constant gives its unit-point-mass comparison. Positive scaling and its inverse preserve and reflect order. An additive entropy density for this fixed type means a function such that, for every two finite nonnegative unit-point-mass compounds and with , one has
Empty sums are zero. Given such an , define on compounds supported on this type. Its represented-state values are and for finite nonnegative . These identities follow by substituting the raw coefficients in the finite sum. Representing only the comparisons is insufficient for the displayed compound equivalence. Existence of an additive entropy density is not assumed here; a later representation theorem must establish it under its full compound-comparison hypotheses. No independent rescaling across different types is assumed without a calibrator.
The common relation satisfies A1–A6 on all equal-mass finite compounds: (A1) reflexivity; (A2) transitivity; (A3) if , then for every compound ; (A4) if , then for every ; (A5) is equivalent to for and , with the reversible scaled-copy transport above; (A6) for equal-mass , fixed positive equal-mass spectators , and every sequence decreasing to zero, for all implies . These are hypotheses, not conclusions. No comparison hypothesis is included here.
For each and , define the forward sector . The simple-domain assumptions are: (A7) for and , the encoded compound compares to ; both have bookkeeping mass , and convexity puts the recombined coordinate in the chart; (S1) each has a strict successor; (S2) has exactly one supporting hyperplane at , expressible as with a finite-valued slope map , and is locally Lipschitz; (S3) the boundary of relative to is arcwise connected. A supporting hyperplane means that lies in one of its closed half-spaces and meets the plane at . The affine hull is the smallest affine subspace containing a set; relative interior is interior in that affine hull. Closure and boundary are taken in the indicated affine hull or in , as named; boundary is closure intersected with closure of the complement in that relative topology.
This definition imposes no physical interpretation, units, or empirical claim. A contact theorem that uses joins must separately assume that each join is a simple domain satisfying these same forward-sector hypotheses.
Thermal joins and conditional contact hypotheses
Definition
For two simple domains and , write their coordinates and . Their thermal-join domain is
The joined simple type is a distinct formal tag with amount function and weight , as defined in Forward-sector hypotheses for a simple state domain. Encode the separated pair by and a joined coordinate by . Their bookkeeping masses agree, and their aggregate composition functions agree. These encoded maps and their raw tags remain distinct. Positive coordinate-scaled copies use the reversible preparation transport of that definition; nested joins preserve their finite primitive amount function under reassociation and permutation. The empty type contributes the zero map.
Write for the join state with the summed energy coordinate and the unchanged work coordinates. A compound pair and have the same total energy and work coordinates but are distinct tagged objects. Define exactly when and are accessible in both directions. Nested joins use the declared reassociation and permutation identifications.
Assume every finite join is itself a simple domain satisfying Forward-sector hypotheses for a simple state domain. The contact hypotheses are mathematical assumptions on the common relation: (T1) ; (T2) every join state has at least one reversible split into component states at its stated coordinates, and the equal-state split of any state into positive scaled copies of itself is reversible; (T3) is transitive; (T4) for every simple state there are states in its domain with and ; (T5) for every ordered pair of simple systems, every in the first and every work coordinate in the second's projection , there is a state with work coordinate and .
For the completed calibrator branch, add (C1) join coherence: whenever , the join state is thermally equivalent to each of and under the nested-join identifications. The coordinate sum in the definition alone does not assert C1. In later theorem statements, T1–T5 and C1 are explicitly listed as hypotheses; they are not treated as established physical laws.
Relative interiors of finite-dimensional convex sets
Statement
For a nonempty set , define . With a fixed , this is , where span consists of finite linear combinations. An affine Euclidean space is such a translate of a finite-dimensional linear subspace with its induced Euclidean distance. Relative balls use this distance; interior means containing a relative ball, and closure means every relative ball meets the set. Let be a nonempty convex subset of a finite-dimensional affine Euclidean space . Its relative interior is the interior in . Then is nonempty. If , , and , then .
Facts & Assumptions
Given: A nonempty convex in finite dimension. Affine dimension is the dimension of its translation space.
A convex subset of contains every line segment between two of its points: every finite convex combination of points of belongs to .
Proof
Let . If , then is a singleton and is open in its affine hull. If , the definition of affine hull supplies affinely independent points of spanning it. Their simplex lies in by [F1]. Its barycenter has all barycentric coordinates positive; sufficiently small coordinate perturbations preserve positivity and their sum one. Thus a relative neighborhood of that barycenter lies in the simplex, proving .
Fix as in the Statement. The case is . Suppose and put . Choose so the relative ball lies in . Since , choose one with . For every , put . Then , so and by [F1]. A relative neighborhood of lies in , so .
Supporting hyperplanes at relative boundary points
Statement
For nonempty , define . An affine Euclidean space is a translate of a finite-dimensional real linear subspace with the induced Euclidean metric. A supporting hyperplane at is for a nonzero vector , with in the set and all its points in one closed half-space. Let be a nonempty convex set in a finite-dimensional affine Euclidean space of dimension , let , and put . If (that is, and every relative neighborhood of meets ), then there is a nonzero linear functional on the translation space of such that for all . If has affine dimension at most , then every has at least two distinct ambient supporting hyperplanes containing .
Facts & Assumptions
Given: The stated finite-dimensional affine Euclidean space and convex set.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: closed bounded subsets of finite-dimensional Euclidean space are compact.
The Euclidean inner product on : Euclidean coordinates identify linear functionals with vectors and give the usual unit sphere.
A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real function on a nonempty compact metric space attains its minimum.
Unit spheres in finite-dimensional normed spaces are sequentially compact: unit spheres in finite-dimensional normed spaces are sequentially compact without a choice principle.
The rationals embed densely in the reals: rational coordinates are dense in real coordinates.
Reciprocals of the positive integers decrease to zero supplies the positive real sequence , , decreasing to zero with the canonical-natural field convention.
Proof
Fix affine coordinates . Closure preserves convexity without choosing approximating sequences: for and any , choose two points of within of them; their convex combination approximates within , so this point lies in . Enumerate rational -tuples canonically by increasing sums of absolute numerators and positive denominators, breaking the finite ties lexicographically. Density [F6] and the open complement of show that for each at least one enumerated point lies in . Let be the first such point. This is a uniquely specified sequence with , not a countable selection of arbitrary witnesses.
The nonempty compact set contains . By [F2] and [F4], squared distance to attains a minimum there, and every point outside that ball is farther than the candidate . Thus a nearest point exists. It is unique: if two distinct minimizers had squared distance , their midpoint would have squared distance , contradicting minimality and convexity. Consequently is also canonically determined. Since , put . Expanding the distance at and letting gives for every . Also .
Every has norm one. The exact choice-free sequential-compactness supplier [F5] gives a subsequence converging to a unit vector . This introduces no additional choice hypothesis.
For every , pass to the limit in along that subsequence. Continuity of the Euclidean pairing and give . The unit vector defines a nonzero supporting functional for , hence for , at .
If has affine hull of dimension at most , write its direction space as the span of independent vectors . Its orthogonal complement is the solution space of the homogeneous equations . Row reduction has at most pivot variables, leaving at least free variables. Assigning one free variable the value one and the others zero gives two independent solutions (their free-coordinate vectors are different unit vectors). Thus choose two nonparallel nonzero normals orthogonal to the direction space of . For each , the hyperplane contains and therefore supports at . The two hyperplanes are distinct because their normals are not parallel.
Interior rays from a unique supporting plane
Statement
Use the Euclidean distance ; consists of points containing a ball in , closure consists of points whose every ball meets , and . Closed means equal to closure. A supporting hyperplane at is with and contained in one closed half-space. Let be closed and convex with nonempty interior, , and let . Suppose has exactly one supporting hyperplane at . Choose its inward unit normal , so for every . Then for every with , there is such that for every .
Facts & Assumptions
Given: The closed convex set, boundary point, unique supporting hyperplane, and Euclidean inner product.
Strictly separate a point from a nonempty closed convex Euclidean set: a point outside a nonempty closed convex Euclidean set admits a strict separating linear functional.
The Euclidean inner product on : Euclidean linear functionals are represented by vectors.
A convex subset of contains every line segment between two of its points: finite convex combinations of points in a convex set remain in it.
Proof
Let . This is a closed convex cone. If a nonzero functional is nonnegative on , then it is nonnegative on , so its zero plane through supports . Uniqueness in the hypothesis makes that plane the plane with normal ; the inward sign forces for some .
The support at gives . If with were outside , strict separation [F1] of from the cone would give a nonzero functional nonnegative on and negative at : the separating bound is zero because and is a cone. Step 1.1 then makes a positive multiple of , contradicting . Thus the open half-space lies in , and each such is an interior point of .
Fix such . Since , choose affinely independent vectors in a small ball about whose simplex contains a neighborhood of . Approximate each vector by a nonzero cone generator with , . Sufficiently close approximations preserve affine independence and keep in the simplex interior, so a neighborhood of lies in the simplex of the . For each , write with and . Put . The nonnegative barycentric weights sum to one, so for every .
Choose with . For and each , is a convex combination of points of , hence lies in by [F4]. Therefore , so a neighborhood of lies in and .
Finite convex functions are locally Lipschitz
Statement
Use the Euclidean norm , and balls . A set is open if it contains a ball about each of its points. Let be open and convex, and let be finite and convex, meaning for every and . For every , there are a neighborhood of and such that for all . The same conclusion holds for finite concave functions by applying the result to .
Facts & Assumptions
Given: The open convex domain, finite-valued function, and Euclidean norm.
A convex subset of contains every line segment between two of its points: line segments and finite convex combinations of points in a convex set remain in that set.
Proof
Choose a closed cube centered at whose concentric dilation by factor lies in . Every point of the cube is a convex combination of its finitely many vertices, so [F1] and convexity bound above there by the largest vertex value . If lies in the cube, then lies in the dilated cube; convexity gives , hence , where is the largest value of at the finitely many vertices of the dilated cube, an upper bound there by the same convex-combination argument. Thus is bounded above and below on a ball about .
Choose concentric balls on which . For distinct , extend the segment from through to , which lies in . Put , so . Convexity yields . Repeating with interchanged gives the reverse bound. Negation proves the concave case.
Zero-start integral inequality
Statement
Use the Darboux integral on nondegenerate intervals and the convention . Let , , and let be continuous. If for every , then for every .
Facts & Assumptions
Given: A nonnegative continuous function and the stated integral inequality.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous function on a compact interval is Riemann integrable.
Sums, scalar multiples, products and quotients: , , , and when , The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with , and The mean value theorem, as the case of Cauchy's: for continuous on with and differentiable on there is with : the product rule, chain rule, and mean value theorem apply to the displayed differentiable real functions.
The exponential function is smooth and : for every real .
The lower and upper Darboux integrals of a bounded on as and , Darboux integrability as their equality, and the notation : a Riemann/Darboux integrable real function is bounded.
Proof
For a continuous function on , the Darboux definition gives whenever , because every lower and upper sum has these bounds. For , concatenating partitions of and adds both their lower sums and their upper sums. By integrability [F1], choose on each interval a lower sum within of its integral and an upper sum within of its integral, and refine these finitely many partitions together. The concatenated sums sandwich within of ; letting proves additivity. This also holds when is an endpoint under the zero-interval convention. Define reversed integrals by . By [F1], the integral defining exists. Continuity of gives on : the difference quotient error is bounded by , which tends to zero as . By [F4], choose a finite with . Then for all , which proves continuity at the endpoints as well as in the interior. The hypothesis gives , so [F2]–[F3] yield for on . The mean value theorem makes nonincreasing; since and , and .
For any , the nonnegative continuous function has integral . If at any , continuity gives a positive lower bound on a nonempty subinterval of , contradicting . At the assumed inequality gives ; nonnegativity gives . Hence .
Spectator cancellation without comparison completeness
Statement
Under A1–A6 of Forward-sector hypotheses for a simple state domain, for compounds with and every finite spectator compound , if and only if . Consequently, for finite-support signed maps of equal total coefficient, define by . This relation is well-defined, agrees with on nonnegative maps, is invariant under adding a common signed map, is transitive, and is closed under addition of two comparisons. No comparison hypothesis is used.
Facts & Assumptions
Given: Finite-support nonnegative compound maps, equal-mass comparisons, and A1–A6.
Forward-sector hypotheses for a simple state domain: the compound relation is reflexive and transitive, composition-consistent, positively scale-invariant, admits splitting/recombination, and satisfies the stated fixed-spectator stability axiom. It does not assume CH.
Tagged scalable compounds: compounds are finite-support nonnegative maps; their total coefficient masses add under composition and scale under nonnegative dilation. Compound mass is well-defined and additive also proves that zero mass is equivalent to the empty map; the spectator need not have the same mass as either base.
Signed comparison for forward-sector relations: for equal-total finite-support maps , means , with common signed translation leaving the difference unchanged.
The canonical natural of a field and Canonical naturals are positive and strictly increasing give the canonical embedding , whose successor values are positive and are finite sums of . Reciprocals of the positive integers decrease to zero gives the real sequence , , with .
Proof
Suppose and . For each , set and , and write . The embedding's successor rule and finite induction show that the sum of copies of is , and likewise for . Scaling the given comparison by gives . By composition consistency, replace the copies of one at a time by , keeping the already replaced copies, the remaining copies, and as spectators; after these finitely many replacements, . This holds for every natural index . By [F3], and , so stability with gives . If , nonnegativity implies and the conclusion is the premise itself. Conversely, gives by consistency.
For equal-total signed maps , the difference has finite support and total coefficient zero, so . If are nonnegative, their pointwise common part gives and . Cancellation in step 1.1 proves exactly when , which by [F2] is ; adding a common signed map leaves unchanged by [F2].
If and , [F2] identifies these with comparisons of to and to . Consistency combines them. Their pointwise common minimum cancels by step 1.1, leaving , which [F2] identifies as . The same finite-sum argument proves closure under addition; reflexivity follows from reflexivity of the zero compound.
Signed comparison for forward-sector relations
Definition
Let be finite-support real coefficient maps on the tagged state labels of Tagged scalable compounds with equal total coefficient. For a typed state , compound notation uses the represented map from Forward-sector hypotheses for a simple state domain; its raw unit point mass is . Signed maps still use the ordinary total of their raw coefficients, exactly the bookkeeping mass of the represented nonnegative maps. Put , and . Define to mean under the compound relation of Forward-sector hypotheses for a simple state domain. Write when both and . These are formal signed comparison maps, not physical negative amounts. The positive and negative parts are finite-support compounds of equal mass. If , then for every real : positive uses scaling, is reflexivity, and negative swaps the positive and negative parts while equivalence supplies both comparison directions. This Definition introduces the signed notation; ordinary-order compatibility and the signed-order laws are proved separately.
Scaling invariance of thermal equivalence
Statement
Under T1–T3 and the equal-state reversible split in Thermal joins and conditional contact hypotheses, if then for every .
Facts & Assumptions
Given: The contact and scaling assumptions for tagged states and their joins.
Thermal joins and conditional contact hypotheses: each equal-state scaled pair is reversibly equivalent to its join, and thermal equivalence is transitive.
Proof
Let be any typed state and . The state in the scaled type has the equal-state reversible split with fractions and ; its two components are exactly and . Thus is reversible with its join, which by definition is . The same argument gives .
Since , symmetry gives . Transitivity with yields ; symmetry then gives . Transitivity with now yields .
A unique reference coordinate inside a thermal strip
Statement
Let a simple domain and its finite thermal joins satisfy Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses. Let with , and let satisfy . For , write for the compound state , omitting a zero coefficient at the endpoints. Then there is a unique with in the common accessibility relation.
Facts & Assumptions
Given: The compound axioms A1–A6, thermal-join axioms T1–T3 with the equal-state split, strict strip endpoints, and join closure.
Forward-sector hypotheses for a simple state domain: compounds have the preorder, consistency, positive scaling, splitting, and stability assumptions; CH is not part of this definition.
Thermal joins and conditional contact hypotheses and Scaling invariance of thermal equivalence: an equal-state split is reversible, thermal equivalence is transitive, and scaling either member of a thermal-equilibrium pair preserves thermal equivalence.
Signed comparison for forward-sector relations and Spectator cancellation without comparison completeness: equal-total signed maps compare by their positive and negative parts; cancellation is valid under A1–A6 without CH.
Nesting and comparison of simple-system states: every pair of states in each finite join domain is comparable.
Proof
Given: [A1], [F1]–[F3], and .
For , the signed difference has positive part and negative part . Since , positive scaling and [F2] give . A reverse comparison would, by [F2] and inverse positive scaling, give , contrary to strictness. Thus the reference states are strictly ordered by parameter.
For , [F1] makes and thermally equivalent. By the definition of thermal equivalence, their compound is reversible with its join state. The equal-state split makes reversible with its join state and with . Both join states belong to the join of two scaled copies of the same simple domain, so [F3] compares them. The endpoint cases use and directly. Hence and are comparable for every .
Let . The strict endpoint comparison puts in . Step 1.1 and transitivity make downward closed. Let . If , then for every sufficiently large . Since , consistency yields . Stability with bases and fixed spectators gives . If , this comparison is the given .
If , then for every sufficiently large . Step 1.2 gives comparability and the definition of excludes , so . The identity and stability yield . If , the strict strip gives ; together with step 2.1 this would imply , contrary to . Thus , and step 2.1 and the preceding stability comparison give .
The equivalence also excludes , because and , and excludes by strictness of . If for another , transitivity gives ; step 1.1 then forces . Hence the parameter is unique and lies in .
Convexity and relative closedness of forward sectors
Statement
Under Forward-sector hypotheses for a simple state domain, for every simple state , the forward sector is convex and closed relative to . For collinear , , implies , and implies .
Facts & Assumptions
Given: A1–A7 and S1–S3 on a nonempty open convex domain .
Forward-sector hypotheses for a simple state domain: A1–A7 include consistency, scaling, splitting, convex-combination access, and stability for positive spectators.
Relative interiors of finite-dimensional convex sets: a nonempty convex set has nonempty relative interior, and segments from a relative-interior point to a closure point, excluding the closure endpoint, remain in the relative interior.
Spectator cancellation without comparison completeness: any finite common spectator cancels when the two bases have equal mass, under A1–A6 without CH.
Proof
If and , splitting gives . Consistency, positive scaling, and transitivity then give . The convex-combination access hypothesis in [A1] gives , so the convex combination belongs to .
Let with . The convex-combination access hypothesis in [A1] gives . Splitting gives . If , scaling by and adding gives . Compose and cancel the common by [F2], then scale by , to get . If instead , scaling by and adding gives ; recombination gives .
Take . If , the claim is immediate. Otherwise choose by [F1]. Because is open, choose for some . For every integer , lies in by [F1], so . Also . The convex-combination access hypothesis in [A1] gives ; scaling by and using the reversible split of gives .
Consistency adds the same spectator to , and transitivity with step 2.1 gives for every . Apply the stability hypothesis in [A1] to bases , fixed positive equal-mass represented spectators , and the tail sequence with . It follows that . Thus every relative closure point belongs to .
Every forward sector has nonempty interior
Statement
Under Forward-sector hypotheses for a simple state domain, every forward sector has nonempty interior in its ambient simple domain .
Facts & Assumptions
Given: A1–A7 and S1–S3 on an open convex , .
Forward-sector hypotheses for a simple state domain: each sector is supported at every state by exactly one hyperplane, and every state has a strict successor.
Convexity and relative closedness of forward sectors: is convex and closed relative to ; if , then by transitivity.
Supporting hyperplanes at relative boundary points: a convex set has a support at its relative boundary in its affine hull, and a set of affine dimension at most has at least two distinct ambient supports through each of its points.
Relative interiors of finite-dimensional convex sets: a convex set has nonempty relative interior, and every segment from a relative-interior point to a closure point, except for the closure endpoint, stays in the relative interior.
Proof
Suppose has empty ambient interior. If , S1 supplies a strict successor ; convexity puts the nondegenerate interval between and in , contradicting empty interior. Thus take . The affine hull of has dimension at most . If its dimension were at most , [F2] would give two distinct supporting hyperplanes at , contradicting S2. Hence its affine hull is a hyperplane ; this supports at every point, including .
By S1 choose with . Then and . Transitivity gives . If had affine dimension at most , [F2] would again give multiple ambient supports at , contrary to S2. Thus .
Choose by [F3]. The segment from to is contained in by convexity of both sets, starts in , and ends outside . Its intersection with is closed by relative closedness [F1], so it has a last point before . Points immediately after on this segment lie outside and, because is closed in the open set , outside . Thus . The support statement [F2] supplies a nonzero functional on whose zero hyperplane supports at .
Extend this functional to the ambient Euclidean space by taking its normal vector in the direction space of . Its zero hyperplane contains the within- support and is not itself. Since , transitivity gives , so the extended plane supports at ; the plane also supports . These are distinct, contradicting S2 at . Therefore has nonempty ambient interior.
Nesting and comparison of simple-system states
Statement
Under Forward-sector hypotheses for a simple state domain, the sectors are nested: if , then ; equality holds when , and when . For every , either or (possibly both). Strict comparison is exactly interior membership: if and only if .
Facts & Assumptions
Given: A1–A7 and S1–S3 on a simple domain .
Forward-sector hypotheses for a simple state domain: is defined by , every state is in its own sector, and each support plane is unique.
Convexity and relative closedness of forward sectors: sectors are convex and relatively closed; the collinear implications hold.
Every forward sector has nonempty interior: every sector has nonempty ambient interior.
Forward orientation and the Lipschitz boundary graph: if , then .
Relative interiors of finite-dimensional convex sets: if is in the relative interior of a convex set and lies in its closure, then lies in the relative interior for every .
Proof
If , transitivity gives . If also , [F3] gives equality. Suppose instead . If met at , then and [F3] would give . Since , transitivity gives , so . But S2 puts on , contradicting . Thus avoids and, being a subset of the closed sector , lies in .
Suppose neither nor . Choose using [F2]. The segment from to lies in and meets at a point strictly between its endpoints. By [F3], , so . The collinear implication in [F1], applied to , gives . Hence every lies in . Reversing gives .
Because is full-dimensional by [F2], its affine hull is the ambient space. Fix . For any , relative closedness gives , and [F4] puts in for every . Letting shows . The reverse inclusion follows because is relatively closed. Hence ; the same holds for . Relative closedness from [F1] therefore extends the two interior inclusions in step 1.2 to and . Equality would put , contradicting the supposition. Thus at least one of or always holds.
If , then . If is a boundary point, step 1.1 gives , hence and . Otherwise step 1.1 gives , and because S2 places on . Thus . Conversely, if , step 1.1 and S2 show , so .
Forward orientation and the Lipschitz boundary graph
Statement
Under Forward-sector hypotheses for a simple state domain, each simple domain has one orientation sign , constant across the domain, such that at fixed work coordinate , exactly when . In coordinates oriented so , for each the projection of onto work coordinates is open and connected; the boundary is the graph of a function with locally Lipschitz derivative
If , then and their boundary graphs agree.
Facts & Assumptions
Given: A1–A7 and S1–S3 on an open convex simple domain .
Forward-sector hypotheses for a simple state domain: each is supported at by a unique finite-slope plane; is locally Lipschitz.
Convexity and relative closedness of forward sectors: is convex and closed relative to , and its collinear order implications hold.
Every forward sector has nonempty interior: every has nonempty ambient interior.
Supporting hyperplanes at relative boundary points: a convex set has a support at each relative boundary point of its closure in its affine hull.
Interior rays from a unique supporting plane: at a full-dimensional convex set's boundary point with a unique support, every direction strictly toward the supporting half-space's interior enters the set's interior for all sufficiently small positive steps.
Finite convex functions are locally Lipschitz: every finite convex function on an open convex set is locally Lipschitz.
Zero-start integral inequality: a nonnegative continuous function bounded by a constant times its zero-start integral is identically zero.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: closed bounded subsets of finite-dimensional Euclidean space are compact.
The total (Fréchet) derivative as the linear first-order approximation with remainder, Euclidean maps and diffeomorphisms, If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, and The chain rule for total derivatives: : the stated maps have total derivatives, and the derivative of a composition of Euclidean maps is the composition of those derivatives.
Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative: a continuous function on a closed interval, differentiable in its interior with an integrable derivative extension, has endpoint increment equal to the integral of that derivative.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.
Proof
Given: [A1] and [F1]–[F10]. Write a support plane's inward unit normal with energy component nonzero, as ensured by its finite-slope form.
To apply [F4] to a sector at a boundary point , choose with and put . This is globally closed and convex, and agrees with near . It has nonempty interior: join to an interior point of and take points sufficiently close to . Supporting planes at coincide for and : a local supporting inequality extends along every segment from to a point of . Any such plane also supports at , so S2 makes it unique. Thus [F4] applies to and its interior conclusions hold for locally. For fixed , the vertical section is a relatively closed convex interval by [F1]. The support plane at confines it to one side of . Its inward normal has nonzero energy component, so [F4] gives a nontrivial interior vertical segment on that side.
Let be two graph solutions of on a common open domain, and suppose . Since is locally Lipschitz, choose a convex neighborhood of on which one Lipschitz constant works. Continuity of lets us choose a convex ball about whose closure lies in the common domain and whose two graph images stay in that neighborhood; take any in a smaller concentric ball. Put and for . By [F8], is and The local Lipschitz bound for gives . The derivative is continuous, hence integrable by [F10]; [F9] gives ; hence . Apply [F6] on to obtain . Thus near . Along any polygonal path in the common open domain, the set of path parameters at which equality holds is closed by continuity and open by this local result; since the path interval is connected and the set is nonempty, equality holds along the whole path. Every open connected subset of Euclidean space is polygonally connected: points reachable from a fixed point by finitely many segments in small balls form a nonempty relatively open and relatively closed set. Therefore equality extends throughout each common connected domain.
The convex, relatively closed interval contains a nontrivial segment on the inward side by step 1.1 and [F4]. Suppose it does not contain the whole open -fiber on that side. Its endpoint toward that side then lies inside ; relative closedness puts in , so the interval from to is a compact nondegenerate interval by [F7]. Let be its midpoint. Since , transitivity gives . The supporting plane of has nonzero energy coefficient, so its vertical section lies wholly on one side of ; being contained in , it lies in one half of and has at most half its length. It is nonempty and closed relative to , hence compact. Repeat: take the midpoint of the current compact interval ; then , so the next section is nested inside the current one and again has at most half its length. These intervals have nonempty total intersection: otherwise their open complements would cover the first compact interval, a finite subcover would do so by [F7], and nesting would make one interval empty. Their lengths tend to zero, so the intersection has a unique point , still in the first interval contained in . The midpoint recursion and this unique intersection require no selection from an arbitrary countable family. Relative closedness puts in every , hence by transitivity. Its vertical section is therefore only , contradicting the nontrivial interior vertical segment at supplied by [F4]. Thus contains the whole open fiber on its inward side.
All states on a fixed work-coordinate fiber have the same orientation. If is oriented upward and a state above it were oriented downward, the full upward section from step 2.1 gives , and the full downward section from gives for a state below , contradicting the support at . If a state below an upward were oriented downward, choose above with ; the first collinear implication in [F1], applied to between and , gives , contradicting the downward support at . The reversed argument handles a downward .
By step 3.1, orientation is constant on each fixed-work fiber. The fiber orientation is locally constant in . At any , choose one vertical point just inside the supported half-space and one just outside; by [F4] the inside point can be chosen in . Openness of and of the interior and exterior regions preserves these memberships on nearby fibers. Each such fiber therefore meets between these two energy values. A support of at that boundary point also supports the point's own sector and so has its S2 orientation; the inside/outside placement fixes that orientation. Thus nearby fibers have the same sign as the fiber through . Since is convex, it is connected; a locally constant two-valued sign is constant.
Adopt the coordinate convention . Step 2.1 and the common orientation give exactly for at fixed , with strict comparison for .
Put . At a boundary point , [F3] supplies a support to . Because , that plane also supports and equals its unique S2 plane. Its finite slope gives a nonvertical inward direction; [F4] supplies nearby vertical points inside , while the opposite side is outside by the support. Neighborhoods of one inside and one outside point show every nearby work fiber meets . Hence is open. It is connected because S3 makes arcwise connected and projection is continuous. By step 5.1, every vertical fiber over has exactly one boundary energy; call it .
For , convexity of puts every convex combination of their boundary states in . On any sufficiently small convex ball in , the unique-boundary property and upward orientation make the least energy in each fiber. Therefore , so is finite and convex there. It is locally Lipschitz by [F5]. The inward support at gives The support at gives Local Lipschitz continuity of and makes the difference between these linear bounds . Thus is differentiable with derivative , and that derivative is locally Lipschitz. Hence with locally Lipschitz derivative.
If , then . The boundary graphs agree at and solve the same differential equation. The set of where and is nonempty, open by step 1.2, and closed by continuity and relative closedness of . Connectedness of makes it all of . This shows . The same argument, using relative closedness of , shows is relatively closed in connected ; it is relatively open because both projections are open. Hence and the boundary graphs agree. In particular , so ; together with and transitivity this gives .
Reference-strip gluing proves comparison for scaled copies
Statement
Assume Forward-sector hypotheses for a simple state domain and T1–T4 of Thermal joins and conditional contact hypotheses for every finite join. For any one simple type , every two finite compounds of its scaled copies with the same total coefficient mass are comparable. Thus CH holds on all multiple scaled products of that type. No entropy across different material types is asserted here.
Facts & Assumptions
Given: The stated forward-sector and thermal-contact hypotheses; every thermal join remains a simple domain with these hypotheses.
Forward-sector hypotheses for a simple state domain: A1–A7, S1–S3, and the tagged finite-compound conventions hold, without an assumed CH.
Thermal joins and conditional contact hypotheses: T1–T4 provide simple thermal joins, reversible equilibrium splits, thermal scaling, and a thermal endpoint pair surrounding each state.
A unique reference coordinate inside a thermal strip: every state in a strip with strict thermally equivalent endpoints is equivalent to a unique reference mixture with parameter in .
Nesting and comparison of simple-system states: one-copy comparisons hold on each finite join domain; strict comparison is interior membership, and forward sectors are nested.
Signed comparison for forward-sector relations and Spectator cancellation without comparison completeness: signed comparison is defined from positive/negative parts; it is translation invariant, additive, and cancellable under A1–A6.
Forward orientation and the Lipschitz boundary graph: each simple domain has one constant fixed-work energy orientation; arbitrarily close states on a vertical segment are strictly ordered in that orientation.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: a closed bounded subset of finite-dimensional Euclidean space is compact.
Proof
By T4, the open strips with and cover . They are open: by [F2], is , and is ; the latter set is open because is relatively closed.
Let and overlap. Their intersection is open. Choose two states in a small vertical segment contained in the overlap, using [F4]. Let be their coordinates in the first strip and in the second, supplied by [F1]. If , the signed difference and positive scaling and signed compatibility [A1, F3] give , so by the two reference equivalences; if , those references coincide and give . Both contradict . Hence , and the same argument gives .
The four reference equivalences give, in signed comparison, Put . Additivity and positive scaling in [F3] give . Applying the same algebra to the equivalences for gives . Consequently a state in the second strip with coordinate has first-chart coordinate . The change of chart is affine with strictly positive slope.
The same calculation covers a finite chain of overlapping strips: after each overlap, express the new strip's endpoint states as signed-equivalent affine maps in the existing reference pair. The local strip lemma gives every state of the added strip a coordinate with in the existing chart. Signed addition, positive scaling, translation, and equivalence under negative scaling are valid by [F3]; hence induction along a finite overlap chain gives one such common chart for every state in the union.
Take any finite list of target states in and join them in order by finitely many straight segments, which lie in by convexity. The resulting connected path is a finite union of closed bounded segments, hence compact by [F5]. The open strips from step 1.1 cover it, so compactness gives a finite subcover. The intersection graph of those strips meeting the path is connected: otherwise their unions would partition the connected path into two disjoint nonempty relatively open sets. Order a spanning tree from one root strip; each later strip overlaps an earlier one in an open set and can be glued by step 3.1. Thus every target state has a common signed chart with .
Write the arbitrary scaled-copy compounds as with and nonnegative coefficients, omitting zero terms. The declared reversible transport in [A1] gives and similarly on the other side; ordinary positive scaling and composition therefore reduce them to the unscaled base-type states with effective amounts and . Their masses are respectively and before this transport, so equal total mass implies If , both maps are empty and reflexivity applies. Otherwise use step 4.1 for the finite list of base states , with common-chart coordinates . Signed addition and splitting [F3] make the transported compounds equivalent to and , where and . If , their signed difference has positive part and negative part , so and positive scaling compare them; equality gives reflexivity, and gives the reverse comparison. Transitivity transfers this order through the reversible transports to the original distinct scaled tags. Hence CH holds for every allowed scaled-copy pair, without identifying those tags or dropping their scale factors.
Thermal joins force a common mathematical energy orientation
Statement
Let a family of simple domains satisfy Forward-sector hypotheses for a simple state domain, and suppose every pair has an admitted simple thermal join satisfying T1 and T2 of Thermal joins and conditional contact hypotheses. Then the fixed-work orientation signs from Forward orientation and the Lipschitz boundary graph agree throughout the family. One common affine proof-coordinate convention , , therefore makes each fixed-work accessibility order increase with and preserves the energy-sum formula for joins. This is a mathematical coordinate convention; it does not change a physical energy quantity or assert a sign of a measured temperature.
Facts & Assumptions
Forward-sector hypotheses for a simple state domain: the component charts are open, represented states have their positive type weights, and the relation is composition-consistent and transitive.
Thermal joins and conditional contact hypotheses: T1 sends every admissible split to its join; T2 supplies, for each join state, at least one admissible split accessible in both directions to that join state, at the same summed energy and work coordinates.
Forward orientation and the Lipschitz boundary graph: each component domain has a constant sign with fixed-work comparison equivalent to .
Spectator cancellation without comparison completeness: any finite common spectator cancels when the two bases have equal mass; its mass need not equal the base mass.
Proof
Given: [A1], [A2], [F1], and [F2].
Suppose two component signs are opposed. Choose a join state and a reversible split by T2 in [A2]. Write and . Openness in [A1] permits a sufficiently small nonzero with and in their respective charts. Choose the sign of so ; opposed signs imply . Thus [F1] gives and . These pairs have the same summed energy and work coordinates and the same represented aggregate composition and mass.
If , consistency with gives . Cancel the common represented spectator by [F2] to get , contrary to step 1.1. But T1 gives , and the chosen T2 split gives , so transitivity produces exactly this forbidden reverse comparison. Opposed signs are impossible. Every pair has an admitted join, hence one common sign works for the whole family. The affine change preserves openness and convexity and sends to ; its positive orientation describes the same accessibility relation. No physical energy, unit or calibration premise is redefined.
Thermal classes either fill the domain or split an adiabat
Statement
Let be a simple domain satisfying the forward-sector hypotheses and T1–T4. Let be the additive extensive entropy supplied by Additive extensive representation of compound comparison after CH for its finite scaled products is proved by Reference-strip gluing proves comparison for scaled copies. Then either all pairs of states in are thermally equivalent, or there are on one entropy level (equivalently, one adiabat by Nesting and comparison of simple-system states) with .
Facts & Assumptions
Given: The same-type accessibility relation, the thermal relation, the hypotheses in the Statement, and the current entropy representation.
Forward-sector hypotheses for a simple state domain: A1–A7 and S1–S3 hold; the sector theorem supplies a constant fixed-work energy orientation for each type.
Thermal joins and conditional contact hypotheses: T1–T4 hold and thermal equivalence is transitive.
Reference-strip gluing proves comparison for scaled copies: every equal-mass finite compound comparison of this simple type is complete.
Additive extensive representation of compound comparison: under that comparison property, an additive extensive entropy represents every same-type finite-compound comparison.
Forward orientation and the Lipschitz boundary graph: each simple domain has a constant orientation sign for fixed-work energy comparisons; in coordinates oriented in that sign, sector boundaries are the stated graphs.
Finite convex functions are locally Lipschitz: a finite concave entropy is continuous on the open domain.
Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line: closed bounded subsets of finite-dimensional Euclidean space are compact.
Nesting and comparison of simple-system states: a boundary point has ; strict accessibility is interior membership. Together with [F2], this identifies entropy levels with sector boundaries.
Thermal joins force a common mathematical energy orientation: T1 and the reversible-split existence in T2 force a common orientation sign; the common affine proof-coordinate change preserves all energy-sum joins and does not redefine physical energy.
Proof
Use [F7]'s common mathematical energy orientation for the proof coordinates. Apply [F2] using [F1] after dividing represented coefficient maps by the fixed positive type weight , as specified in [A1]. Multiply the resulting unit-state entropy by to evaluate represented states; this positive factor preserves all same-type order comparisons. Write for that represented-state value. The convex-combination access hypothesis in [A1] and additivity imply concavity: for , accessibility of to gives . By [F3], is strictly increasing in energy at fixed work coordinate.
Fix a work coordinate and let , an open interval. The restriction is finite, concave, continuous by [F4], and strictly increasing by [F3]. For an interior , concavity makes the right secant slopes nonincreasing as the secant endpoint moves right, and the left secant slopes monotone as the endpoint approaches ; hence the one-sided derivative limits and exist. Choose in : the secants to bound those limits, so they are finite, and concavity gives . Monotonicity gives nonnegative slopes. If , then for every concavity bounds , contradicting strict increase. Thus . Define , a nonempty compact interval of positive finite reciprocal slopes.
Suppose the second alternative fails, so each adiabat contains one thermal-equivalence class. By [F1]–[F2], . Continuity of and strict increase in energy at fixed work coordinate imply that every point with has arbitrarily nearby points with larger and smaller entropy; hence each entropy level is a forward-sector boundary. The supposition makes each lie in one thermal class. Let and, for each thermal class , put . These sets partition : two distinct classes cannot share a level under the supposition. The range is an interval, since any two points of the convex domain are joined by a segment and the continuous entropy takes every intermediate value along it.
Fix and of this same simple type, and let . The admissible energy splits form the open interval , which contains . Define . For the join state , T2 gives an admissible split whose pair is reversible with the join. For every other split , T1 gives , so . The pair states are finite compounds of two copies of this same simple type; [F1]–[F2] and their entropy representation therefore give . Thus maximizes . If the initial split is reversible with the join, it is equivalent to ; entropy representation gives equal entropy, so it too maximizes . Conversely, if maximizes , then , and [F1]–[F2] make the initial pair reversible with ; composing with shows . For a concave function at an interior point, maximality is equivalent to : right secants are bounded above by the right derivative and left secants below by the left derivative. Here The two inequalities are exactly and , which say the positive slope intervals intersect; reciprocal reverses their endpoints, so this is equivalent to .
Let be one thermal class. The compact intervals , , pairwise intersect by step 2.1. For any finite subfamily, pairwise intersection implies common intersection: the largest left endpoint is no greater than the smallest right endpoint, since the intervals attaining those two endpoints intersect. Fix ; the sets are closed subsets of the compact interval and have the finite-intersection property. Compactness [F5] gives a common point, so is a nonempty compact interval. If distinct classes had intersecting common intervals, representatives would have intersecting intervals and would be thermally equivalent by step 2.1, a contradiction. Thus the intervals for distinct classes are disjoint and strictly ordered on the real line; use this as the order of the classes.
For each work coordinate , strict continuity of maps the open interval onto an open interval . On , the level-to-class map is nondecreasing: as increases, concavity makes both one-sided slopes nonincreasing, so both endpoints of are nondecreasing. If two such intervals are disjoint, monotonicity of both endpoints forces the earlier interval to lie strictly below the later one; by step 3.1, this is the class order. The local class maps agree on overlaps of because each entropy level lies in one class. The open intervals cover . Any compact subinterval of has a finite subcover by these intervals by [F5]; its intersection graph is connected, since otherwise the connected subinterval would be split into two disjoint nonempty relatively open sets. Chaining the local orders through overlaps proves that the class map is nondecreasing on all of .
Fix and . T4 gives with . Entropy representation gives , and their levels belong to the same class . The global nondecreasing order from step 4.1 forces every level between them, including an open neighborhood of , into . Thus each class set is open in the interval . Since these disjoint open sets partition connected , only one nonempty class exists. Under the supposition, all states are thermally equivalent, proving the dichotomy.
Contact calibrators under explicit join coherence
Statement
Let be simple domains in a family of finite thermal joins satisfying A1–A7, S1–S3, T1–T5, and C1 of Forward-sector hypotheses for a simple state domain and Thermal joins and conditional contact hypotheses. Then there are in and in such that
Moreover, for every fixed finite composition of scaled copies of and , any two equal-mass states of that same composition are comparable (CH). The conclusion is conditional on the explicitly stated join-coherence and universal-range assumptions C1 and T5.
Facts & Assumptions
Given: The forward-sector and contact hypotheses for the whole join-closed family.
Forward-sector hypotheses for a simple state domain: A1–A7 and S1–S3 hold on each member of the family, including finite joins.
Thermal joins and conditional contact hypotheses: T1–T5 hold for every ordered pair in the family, and C1 makes an equilibrated joined state thermally equivalent to each equilibrium constituent.
Reference-strip gluing proves comparison for scaled copies: CH holds on every finite scaled product of copies of any simple type in the family.
Additive extensive representation of compound comparison: under that CH, each simple type and its scaled products have an additive extensive entropy representing accessibility.
Thermal classes either fill the domain or split an adiabat: for each simple join, either every pair of its states is thermally equivalent or one of its adiabats contains two thermally inequivalent states.
Nesting and comparison of simple-system states and Forward orientation and the Lipschitz boundary graph: a common adiabat has identical forward sectors; fixed-work accessibility is ordered by energy, and each component adiabat has one state at each work coordinate in its projection.
Spectator cancellation without comparison completeness and Signed comparison for forward-sector relations: signed equivalence is preserved by finite addition and cancellation of common spectators.
Thermal joins force a common mathematical energy orientation: T1–T2 and arbitrary-spectator cancellation force a common mathematical energy orientation; the common affine change preserves the join energy-sum rule.
Proof
Given: [A1]–[A2], [F1]–[F5], and [F8].
Work in [F8]'s common affine mathematical energy orientation, without redefining any physical energy or calibration. Apply [F1] and [F2] to each simple type, including every finite join, using the positive normalization by its fixed weight in [A1]. Throughout, entropy at a state means its represented-state value: times its unit-point-mass representation. This normalization preserves order and finite scalar amounts. The convex-combination access hypothesis in [A1] makes each resulting entropy concave, since the comparison of a scaled pair with its convex-combination state translates under the representation to the concavity inequality. By [F4], each entropy is strictly increasing with energy at fixed work coordinates.
Use T5 to choose and with . Let and consider its adiabat . T2 gives every on that adiabat at least one split with .
Suppose a join state on has two distinct equilibrium splits and . By the definition of , both pairs are reversible with , hence mutually accessible compounds. Their work coordinates are fixed by and their total energies equal its energy. If the first-component energies agreed, both component states in the splits would agree, so distinctness forces unequal first-component energies. If , fixed-work comparison [F4] gives ; conservation of total energy gives , hence . Taking gives because both split compounds are reversible with . If the first energies occur in the opposite order, swap the two splits and obtain the same calibrator form. Therefore, if no calibrator exists, every has a unique equilibrium split.
Assume no calibrator exists. For any equilibrium split of , reversibility with and the common adiabat give as compounds. By [F1], and are comparable; [F4] says their sectors coincide exactly when they are equivalent. If , pair reversibility gives . Consistency adds to , and cancellation [F5] gives . If , consistency and the pair comparison instead cancel to give , a contradiction. Thus , making a calibrator. The case is symmetric: it gives , again a calibrator. Since neither is allowed under the assumption, . Adding spectators to the two directions and cancelling by [F5] then gives both and , so . Thus every split on this adiabat has components in the corresponding component adiabats.
Under the no-calibrator assumption, fix a first-component work coordinate in the projection of . The boundary-graph result [F4] gives exactly one state on that component adiabat at . Every split of a join state on with first work coordinate therefore has first component . Each split is thermal, so for its second component. T3 makes all such thermally equivalent, and C1 makes each joined state thermally equivalent to . Hence all join states on this adiabat over fixed lie in one thermal class. Fixing a second-component work coordinate instead gives the corresponding conclusion for first components.
Let be the open connected work-coordinate projection of from [F4]. From any point of , the set reachable by finitely many coordinate-axis segments contained in open boxes in is relatively open, and its complement is also relatively open; connectedness makes the reachable set all of . Along each such segment, step 4.1 gives equivalence of the corresponding join states; T3 composes these finitely many equivalences. Thus the whole adiabat is one thermal class. Since the argument works for every starting join state, every join adiabat is one thermal class.
Still assuming no calibrator, apply [F3] to each join system. Its alternative with two thermally inequivalent states on one adiabat is excluded by step 5.1, so all states of each join system are thermally equivalent. For any , use T5 with one allowed second work coordinate to choose with and . C1 relates each component to its joined state, and all join states are in one thermal class; T3 therefore gives . The same argument gives one thermal class in . Now take and a split supplied by T2. Choose nonzero sufficiently small so and , possible because the domains are open. These states form a distinct split of the same . Since the original split has and each component type is one thermal class, T3 gives thermal equivalence of the changed pair as well. This contradicts uniqueness of the split from step 2.1. Therefore a calibrator exists.
Fix a calibrator , , whose existence is step 6.1. Choose same-type entropy representatives from [F2], with positive gaps and . Normalize , so both calibrator increments are one, and put and . Write and . The calibrator says , so is equivalent to zero; translation and cancellation [F5] give . For any state , the signed map has total mass and -value zero. Its positive and negative parts have equal mass and entropy, so [F2] makes them equivalent. Hence ; the same argument applies to states of the second type. These are formal signed maps when a coefficient lies outside .
For a state pair , put and . Adding the signed reductions from step 7.1 makes the pair equivalent to plus . The calibrator increment equivalence from step 7.1 makes the latter term equivalent to zero for either sign of . Thus each pair reduces to its reference map at parameter . For any finite compound with amounts of the two types, add and scale these single-state reductions. Writing for the amount-weighted sums of , respectively, gives . Using , this is equivalent to , where . If the total mass is zero, both compounds are empty and reflexivity compares them. Otherwise, for same-composition , their base terms agree. If , the positive and negative parts of the reference-map difference are and , so and positive scaling compares the maps forward. If the Q values agree the maps coincide; if the reverse comparison holds. Translation, addition, and ordinary-order compatibility [F5] transfer the result to . This proves CH for every fixed finite composition of the two types and their scaled copies.
Remarks
The proof uses C1 in steps 4.1 and 6.1 and T5 in steps 1.2 and 6.1. It does not establish the calibrator from the bare set-valued join formula or from T1–T4 alone. All conclusions remain conditional mathematical consequences of the listed hypotheses.
Calibration of an arbitrary family of simple-system entropies
Statement
Let be a nonempty set of primitive simple-system labels containing a distinguished meter label . Assume every finite separated product is explicitly represented by its finitely many tagged elementary factors; positive scaling and finite product are the only identifications. Suppose the join-closed family satisfies the hypotheses of Contact calibrators under explicit join coherence, and fix a strict meter pair in . Assume the Axiom of Choice. Then one can choose, for every , an additive constant and positive scale for its same-type entropy so that
is additive, extensive, and characterizes every same-composition comparison on every finite separated product. No conclusion is asserted for transitions that change composition.
Facts & Assumptions
Given: The explicit finite-factor family, common contact branch, strict meter pair, and Axiom of Choice.
The Axiom of Choice: every family of nonempty sets admits a choice function; it selects the reference states, entropy representatives, and calibrator data used below.
Contact calibrators under explicit join coherence: for each pair of simple types in the join-closed family, strict calibrator endpoints exist and their reversible pair relation identifies the two reference increments in signed comparison.
Additive extensive representation of compound comparison: once a type and its scaled products have CH, a finite real additive extensive entropy represents their equal-mass comparisons.
Signed comparison for forward-sector relations and Spectator cancellation without comparison completeness: signed comparison is translation-invariant and additive, agrees with ordinary comparison on nonnegative equal-mass maps, and permits common-spectator cancellation.
Proof
Given: [A1], [F1]–[F3].
Use the positive type normalization in Forward-sector hypotheses for a simple state domain whenever invoking [F2]; state entropies evaluate represented maps , and their unit-label entropy density is . Apply [F2] to the meter type and choose its entropy so and . Set the meter reference to , and use [A1] to choose a reference state and one same-type entropy representative for every . For each , use [F1] to choose calibrator states and such that , , and ; also choose . For the meter label set and ; the two pairs and are the same two-copy meter compound up to permutation. Write for the selected entropy representative, with , and put and . Define . Then and , matching the meter entropy increment across the chosen calibrator endpoints. For , , so this agrees with the fixed meter normalization.
For a finite separated compound with factors , define . The sum is finite and invariant under reordering; concatenating compounds adds the sums, and scaling every amount by multiplies it by . The explicit-factor convention in the Statement therefore makes well-defined, additive, and extensive.
Fix a composition with amounts for finitely many labels and let be two states of that same composition. For a state of type , put The same-type entropy representation and the CH for type show Indeed, the signed difference has total coefficient zero and -value zero, so its positive and negative parts have equal mass and entropy and therefore compare both ways by [F2]. The calibrator relation gives by taking the signed difference of and canceling common terms with [F3]. Add and scale these identities over the finitely many factors of . With the resulting signed map is where the sums range over the finite support of the composition. The same holds for . Since they have the same composition, the reference base cancels, and is signed-equivalent to the finite meter map Extend the meter entropy linearly to raw finite signed coefficient maps using density at a meter raw tag ; in particular its value on is . Then The positive and negative parts of have equal mass. If , the same-type entropy representation [F2] for finite meter products gives , hence compares in the forward signed direction. Translation, addition, and ordinary-order compatibility [F3] transfer this to . Conversely, if , the same signed equivalences and translation in [F3] give . The meter representation in [F2] then forces . Reversing the entropy inequality gives the reverse comparison. Thus characterizes every same-composition comparison. Each particular comparison uses only finitely many labels; no infinite sum or uncountable product occurs.
The meter normalization fixes the multiplicative unit. Changing the chosen reference state for type changes only its additive constant; on a finite compound these constants contribute amount-weighted conserved-type offsets. This proves the stated freedom and completes the construction.
Remarks
AC is used only for simultaneous reference-state, entropy-representative, and calibrator choices over the arbitrary label set . Cross-composition monotonicity requires the additional cost and offset hypotheses developed later.
Decorated finite-chain costs with catalysts
Definition
Let be a set of tagged system types closed under finite composition and positive scaling . Scaling is associative and acts componentwise on products: and . Each type has a nonempty state set of finite tagged compounds, every state in is represented by the coefficient-map interpretation of Forward-sector hypotheses for a simple state domain and has the fixed aggregate composition of its declared type, using the amount-function interpretation in Forward-sector hypotheses for a simple state domain, and has total coefficient mass , and , , with and . Matching scalar masses alone do not identify aggregate composition. The entropy is the finite additive extensive entropy from Calibration of an arbitrary family of simple-system entropies; in particular .
For each pair of types prescribe the product map by on represented coefficient maps, and require it to be surjective: . Thus each product state admits a factorization, without requiring it to be unique. For , prescribe the scaling bijection by , with inverse coefficient scaling by . The type identifications and the precise commuting conditions are specified below. Require and ; entropy is therefore independent of any nonunique product factorization. Include the formal empty unit type , with , where is the empty coefficient map, , , , and . A transition edge from type to type is a pair , such that the underlying equal-mass compounds satisfy under Forward-sector hypotheses for a simple state domain. Thus an edge can exist only when . Its cost is the finite real number .
A decorated finite chain from to consists of a catalyst type , an integer , types , and states , with an edge for every . Its cost is the finite real sum
Define the ordered extended real line by placing below every real and above every real. Finite addition retains its usual meaning; a real added to either infinity leaves that infinity, and equal-sign infinities add to themselves. Opposite-sign infinite sums are undefined. Positive multiplication preserves each infinity, and negation exchanges the infinities. For a nonempty real set bounded below, its infimum is its greatest real lower bound; completeness ensures existence. Define by taking as the infimum of all such witness costs. Set if there is no witness and if the witness costs are unbounded below. The infimum is over real witness costs, so no subtraction of extended-real infima is used. The structural identifications are product permutation and reassociation, , , , and . Their state maps are the identity on the corresponding represented coefficient maps: finite addition is commutative and associative, adds zero for the unit, and commutes with coefficient scaling. Thus the displayed product and scaling maps commute with these identifications, which preserve , , and accessibility.
Additional reversible identifications, if used, are separate specified data: a set of pairs with and, for each pair, a bijection such that and for every . Include identity pairs with identity maps and close these data under inverse and composition, with and . Require closure under positive scaling and product with another specified pair , with and . The latter must hold independently of every nonunique product factorization. These requirements give exactly the commuting product/scaling diagrams. They preserve aggregate composition and mass; replacing a state by its image preserves and reflects every comparison with any compound, by mutual accessibility, consistency and transitivity. Their maps and all structural maps must agree on overlapping identifications. One may take only the structural data, with no additional pairs. The calibration theorem does not supply additional identifications: these are hypotheses to check whenever chosen. Reversible equal-state splitting is an accessibility assertion; it does not identify every state of a product with a single unsplit state. The cost identities and inequalities require a separate proof.
Algebraic properties of decorated-chain costs
Statement
For the cost of Decorated finite-chain costs with catalysts, , is positively homogeneous, invariant under adding the same catalyst to both endpoints, and satisfies the triangle inequality whenever the extended-real sum on its right is defined. It is subadditive under composition whenever is defined. Every pair of actual forward and reverse decorated-chain witnesses has nonnegative total cost. A finite reverse witness therefore bounds all forward costs below; can occur only when the reverse direction has no witness.
Facts & Assumptions
Given: A1–A6 on accessible finite compounds, the additive extensive entropy , and the decorated-chain definition.
Forward-sector hypotheses for a simple state domain: accessibility is reflexive, transitive, consistent under common spectators, and positively scalable; stability is available.
Decorated finite-chain costs with catalysts: each chain has a finite real cost, and is its infimum, with empty infimum .
Calibration of an arbitrary family of simple-system entropies: is additive and extensive on every separated finite compound and represents same-type comparisons.
Proof
A reflexive identity edge from any nonempty state of to itself has cost zero, so . For a decorated closed chain, start with the compound containing every edge input . Apply the edge with all other edge inputs as spectators, then apply with the already produced and all still-unused inputs as spectators, and continue through . Consistency and transitivity give . Since and the intermediate types occur once on each side, these two compounds have the same total type up to the declared reassociation and permutation. Their entropy difference is exactly the chain cost. The same-type entropy representation [F2] makes this difference nonnegative. Hence every closed-chain witness costs at least zero and .
Take finite witnesses for and . Run the first chain with a fixed state of and its second catalyst as spectators; then run the second chain with the first chain's output state and first catalyst as spectators. Consistency allows both sequences, and each fixed spectator contributes zero entropy difference. The resulting witness from to has the sum of the two costs. If both infima are finite real numbers, choose witnesses within of each infimum and let . If one infimum is and the other is finite, use a fixed finite witness for the latter and arbitrarily negative witnesses for the former; the product costs are unbounded below. If both are , choose both costs arbitrarily negative, so the product infimum is . If either is and the other is not , the right side is and the inequality is automatic. The mixed extended sum is undefined and is excluded by the Statement.
A witness for is a witness for with enlarged catalyst , so . Conversely, add one fixed state of the nonempty catalyst to every edge of an arbitrary witness for . Its cost is unchanged, proving the reverse inequality. Thus .
Scaling every state, type, and catalyst in a witness by multiplies its cost by because . This gives ; applying the same argument with scale gives equality, including the extended values.
Concatenate a witness from to with one from to , adding the other chain's fixed catalyst state as spectator to each edge. The result is a witness from to whose cost is the sum. Taking finite approximations proves the triangle inequality when both costs are finite; an unbounded-below term with a finite witness in the other direction gives the corresponding case; if a term is and the sum is defined, the inequality is automatic. For an actual forward witness and an actual reverse witness with possibly different catalysts, add the reverse catalyst's fixed state to every forward edge and the forward catalyst's fixed state to every reverse edge. Consistency supplies these padded edges, and additivity makes each edge cost unchanged. The padded chains now have the same catalyst, so concatenate them into a closed chain; step 1.1 gives . Thus any fixed finite reverse witness of cost bounds every forward witness below by .
Catalyst-chain cost characterizes cross-type transitions
Statement
Assume the calibrated entropy family of Calibration of an arbitrary family of simple-system entropies, the cross-type accessibility axioms A1–A6 of Forward-sector hypotheses for a simple state domain, and the decorated cost of Decorated finite-chain costs with catalysts. For every pair of types with , and states , ,
The infimum defining need not be attained. If , the right side is false; if , the right side is true.
Facts & Assumptions
Given: The complete additive extensive entropy on every finite type, the finite-chain cost, and A1–A6 including stability.
Forward-sector hypotheses for a simple state domain: consistency permits running accessible edges with common spectators; stability removes fixed positive spectators whose common scale tends to zero.
Calibration of an arbitrary family of simple-system entropies: every type and finite separated product has a finite real additive extensive entropy representing same-composition comparisons; its Statement fixes a strict meter pair .
Decorated finite-chain costs with catalysts: is the infimum of the real costs of finite chains with an arbitrary common catalyst.
Algebraic properties of decorated-chain costs: every actual decorated-chain witness has a finite real additive cost, and costs have no negative closed cycles.
Spectator cancellation without comparison completeness: common finite compound spectators can be cancelled under A1–A6.
Reciprocals of the positive integers decrease to zero: with natural index , the real sequence is positive, strictly decreasing and converges to zero; its Facts F2–F3 explicitly interpret the Statement's denominator as .
Proof
If , the one-edge witness with an identity catalyst has cost . Hence , which is the forward inequality, including the case where no such transition can exist.
Conversely assume the displayed entropy inequality. It is impossible when . Fix an arbitrary natural index , use from [F5] and choose a decorated witness of real cost , where and is the entropy gap of a fixed strict meter pair from [F1]. Such witnesses exist from the definition of infimum, also if . Write their types as , their edges as , and their endpoints as , .
Put . In one finite compound type form These have the same composition: both contain , , the catalyst , every intermediate type , and one scaled meter state, up to reassociation and permutation. Additivity of and the definition of chain cost give Thus the same-composition entropy representation [F1] gives .
Starting from , use consistency on with as spectators. The result contains in place of . Next use with as spectators, and continue in order. At stage , the current compound contains , the earlier outputs , all later inputs , and the unchanged . After the last edge, transitivity gives , where . Compose this with from step 2.1. The compounds and share the finite spectator ; cancel it by [F4]. The result is for this . Since was arbitrary, this comparison holds for every natural index; the chain witnesses need not be chosen simultaneously.
By [F5], , stability in [A1] with bases and fixed positive spectators yields . This proves the reverse implication without assuming that any infimum is attained.
Cost-zero type offsets and their difference space
Definition
For the type set and cost of Decorated finite-chain costs with catalysts, define the relation by . Let be the set of raw type pairs. Define a relation on raw pairs by
The separate well-definedness lemma proves that is an equivalence compatible with composition and positive scaling, that is an equivalence on , and that the following operations are well-defined on its classes. After that proof, write . Define addition by , negation by , and positive scaling by . Set zero to , where is the empty unit type. Complete scalar multiplication for all by and, for , ; here , so only the already specified positive scaling of types is used. The same lemma establishes that these operations make a real vector space; no vector-space law is assumed by this Definition.
The cost-zero offset construction is a real vector space
Statement
For the construction in Cost-zero type offsets and their difference space, is an equivalence compatible with product and positive scaling; is a real vector space and its displayed operations are representative-independent.
Facts & Assumptions
Given: The decorated cost algebra, type composition and scaling, and the formal pair relation in the Definition.
Cost-zero type offsets and their difference space: types are identified at zero cost in both directions, and a pair difference is identified after adding a common catalyst type.
Algebraic properties of decorated-chain costs: costs satisfy nonnegative closed-cycle bounds, triangle inequalities, translation invariance, and positive homogeneity.
Forward-sector hypotheses for a simple state domain: reversible splitting and recombination are allowed for every positive scaled amount.
Proof
The relation is reflexive because , and symmetric by definition. Suppose and . The triangle inequality gives both directed costs between and at most zero. For any , choose a finite reverse witness of cost ; such a witness exists because the reverse infimum is at most zero; a value below must exist by the greatest-lower-bound convention, even if that infimum were initially . Every forward witness of cost closes with it, so [F2] gives , hence . Letting shows every forward witness has nonnegative cost and its infimum is at least zero; the same argument reverses the direction. Both infima are therefore zero, proving transitivity. The same argument proves product compatibility: subadditivity makes both product costs at most zero, and any finite reverse witness bounds every forward product witness below by a quantity tending to zero. Positive homogeneity gives scaling compatibility directly. Thus is an equivalence compatible with product and positive scaling, and the quotient is a commutative monoid.
Reversible splitting [A1] gives accessible transitions in both directions between and . Extensivity makes each such edge have zero entropy cost. Any reverse witness bounds all forward costs below by [F2]'s closed-cycle inequality, so both infima are zero. Hence . The empty type is an identity under composition; its reassociation and permutation identifications have zero cost by the type conventions.
The pair relation is reflexive using unit catalyst and symmetric by swapping the two sides. Suppose via catalyst , and via catalyst . Their witnesses are Multiply the first equivalence by , the second by , and compose. Reassociating and permuting gives which witnesses . Hence is an equivalence relation.
Suppose via , so . For an arbitrary pair , multiply this witness by . Reassociation gives , exactly the witness for . Apply the same argument to a change of representative of and use transitivity; addition is representative-independent. Scaling a catalyst witness by and using product compatibility from step 1.1 proves that positive scalar multiplication is representative-independent. Product commutativity and associativity give the additive laws, and the empty type gives . Swapping a pair gives an inverse: its sum with is , equivalent to with unit catalyst because the two product types agree up to permutation and have zero cost in both directions. Thus the classes form an abelian group with zero .
For , the displayed operation satisfies because scaling distributes over type composition, and for by associativity of type scaling. Also . The scalar-addition law for positive follows from step 1.2: The zero scalar is defined as the additive identity, and is defined as , where swaps the pair.
The positive scalar laws extend to negative scalars by swapping pairs. For the scalar-addition law with opposite signs, write with . If , positive scalar addition gives , so cancellation in the additive group gives ; if , apply the same identity to and negate. Cases with zero are immediate. For scalar composition, write each nonzero scalar as its sign times a positive magnitude; the defined action swaps the pair once for each negative sign and scales by the product of magnitudes, so , with zero cases immediate. For distributivity over vector addition, positive scalars distribute by step 4.1 and a negative scalar distributes by taking the additive inverse of that identity. Together with the abelian-group laws in step 3.1, these are all real-vector-space axioms.
No-sinks cost offsets give a weak global entropy
Statement
Assume the Axiom of Choice. Let be the decorated cost of Decorated finite-chain costs with catalysts, and assume the no-sinks condition
for every type pair. Let be the real difference space of Cost-zero type offsets and their difference space. Then there is an additive extensive offset such that
If every admitted cross-type transition from to satisfies the calibrated cost inequality of Catalyst-chain cost characterizes cross-type transitions, then is nondecreasing across every such transition. Only this weak inequality is asserted; no-gap equalities and strict extensions are not concluded.
Facts & Assumptions
Given: The no-sinks condition, A1–A6 for cross-type transitions, the finite-chain costs, and the Axiom of Choice.
The Axiom of Choice: adopt AC for the Hahn–Banach dominated-extension and basis-extension steps in the vector-space supplier.
Cost-zero type offsets and their difference space and The cost-zero offset construction is a real vector space: is a real vector space of formal type differences, with composition additive and positive scaling homogeneous.
Algebraic properties of decorated-chain costs: , is translation-invariant, positively homogeneous and subadditive, finite reverse witnesses bound forward costs, and costs have no negative cycles.
Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets: under AC, a sublinear with and symmetric finite domain admits a linear with .
Catalyst-chain cost characterizes cross-type transitions: every admitted transition satisfies .
Proof
Given: [A1], [F1]–[F4], and the no-sinks condition.
If , no-sinks gives a finite reverse witness of some real cost . Concatenating it with any forward witness makes a closed chain, so [F2] gives forward cost at least . Thus whenever it is finite; all cost values are in .
For a pair class , define . Suppose via , so . Put . Since , the triangle inequality gives and ; the costs have no by step 1.1, so these inequalities imply equality. Catalyst invariance from [F2] gives and . Therefore is independent of the pair representative.
The identity gives . Homogeneity of gives for , and its product subadditivity gives . The no-sinks condition says exactly when . By step 1.1, has no value.
Apply [F3] to and . It gives a real-linear with for all . Put , where is the empty unit type. Since , is additive. Since (the unit type satisfies ), for . Also , so applying the sandwich to this pair gives the displayed two-sided cost bound.
For an admitted transition, [F4] gives , while step 3.1 gives . Subtracting the latter from the former yields Thus the offset entropy is nondecreasing across every admitted transition.
Remarks
The no-sinks condition is an explicit hypothesis about cross-type reachability. AC is used by Infinite-valued no-sinks Hahn–Banach sandwich and conditional offsets and is carried here. The result does not assert a no-gap condition, a unique offset, or an exact entropy principle for all transitions.
5 · Examples, experiments and counterexamples
None yet.
Sources
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §§III.A–III.B
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, Chapters 2 and 4, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §IV.A, pp. 51–54
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §§III.B–III.C
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, §§4.1 and 7.2–7.3, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §III.C
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, Appendix 9.9, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 2.1 and §III.C
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §II.D
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, §4.1, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 4.1, p. 51
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, Chapter 4, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §IV.B.1, pp. 54–56
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Lemma 3.1 and Theorem 3.2, pp. 42–45
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 3.2, pp. 43–45
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorems 3.6–3.8, pp. 47–50
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorems 3.3–3.5, pp. 45–47
- Daniel Arovas, Lecture Notes on Thermodynamics and Statistical Mechanics, §§5.1 and 7.2–7.3, complete 607-page edition
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 4.4 and Lemma 4.1, pp. 54–56
- Lieb and Yngvason, single-system energy orientation and thermal-contact axioms, §§III–IV; the common-sign deduction is supplied locally
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 4.6, pp. 56–57
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorems 4.5–4.8, pp. 55–59
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 2.5 and §IV.B.2, pp. 27–29, 56–59
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §VI.B, Eqs. 6.6, 6.9, and 6.10, pp. 74–75
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §VI.B, Eqs. 6.6–6.16, pp. 74–75
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, Theorem 6.1 and proof, pp. 75–76
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §VI.B, pp. 76–79
- Lieb and Yngvason, The Physics and Mathematics of the Second Law of Thermodynamics, §VI.B, pp. 76–80