By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

A counterexample to the coarse Novikov conjecture

There is a uniformly discrete bounded-geometry metric space XX, which is a coarse disjoint union of finite connected graphs of uniformly bounded degree, and an infinite-order element α∈KX1(X)\alpha \in KX_1(X) such that μX(α)=0\mu_X(\alpha) = 0 in K1(C∗(X))K_1(C^*(X)). Consequently, ordinary coarse assembly for XX fails to be injective both integrally and after tensoring its domain and target with Q\mathbb{Q}.

For every integer r≥1r \ge 1 there is a homomorphism λr:K1lf(Pr(X))→Z\lambda_r : K_1^{\mathrm{lf}}(P_r(X)) \to \mathbb{Z} such that λr(αr)=1\lambda_r(\alpha_r) = 1. Consequently, every nonzero integer multiple of α\alpha is nonzero in KX1(X)KX_1(X).

Let DD and XX be countable uniformly discrete bounded-geometry spaces with a partition X=∐u∈DFuX = \coprod_{u \in D} F_u into nonempty finite sets, ξu=∣Fu∣−1/2∑x∈Fuδx\xi_u = |F_u|^{-1/2} \sum_{x \in F_u} \delta_x, and PP the orthogonal projection on ℓ2(X)\ell^2(X) onto the span of the ξu\xi_u. If (1) PP is an operator-norm limit of finite-propagation contractions PnP_n on ℓ2(X)\ell^2(X) and (2) for every R<∞R < \infty there is sR<∞s_R < \infty such that whenever dD(u,v)≤Rd_D(u,v) \le R there is a contraction Ouv:ℓ2(Fv)→ℓ2(Fu)O_{uv} : \ell^2(F_v) \to \ell^2(F_u) of propagation at most sRs_R with Ouvξv=ξuO_{uv}\xi_v = \xi_u, then conjugation by V:ℓ2(D)⊗H0→ℓ2(X)⊗H0V : \ell^2(D) \otimes \mathcal{H}_0 \to \ell^2(X) \otimes \mathcal{H}_0, V(δu⊗h)=ξu⊗hV(\delta_u \otimes h) = \xi_u \otimes h, defines a ∗*-homomorphism Ad V:C∗(D)→C∗(X)\mathrm{Ad}\,V : C^*(D) \to C^*(X).

For the constructed spaces DD and XX, Φ=Ad V:C∗(D)→C∗(X)\Phi = \mathrm{Ad}\,V : C^*(D) \to C^*(X) is a ∗*-homomorphism.

The coarse assembly image μX(α)\mu_X(\alpha) vanishes in K1(C∗(X))K_1(C^*(X)).

For each integer A≥1A \ge 1 there is an integer N(A)≥1N(A) \ge 1 such that, whenever ℓ≥N(A)\ell \ge N(A), 0<∣m∣≤A0 < |m| \le A, and w∈Γw \in \Gamma has word length at most AA with respect to SS, tr(gℓm)≠tr(w)(mod2ℓ)\mathrm{tr}(g_\ell^m) \neq \mathrm{tr}(w) \pmod{2^\ell}.

For each integer A≥1A \ge 1 there is J(A)J(A) such that, for all j≥J(A)j \ge J(A), every closed edge path in XjX_j of length at most AA has charge zero. One may take J(A)=max⁡{2,N(A)+⌊A/2⌋}J(A) = \max\{2, N(A) + \lfloor A/2 \rfloor\}, with N(A)N(A) from Lemma 3.1.

Methods

Transportation metric on the Rips complex Pr(Y)P_r(Y) viewing points as finitely supported probability measures on YY with support diameter at most rr.

Source excerpts

“Regard a point as a finitely supported probability measure on Y whose support has diameter at most r, and use the transportation metric dr(ν, η) = inf π X x,y∈Y dY (x, y)π(x, y), (1) where π ranges over the couplings of ν and η.” · Show in paper

Construction of finite graphs XjX_j by fibering congruence quotients Qkj(u)=SL3(Z/2kj(u)Z)Q_{k_j(u)} = \mathrm{SL}_3(\mathbb{Z}/2^{k_j(u)}\mathbb{Z}) over triangular lattice discs DjD_j with left-Cayley fiber edges and right-holonomy twisted inter-fiber edges.

Source excerpts

“The vertices of Xj are {(u, q) : u ∈ Dj , q ∈ Qkj (u)}. Put undirected edges of length one as follows; repeated edges and loops may be discarded. 1. Within the fiber over u, join q to sq for every s ∈ S. 2. If (u, v) is an oriented base edge with equal depth k, join (u, q) to (v, qga(u,v) k ). 3. If (u, v) goes from depth k+1 to depth k, join (u, q) to (v, qg¯ a(u,v) k ), where q¯ denotes reduction. The reverse direction uses the inverse edge relation.” · Show in paper

Coarse disjoint union of finite graphs by joining chosen basepoints of successive components with auxiliary edges of length Mj=100+j2M_j = 100 + j^2 without adding vertices.

Source excerpts

“join the chosen basepoints of successive components by an auxiliary edge of length Mj = 100 + j 2 ; in Xj use (bj , 1). Use the induced path distance on the original vertex sets, without adding vertices along these auxiliary edges.” · Show in paper

Uniform operator-norm approximation of constant-fiber projections using lazy averaging powers (1−Lk/2)n(1 - L_k/2)^n derived from Kazhdan's property (T) for SL3(Z)\mathrm{SL}_3(\mathbb{Z}).

Source excerpts

“If pk denotes projection onto the normalized constant vector, it follows that ∥(1 − Lk/2)n − pk∥ ≤ (1 − δ/2)n . (12) For k = 0 the approximation is exact. Take the direct sum of these lazy averaging powers over all fibers and call it Pn.” · Show in paper